An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
From MaRDI portal
Publication:4376159
DOI10.1137/S0097539790187084zbMath0885.68077WikidataQ56032156 ScholiaQ56032156MaRDI QIDQ4376159
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68R05: Combinatorics in computer science
94A60: Cryptography
94A99: Communication, information
68M15: Reliability, testing and fault tolerance of networks and computer systems
94B99: Theory of error-correcting codes and error-detecting codes
68W15: Distributed algorithms
Related Items
Tight bound on mobile Byzantine agreement, On expected constant-round protocols for Byzantine agreement, Perfect information leader election in \(\log^*n+O(1)\) rounds, Asynchronous Byzantine agreement with optimal resilience, Lower bound for scalable Byzantine agreement, Improving the round complexity of VSS in point-to-point networks, Secure multi-party computation made simple, Probabilistic Termination and Composability of Cryptographic Protocols, Secure Message Transmission by Public Discussion: A Brief Survey