Asynchronous Byzantine Agreement with optimal resilience
Open Access
- 10 November 2013
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 27 (2) , 111-146
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The Round Complexity of Verifiable Secret Sharing Revisited2009
- Improving the Round Complexity of VSS in Point-to-Point Networks2008
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing2001
- Efficient Multiparty Computations Secure Against an Adaptive Adversary1999
- An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM Journal on Computing, 1997
- Generalized privacy amplificationIEEE Transactions on Information Theory, 1995
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- How to share a secretCommunications of the ACM, 1979