TY - CHAP
T1 - The BGW protocol for perfectly-secure multiparty computation
AU - Asharov, Gilad
AU - Lindell, Yehuda
PY - 2013
Y1 - 2013
N2 - 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].
AB - 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].
UR - http://www.scopus.com/inward/record.url?scp=84888163688&partnerID=8YFLogxK
U2 - 10.3233/978-1-61499-169-4-120
DO - 10.3233/978-1-61499-169-4-120
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:84888163688
SN - 9781614991687
T3 - Cryptology and Information Security Series
SP - 120
EP - 167
BT - Secure Multi-Party Computation
PB - IOS Press
ER -