Ran Canetti
Tal Rabin
- AM.H. Attiya and M. Mavronicolas, "Efficiency of Semi, Synchronous versus Asynchronous Networks," Mathematical Systems Theory, to appear. Preliminary version in proceedings of the 28th annual Allerton Conference on Communication, Control and Computing, October 1990, pp. 578-587.Google Scholar
- BCG.M. Ben-Or, R. Canetti and O. Goldreich, "Asynchronous Secure Computations", submitted to these proceedings. Google ScholarDigital Library
- BE.M. Ben-Or and R. EI-Yaniv, "Interactive Consistency in Constant Time", submitted for publication, 1991Google Scholar
- BGW.M. Ben-Or, S. Goldwasser and A. Wigderson, " Completeness Theorems for Non-Cryptographic Fault- Tolerant Distributed Computation", 20th STOC, pp. 1-10, 1988. Google ScholarDigital Library
- Br.G. Bracha, "An Asynchronous {(n- 1)/3J-resilient Consensus Protocol", 3rd PODC, pp. 154-162, 1984. Google ScholarDigital Library
- CR.R. Canetti, and T. Rabin, "Optimal Asynchronous Byzantine Agreement", Technical Report #92-15, CS Department, Hebrew University, 1992.Google Scholar
- CCD.D. Chaum, C. Crepeau and i. Damgard, "Multiparty Unconditionally Secure Protocols", 20th STOC, pp. 11-19, 1988. Google ScholarDigital Library
- CGMA.B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults", 26th FOCS, pp. 383-395, 1985.Google ScholarDigital Library
- CD.B. Chor and C. Dwork, "Randomization in Bysantine Agreement", Advances in Computing Research, Vol. 5, pp. 443-497, 1989.Google Scholar
- Fe.P. Feldman, "Asynchronous Byzantine Agreement in Constant Expected Time", unpublished manuscript, 1989.Google Scholar
- FM.P. Feldman, and S. Micah, "An Optimal Algorithm For Synchronous Byzantine Agreement", 20th STOC, pp. 148-161, 1988. Google ScholarDigital Library
- F.M. Fischer, "The Concensus Problem in Unreliable Distributed System", Technical Report, Yale University, 1983.Google Scholar
- FLP.M. Fischer, N. Lynch and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", JACM, Vol. 32, no. 2, pp. 374-382, 1985. Google ScholarDigital Library
- KY.A. Karlin and A. Yao, "Probabilistic Lower Bounds for Byzantine Agreement", unpublished manuscript, 1986.Google Scholar
- PSL.M. Pease, R. Shostak and L. Lamport, "Reaching Agreement in the Presence of Faults", JACM, Vol. 27 No. 2, pp. 228-234, 1980. Google ScholarDigital Library
- R1.M. Rabin, "Randomized Byzantine Generals", 24th FOCS, pp. 403-409, 1983.Google Scholar
- R2.T. Rabin, "Robust Sharing Of Secrets When The Dealer Is Honest Or Faulty", Masters Thesis, Hebrew University, submitted for publication to the JA CM.Google Scholar
- RB.T. Rabin and M. Ben-Or, "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority", 21st STOC, pp. 73-85, 1989. Google ScholarDigital Library
- Sh.A. Shamir, "How to share a secret", CA CM, Vol. 22, No. 11, pp. 612-613, 1979. Google ScholarDigital Library
Index Terms
- Fast asynchronous Byzantine agreement with optimal resilience
Recommendations
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed ComputingWe provide a new protocol for Validated Asynchronous Byzantine Agreement in the authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine ...
Optimal resilience asynchronous approximate agreement
OPODIS'04: Proceedings of the 8th international conference on Principles of Distributed SystemsConsider an asynchronous system where each process begins with an arbitrary real value. Given some fixed ε>0, an approximate agreement algorithm must have all non-faulty processes decide on values that are at most ε from each other and are in the range ...
Revisiting Optimal Resilience of Fast Byzantine Consensus
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingIt is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three message ...
Comments