scholarly journals Efficient Multiparty Protocols via Log-Depth Threshold Formulae

2013 ◽  
pp. 185-202 ◽  
Author(s):  
Gil Cohen ◽  
Ivan Bjerre Damgård ◽  
Yuval Ishai ◽  
Jonas Kölker ◽  
Peter Bro Miltersen ◽  
...  
Keyword(s):  
Multiparty Protocols

scholarly journals SMC PROTOCOL FOR DISTRIBUTED K- ANONYMITY

2013 ◽  
pp. 69-72
Author(s):  
V. SIREESHA ◽  
B. OBULESU
Keyword(s):  
Objective Function ◽  
Experimental Results ◽  
Amount Of Information ◽  
Acceptable Range ◽  
Look Ahead ◽  
Multiparty Protocols ◽  
The Look

Secure multiparty protocols have been proposed to enable non colluding parties to cooperate without a trusted server. Even though such protocols put off information exposé other than the objective function, they are quite costly in computation and communication. The high overhead motivates parties to estimate the utility that can be achieved as a result of the protocol beforehand. To avoid this issue we propose a look-ahead approach, specifically for secure multiparty protocols to achieve distributed k-anonymity, which helps parties to decide if the utility benefit from the protocol is within an acceptable range before initiating the protocol. The look-aheadoperation is highly localized and its accuracy depends on the amount of information the parties are willing toshare. Experimental results show the effectiveness of the proposed methods.

scholarly journals Causal Consistency for Reversible Multiparty Protocols

2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Claudio Antares Mezzina ◽  
Jorge A. Pérez
Keyword(s):  
Process Model ◽  
Asynchronous Communication ◽  
Synchronous Communication ◽  
Programming Models ◽  
Prior Work ◽  
Behavioral Types ◽  
Session Types ◽  
Causal Consistency ◽  
Multiparty Protocols

In programming models with a reversible semantics, computational steps can be undone. This paper addresses the integration of reversible semantics into process languages for communication-centric systems equipped with behavioral types. In prior work, we introduced a monitors-as-memories approach to seamlessly integrate reversible semantics into a process model in which concurrency is governed by session types (a class of behavioral types), covering binary (two-party) protocols with synchronous communication. The applicability and expressiveness of the binary setting, however, is limited. Here we extend our approach, and use it to define reversible semantics for an expressive process model that accounts for multiparty (n-party) protocols, asynchronous communication, decoupled rollbacks, and abstraction passing. As main result, we prove that our reversible semantics for multiparty protocols is causally-consistent. A key technical ingredient in our developments is an alternative reversible semantics with atomic rollbacks, which is conceptually simple and is shown to characterize decoupled rollbacks.

Sign in / Sign up

Export Citation Format

Share Document