Quorum-Based Secure Multi-party Computation

Abstract. This paper describes e cient 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 naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general, and they have speci c applicability to several problems in distributed control and management. The achievable limits of security in quorum-based multiparty 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 speci c applications, the protocols presented here are simpler and more e cient.

• Type: Conference
• Year: 1998
• Where: EUROCRYPT
• Authors: Donald Beaver, Avishai Wool
• Keywords: Access Structures, Cryptology, EUROCRYPT 1998, Multi-party Computation, Quorum Systems