Efficient Perfectly Secure Computation with Optimal Resilience

Secure computation enables n mutually distrustful parties to compute a function over their private inputs jointly. In 1988, Ben-Or, Goldwasser, and Wigderson (BGW) proved that any function can be computed with perfect security in the presence of a malicious adversary corrupting at most t < n / 3...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of cryptology 2022-10, Vol.35 (4), Article 27
Hauptverfasser:	Abraham, Ittai, Asharov, Gilad, Yanai, Avishay
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Coding and Information Theory Combinatorics Communication Communications Engineering Complexity Computational Mathematics and Numerical Analysis Computer Science Networks Polynomials Probability Theory and Stochastic Processes Research Article Resilience Security
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!