Probabilistic Termination and Composability of Cryptographic Protocols

When analyzing the round complexity of multi-party protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement. For example, it is well known that it is impossible to implement a broadcast channel by a (deterministic) pr...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of cryptology Vol. 32; no. 3; pp. 690 - 741
Main Authors:	Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis
Format:	Journal Article
Language:	English
Published:	New York Springer US 15.07.2019 Springer Nature B.V
Subjects:	Channels Coding and Information Theory Combinatorics Communications Engineering Complexity Computational Mathematics and Numerical Analysis Computer Science Computer simulation Cryptography Networks Probability Theory and Stochastic Processes Protocol Simulation Theorems Probabilistic termination Universal composition Randomized Byzantine agreement Cryptographic protocols
ISSN:	0933-2790, 1432-1378
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!