Abstract
When analyzing the round complexity of multi-party computation (MPC), one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement. For example, it is impossible to implement a broadcast channel by a (deterministic) protocol in a sub-linear (in the number of corrupted parties) number of rounds. The seminal works of Rabin and Ben-Or from the early 80’s demonstrated that limitations as the above can be overcome by allowing parties to terminate in different rounds, igniting the study of protocols with probabilistic termination. However, absent a rigorous simulation-based definition, the suggested protocols are proven secure in a property-based manner, guaranteeing limited composability. In this work, we define MPC with probabilistic termination in the UC framework. We further prove a special universal composition theorem for probabilistic-termination protocols, which allows to compile a protocol using deterministic-termination hybrids into a protocol that uses expected-constant-round protocols for emulating these hybrids, preserving the expected round complexity of the calling protocol. We showcase our definitions and compiler by providing the first composable protocols (with simulation-based security proofs) for the following primitives, relying on point-to-point channels: (1) expected-constantround perfect Byzantine agreement, (2) expected-constant-round perfect parallel broadcast, and (3) perfectly secure MPC with round complexity independent of the number of parties.
Original language | English |
---|---|
Title of host publication | Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings |
Editors | Matthew Robshaw, Jonathan Katz |
Publisher | Springer Verlag |
Pages | 240-269 |
Number of pages | 30 |
ISBN (Print) | 9783662530146 |
DOIs | |
State | Published - 2016 |
Event | 36th Annual International Cryptology Conference, CRYPTO 2016 - Santa Barbara, United States Duration: 14 Aug 2016 → 18 Aug 2016 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9816 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 36th Annual International Cryptology Conference, CRYPTO 2016 |
---|---|
Country/Territory | United States |
City | Santa Barbara |
Period | 14/08/16 → 18/08/16 |
Bibliographical note
Publisher Copyright:© International Association for Cryptologic Research 2016.
Funding
V. Zikas—Work supported in part by the Swiss NSF Ambizione grant PZ00P2_142549. R. Cohen—Work supported by a grant from the Israel Ministry of Science, Technology and Space (grant 3-10883) and by the National Cyber Bureau of Israel. S. Coretti—Work supported by the Swiss NSF project no. 200020-132794. J. Garay and V. Zikas—Work done in part while the author was visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant #CNS-1523467.
Funders | Funder number |
---|---|
National Cyber Bureau of Israel | |
Swiss NSF | PZ00P2_142549, 200020-132794 |
National Science Foundation | -1523467 |
Simons Foundation | |
Ministry of Science, Technology and Space | 3-10883 |