Quorum-Based Secure Multi-party Computation

This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturally-motivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general, and they have specific applicability to several problems in distributed control and management. The achievable limits of security in quorum-based multi-party computation are shown to be equivalent to those determined by Hirt and Maurer in [HM97], drawing a natural but non-obvious connection between quorum systems and the extremes of secure multi-party computation. Moreover, for both the general case and for specific applications, the protocols presented here are simpler and more efficient.

[1]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[2]  Toshihide Ibaraki,et al.  A Theory of Coteries: Mutual Exclusion in Distributed Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  Hector Garcia-Molina,et al.  Consistency in a partitioned network: a survey , 1985, CSUR.

[4]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[5]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[6]  Zoltán Füredi,et al.  Matchings and covers in hypergraphs , 1988, Graphs Comb..

[7]  Eyal Kushilevitz,et al.  A Zero-One Law for Boolean Privacy , 1991, SIAM J. Discret. Math..

[8]  Moni Naor,et al.  Adaptively secure multi-party computation , 1996, STOC '96.

[9]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[10]  M. P. Herlihy.  REPLICATION METHODS FOR ABSTRACT DATA TYPES , 1984 .

[11]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[13]  Eyal Kushilevitz,et al.  On ultrafilters and NP , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[14]  David Peleg,et al.  Crumbling walls: a class of practical and efficient quorum systems , 1995, PODC '95.

[15]  Moni Naor,et al.  Access Control and Signatures via Quorum Secret Sharing , 1998, IEEE Trans. Parallel Distributed Syst..

[16]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[17]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[18]  Eyal Kushilevitz,et al.  A zero-one law for Boolean privacy , 1989, STOC '89.

[19]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[20]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[21]  Silvio Micali,et al.  Secure Computation (Abstract) , 1991, CRYPTO.

[22]  Ueli Maurer,et al.  Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.

[23]  Donald Beaver,et al.  Multiparty Computation with Faulty Majority , 1989, CRYPTO.

[24]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[25]  Moti Yung,et al.  How to share a function securely , 1994, STOC '94.

[26]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[27]  Donald Beaver,et al.  Cryptographic Protocols Provably Secure Against Dynamic Adversaries , 1992, EUROCRYPT.

[28]  Donald Beaver,et al.  Foundations of Secure Interactive Computing , 1991, CRYPTO.

[29]  Akhil Kumar,et al.  Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data , 1991, IEEE Trans. Computers.

[30]  Moti Yung,et al.  Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.

[31]  Moni Naor,et al.  The Load, Capacity, and Availability of Quorum Systems , 1998, SIAM J. Comput..

[32]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[33]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.