Quorum-based secure multi-party computation

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

Similar works

Full text

thumbnail-image
oai:CiteSeerX.psu:10.1.1.111.819Last time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.