Communication Locality in Secure Multi-party Computation
We devise multi-party computation protocols for general secure function evaluation with the property that each party is only required to communicate with a small number of dynamically chosen parties. More explicitly, starting with n parties connected via a complete and synchronous network, our proto...
Main Authors: | Boyle, Elette Chantae, Goldwasser, Shafrira, Tessaro, Stefano |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Book |
Language: | English |
Published: |
Springer Berlin Heidelberg
2019
|
Online Access: | https://hdl.handle.net/1721.1/121532 |
Similar Items
-
Secure multi-party protocols under a modern lens
by: Boyle, Elette Chantae
Published: (2013) -
Adaptively Secure Multi-party Computation
by: Canetti, Ran, et al.
Published: (2023) -
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
by: Canetti, Ran, et al.
Published: (2021) -
Leakage-resilient coin tossing
by: Boyle, Elette, et al.
Published: (2012) -
How to Compute in the Presence of Leakage
by: Rothblum, Guy N., et al.
Published: (2018)