On the composition of authenticated Byzantine Agreement

DOI10.1145/1217856.1217857zbMath1326.68041OpenAlexW1970464137MaRDI QIDQ3455220

Anna Lysyanskaya, Tal Rabin, Yehuda Lindell

Publication date: 4 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsrandomized protocolsprotocol compositionauthenticated Byzantine agreement

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

On the round complexity of randomized Byzantine agreement ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal Byzantine agreement ⋮ Secure consensus with distributed detection via two-hop communication ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation

This page was built for publication: On the composition of authenticated Byzantine Agreement