Sequential composition of protocols without simultaneous termination

DOI10.1145/571825.571859zbMath1292.68023OpenAlexW2015593155MaRDI QIDQ5170881

Tal Rabin, Yehuda Lindell, Anna Lysyanskaya

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571859

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (12)

Improving the round complexity of VSS in point-to-point networks ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ From Passive to Covert Security at Low Cost ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Sequential composition of protocols without simultaneous termination