Declarative Reliable Multi-Party Protocols

نویسندگان

  • Krzysztof Ostrowski
  • Ken Birman
  • Danny Dolev
چکیده

We propose a novel, declarative approach to implementing reliable multi-party protocols that enables efficient and scalable implementations. Our Properties Framework (PF) is able to express semantics as simple as gossip or resource cleanup, or as complex as transactions, consensus, and virtual synchrony. Protocols written in the PF compile to a hierarchical, scalable runtime infrastructure. Evaluation confirms that solutions developed this way can achieve high performance, while also benefiting from better integration with the underlying runtime platform and its

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Party Quantum Dialogue with the Capability to Expand the Number of Users at Runtime

Quantum dialogue is a type of quantum communication in which users can simultaneously send messages to each other. The earliest instances of quantum dialogue protocols faced security problems such as information leakage and were vulnerable to intercept and resend attacks. Therefore, several protocols have been presented that try to solve these defects. Despite these improvements, the quantum di...

متن کامل

Exclusion-Freeness in Multi-party Exchange Protocols

In this paper we define a property for multi-party protocols called exclusion-freeness. In multi-party protocols respecting the strongest definition of this property, participants are sure that they will not be excluded from a protocol’s execution and, consequently, they do not have to trust each other any more. We study this property on a wellknown multi-party fair exchange protocol with an on...

متن کامل

Fair and Privacy-Preserving Multi-party Protocols for Reconciling Ordered Input Sets

In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacypreserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we prop...

متن کامل

ID-based Multi-party Authenticated Key Agreement Protocols from Multilinear Forms

Nalla and Reddy [6] presented new ID-based tripartite authenticated key agreement protocols from parings. Recently, Boneh and Silverberg [4] studied a one round multi-party key agreement protocols using the certificates from multilinear forms. In this paper, we propose new ID-based multi-party authenticated key agreement protocols, which use the identity information of a user as his long-term p...

متن کامل

Multi-party authenticated key agreement protocols from multi-linear forms

Joux [10] presented a one round protocol for tripartitie key agreement and Al-Riyami et.al. [15] developed a number of tripartitie, one round, authenticated protocols related to MTI and MQV protocols. Recently, Boneh and Silverleg [4] studied multilinear forms, which provides a one round multi-party key agreement protocol. In this paper, we propose (n + 1) types of one round authenticated multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007