Probabilistic Termination and Composability of Cryptographic Protocols
IACR Cryptology ePrint Archive, Volume 2016, 2016, Pages 240-269.
EI
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 ...More
Code:
Data:
Tags
Comments