Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PERFECT SECURITY:
Reports tagged with perfect security:
TR11-036 | 17th March 2011
Gilad Asharov, Yehuda Lindell

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

Revisions: 5

In the setting of secure multiparty computation, a set of $n$ parties with private inputs wish to jointly compute some functionality of their inputs. One of the most fundamental results of information-theoretically secure computation was presented by Ben-Or, Goldwasser and Wigderson (BGW) in 1988. They demonstrated that any $n$-party functionality ... more >>>




ISSN 1433-8092 | Imprint