On the composition of authenticated byzantine agreement

DOI10.1145/509907.509982zbMath1192.68084OpenAlexW2038789445MaRDI QIDQ3579242

Anna Lysyanskaya, Yehuda Lindell, Tal Rabin

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Network protocols (68M12)

Related Items (7)

PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ Conditional Reactive Simulatability

This page was built for publication: On the composition of authenticated byzantine agreement