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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of cryptology Ročník 32; číslo 3; s. 690 - 741
Hlavní autori:	Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 15.07.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!