Communication and Randomness Lower Bounds for Secure Computation

In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to the other users. While it is known that information theoretically secure MPC is possible among n users having ac...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2016-07, Vol.62 (7), p.3901-3929
Hauptverfasser:	Data, Deepesh, Prabhakaran, Vinod M., Prabhakaran, Manoj M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Communication Complexity theory Computation Computational modeling Cryptography Data integrity Leakage Lower bounds Mathematical analysis Mathematical models Protocol Protocol (computers) Protocols Randomness Servers Upper bound User requirements Users
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!