From consensus to atomic broadcast: Time-free byzantine-resistant protocols without signatures

Computer Journal

Volumn 49, Issue 1, 2006, Pages 82-96

  Correia, Miguel ^a   Neves, Nuno Ferreira ^a   Veríssimo, Paulo ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

ATOMIC BROADCAST; BYZANTINE FAULTS; BYZANTINE-RESISTANT PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 30444456076     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh145     Document Type: Article

References (44)

1. Pease, M., Shostak, R. and Lamport, L. (1980) Reaching agreement in the presence of faults. J. ACM, 27, 228-234.
2. Lamport, L., Shostak, R. and Pease, M. (1982) The Byzantine generals problem. ACM Trans. Progr. Lang. Syst., 4, 382-401.
3. Rabin, M. O. (1983) Randomized Byzantine generals. In Proc. 24th Annual IEEE Symp. Foundations of Computer Science, Tucson, AZ, November 7-9, pp. 403-409. IEEE Computer Society Press, Los Alamitos, USA.
4. Ben-Or, M. (1983) Another advantage of free choice: Completely asynchronous agreement protocols. In Proc. 2nd ACM Symp. Principles of Distributed Computing, Montreal, Canada, August 17-19, pp. 27-30. ACM Press, New York, USA.
5. Veríssimo, P., Neves, N. F. and Correia, M. (2003) Intrusion-tolerant architectures: Concepts and design. In Lemos, R., Gacek, C. and Romanovsky, A. (eds), Architecting Dependable Systems, LNCS, 2677, pp. 3-36. Springer-Verlag, London, UK.
6. Castro, M. and Liskov, B. (2002) Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 20, 398-461.
7. Schneider, F.B. (1990) Implementing faul-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv., 22, 299-319.
8. Reiter, M. K. (1995) The Rampart toolkit for building high-integrity services. In Theory and Practice in Distributed Systems, LNCS, 938, pp. 99-110. Springer-Verlag, London, UK.
9. Bracha, G. (1984) An asynchronous ⌊(n - 1)/3⌋-resilient consensus protocol. In Proc. 3rd ACM Symp. Principles of Distributed Computing, Vancouver, Canada, August 27-29, pp. 154-162. ACM Press, New York, USA.
10. Canetti, R. and Rabin, T. (1993) Fast asynchronous Byzantine agreement with optimal resilience. In Proc. 25th Annual ACM Symp. Theory of Computing, San Diego, USA, May 16-18, pp. 42-51. ACM Press, New York, USA.
11. Fischer, M. J., Lynch, N. A. and Paterson, M. S. (1985) Impossibility of distributed consensus with one faulty process. J. ACM, 32, 374-382.
12. Toueg, S. (1984) Randomized Byzantine agreements. In Proc. 3rd ACM Symp. Principles of Distributed Computing, Vancouver, Canada, August 27-29, pp. 163-178. ACM Press, New York, USA.
13. Bracha, G. and Toueg, S. (1985) Asynchronous consensus and broadcast protocols. J. ACM, 32, 824-840.
14. Cachin, C., Kursawe, K. and Shoup, V. (2000) Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. In Proc. 19th ACM Symp. Principles of Distributed Computing, Portland, USA, July 16-19, pp. 123-132. ACM Press, New York, USA.
15. Dwork, C., Lynch, N. and Stockmeyer, L. (1988) Consensus in the presence of partial synchrony. J. ACM, 35, 288-323.
16. Fetzer, C. and Cristian, F. (1995) On the possibility of consensus in asynchronous systems. In Proc. Pacific Rim Int. Symp. Fault-Tolerant Systems, Newport Beach, USA, December 4-5, pp. 86-91. IEEE Computer Society Press, Los Alamitos, CA.
17. Veríssimo, P. and Almeida, C. (1995) Quasi-synchronism: A step away from the traditional fault-tolerant real-time system models. Bullettin of the Technical Committee on Operating Systems and Application Environments, 7, 35-39.
18. Chandra, T. and Toueg, S. (1996) Unreliable failure detectors for reliable distributed systems. J. ACM, 43, 225-267.
19. Reiter, M. (1994) Secure agreement protocols: Reliable and atomic group multicast in Rampart. In Proc. 2nd ACM Conf. Computer and Communications Security, Fairfax, USA, November 2-4, pp. 68-80. ACM Press, New York, USA.
20. Doudou, A. and Schiper, A. (1997) Muteness Detectors for Consensus with Byzantine Processes. TR DSC 1997-30. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland.
21. Baldoni, R., Helary, J., Raynal, M. and Tanguy, L. (2000) Consensus in Byzantine asynchronous systems. In Proc. Int. Colloquium on Structural Information and Communication Complexity, L'Aquila, Italy, June 20-22, pp. 1-16. Carleton Scientific, Waterloo, Canada.
22. Doudou, A., Garbinato, B. and Guerraoui, R. (2002) Encapsulating failure detection: From crash-stop to Byzantine failures. In Blieberger, J. and Strohmeier, A. (eds), Int. Conf. Reliable Software Technologies, Ada-Europe, June 17-21, LNCS, 2361, pp. 24-50. Springer-Verlag, Berlin, Germany.
23. Pedone, F., Schiper, A., Urbán, P. and Cavin, D. (2002) Solving agreement problems with weak ordering oracles. In Grandoni, F. and Thévenod-Fosse, P. (eds), Proc. Fourth European Dependable Computing Conf., Parc des Expositions, Toulouse, France, October 23-25, LNCS, 2485, pp. 44-61. Springer-Verlag, London, UK.
24. Correia, M., Neves, N. F., Lung, L. C. and Veríssimo, P. (2005) Low complexity Byzantine-resilient consensus. Distrib. Comput., 17, 237-249.
25. Neves, N. F., Correia, M. and Veríssimo, P. (2004) Wormhole-aware Byzantine protocols. In 2nd Bertinoro Workshop on Future Directions in Distributed Computing: Survivability, Obstacles and Solutions, Bertinoro, Italy, June 23-25.
26. Neves, N. F., Correia, M. and Veríssimo, P. (2005) Solving vector consensus with a wormhole. IEEE Trans. Parall. Distrib. Sys., 16, 1120-1130.
27. Mostefaoui, A., Rajsbaum, S. and Raynal, M. (2003) Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM, 50, 922-954.
28. Friedman, R., Mostefaoui, A., Rajsbaum, S. and Raynal, M. (2002) Distributed agreement and its relation with error-correcting codes. In Malkhi, D. (ed.), Proc. 16th Int. Conf. Distributed Computing, Toulouse, France, October 28-30, LNCS, 2508, pp. 63-87. Springer-Verlag, London, UK.
29. Guerraoui, R. and Schiper, A. (1997) Consensus: The big misunderstanding. In Proc. IEEE Int. Workshop on Future Trends in Distributed Computing Systems, Tunis, Tunisia, October, pp. 183-188. IEEE Computer Society Press, Washington, USA.
30. Hadzilacos, V. and Toueg, S. (1994) A Modular Approach to Fault-Tolerant Broadcasts and Related Problems. Technical Report TR94-1425, Department of Computer Science, Cornell University, Ithaca, USA.
31. Cachin, C., Kursawe, K., Petzold, F. and Shoup, V. (2001) Secure and efficient asynchronous broadcast protocols (extended abstract). In Kilian, J. (ed.), Advances in Cryptology: CRYPTO 2001, Santa Barbara, CA, August 19-23, LNCS, 2139, pp. 524-541. Springer-Verlag, New York, USA.
32. Ben-Or, M. and El-Yaniv, R. (2003) Optimally-resilient interactive consistency in constant time. Distrib. Comput., 16, 249-262.
33. Menezes, A. J., Oorschot, P. C. V. and Vanstone, S. A. (1997) Handbook of Applied Cryptography. CRC Press, Boca Raton, USA.
34. Malkhi, D. and Reiter, M. (1997) Unreliable intrusion detection in distributed computations. In Proc. 10th Computer Security Foundations Workshop, Rockport, USA, June 10-12, pp. 116-124. IEEE Computer Society Press, Los Alamitos, USA.
35. Kihlstrom, K. P., Moser, L. E. and Melliar-Smith, P. M. (2003) Byzantine fault detectors for solving consensus. Comput. J., 46, 16-35.
36. Guerraoui, R. and Schiper, A. (2001) The generic consensus service. IEEE Trans. Softw. Eng., 27, 29-41.
37. NIST (1994) Announcement of weakness in the secure hash standard. National Institute of Standards and Technology, Gaithersburg, USA.
38. Ezhilchelvan, P., Mostefaoui, A. and Raynal, M. (2001) Randomized multivalued consensus. In Proc. 4th IEEE Int. Symp. Object-Oriented Real-Time Computing, Magdeburg, Germany, May 2-4, pp. 195-200. IEEE Computer Society Press, Los Alamitos, USA.
39. Mostefaoui, A., Raynal, M. and Tronel, F. (2000) From binary consensus to multivalued consensus in asynchronous message-passing systems. Inform. Process. Lett., 73, 207-212.
40. Turpin, R. and Coan, B. A. (1984) Extending binary Byzantine agreement to multivalued Byzantine agreement. Inform. Process. Lett., 18, 73-76.
41. Dutta, P., Guerraoui, R. and Vukolic, M. (2005) Best-Case Complexity of Asynchronous Byzantine Consensus. Technical Report 200499, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland.
42. Moser, L. E. and Melliar-Smith, P. M. (1999) Byzantine-resistant total ordering algorithms. Inform. Comput., 150, 75-111.
43. Kihlstrom, K. P., Moser, L. E. and Melliar-Smith, P. M. (2001) The SecureRing group communication system. ACM Trans. Inform. Syst. Security, 4, 371-406.
44. Défago, X., Schiper, A. and Urbán, P. (2004) Totally ordered broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv., 36, 372-421.