The BGW protocol for perfectly-secure multiparty computation

Gilad Asharov, Yehuda Lindell

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

Abstract

One of the most fundamental results of secure computation was presented by Ben-Or, Goldwasser and Wigderson (BGW) in 1988. They demonstrated that any n-party functionality can be computed with perfect security, in the private channels model. When the adversary is semi-honest this holds as long as t < n/2 parties are corrupted, and when the adversary is malicious this holds as long as t < n/3 parties are corrupted. In this chapter, we present a full description of the BGW protocol for the semi-honest and malicious settings, along with detailed explanations and intuition regarding the security of the protocols; full proofs can be found in [1].

Original languageEnglish
Title of host publicationSecure Multi-Party Computation
PublisherIOS Press
Pages120-167
Number of pages48
ISBN (Print)9781614991687
DOIs
StatePublished - 2013

Publication series

NameCryptology and Information Security Series
Volume10
ISSN (Print)1871-6431
ISSN (Electronic)1879-8101

Fingerprint

Dive into the research topics of 'The BGW protocol for perfectly-secure multiparty computation'. Together they form a unique fingerprint.

Cite this