Optimistic Byzantine agreement

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 262-267

  Kursawe, Klaus ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FALLBACK PROTOCOLS;

CRYPTOGRAPHY; INFORMATION ANALYSIS; NETWORK PROTOCOLS; OPTIMIZATION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0036444583     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2002.1180196     Document Type: Conference Paper

References (22)

1. M.K. Aguilera and S. Toueg. Randomization and failure detection: A hybrid approach to solve consensus. In Ö. Babaoglu and K. Marzullo, editors, Distributed Algorithms, 10th International Workshop, WDAG '96, volume 1151 of Lecture Notes in Computer Science, pages 29-39, Bologna, Italy, Oct. 1996. Springer.
2. E. Anceaume, B. Charron-Bost, P. Minet, and S. Toueg. On the formal specification of group membership services. Technical Report TR95-1534, Cornell University, Computer Science Department, Aug. 25, 1995.
3. A. Bar-Noy, D. Dolev, C. Dwork, and H.R. Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. Information and Computation, 97(2):205-233, Apr. 1992.
4. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 27-30, Montreal, Quebec, Canada, Aug. 1983.
5. G. Bracha. An O(lg n) expected rounds randomized Byzantine Generals protocol. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 316-326, Providence, Rhode Island, May 1985.
6. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology-Crypto 2001, pages 524-541, San Diego, California, August 2001. Also available from Cryptology ePrint Archive, Report 2001/006, http://eprint.iacr.org/.
7. C. Cachin, K. Kursawe, and V. Shoup. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 123-132, July 2000.
8. T.D. Chandra and S. Toueg. Unreliable failure detectors for asynchronous systems (preliminary version). In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 325-340, Montreal, Quebec, Canada, Aug. 1991.
9. D. Dolev and D. Malki. Consensus made practical. Technical report, Hebrew University of Jerusalem, July 1994.
10. D. Dolev, R. Reischuk, and H.R. Strong. Early stopping in Byzantine agreement. Journal of the ACM, 37(4):720-741, Oct. 1990.
11. A. Doudou and A. Schiper. Muteness Detectors for Consensus with Byzantine Processes, 1998.
12. M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, Apr. 1985.
13. O. Goldreich and E. Petrank. The best of both worlds: Guaranteeing termination in fast Byzantine Agreement protocols. Information Proceeding Letters, 36:45-49, October 1990.
14. K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith. Solving consensus in a Byzantine environment using an unreliable fault detector. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), pages 61-75, Dec. 1997.
15. K. Kursawe and V. Shoup. Optimistic asynchronous atomic broadcast. Cryptology ePrint Archive, Report 2001/022, Mar. 2001. http://eprint.iacr.org/.
16. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
17. D. Malkhi and M. Reiter. Unreliable intrusion detection in distributed computation. In CSFW97, 1997.
18. A. Mostefaoui, M. Raynal, and F. Tronel. The best of both worlds: a hybrid approach to solve consensus. In Proceedings of International Conference on Dependable Systems and Networks ( DSN), pages 513-522, 2000.
19. A. Mostfaoui, S. Rajsbaum, and M. Raynal. Conditions on input vectors for consensus solvability in asynchronous distributed systems. In Symposium on the Theory of Computing (STOC), page 153, 2001.
20. M.K. Reiter. The Rampart Toolkit for Building High-Integrity Services. Theory and Practice in Distributed Systems, pages 99-110, 1995.
21. P. Verissimo and A. Casimiro. The timely computing base. Technical Report DI/FCUL TR-99-2, University of Lisboa, May 1999.
22. A. Zamsky. A randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time. In Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 201-208, Philadelphia, May 1996.