Article thumbnail

Quorum-based secure multi-party computation

By Donald Beaver and Avishai Wool

Abstract

Abstract. This paper describes efficient protocols for multi-party com-putations that are information-theoretically secure against passive at-tacks. 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 in-clude 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 connec-tion between quorum systems and the extremes of secure multi-party computation. Moreover, for both the general case and for specific appli-cations, the protocols presented here are simpler and more efficient

Publisher: Springer-Verlag
Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.111.819
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mathmagic.cn/crypt1... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.