Randomized intrusion-tolerant asynchronous services

Proceedings of the International Conference on Dependable Systems and Networks

Volumn 2006, Issue , 2006, Pages 568-577

  Moniz, Henrique ^a   Neves, Nuno Ferreira ^a   Correia, Miguel ^a   Verissimo, Paulo ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMMUNICATION; NETWORK PROTOCOLS;

BYZANTINE FAULTS; INTRUSION TOLERANT PROTOCOLS; RANDOMIZATION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33845597282     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2006.60     Document Type: Conference Paper

References (26)

1. R. Baldoni, J. Helary, M. Raynal, and L. Tanguy. Consensus in Byzantine asynchronous systems. In Proc. of the Int. Colloquium on Structural Information and Communication Complexity, pages 116, June 2000.
2. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proc. of the 2nd ACM Symp. on Principles of Distributed Computing, 1983.
3. G. Bracha. An asynchronous ⌊(n - 1)/3⌋-resilient consensus protocol. In Proc. of the 3rd ACM Symp. on Principles of Distributed Computing, pages 154-162, Aug. 1984.
4. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography. In Proc. of the 19th annual ACM symp. on Principles of distributed computing, pages 123-132, New York, NY, USA, 2000. ACM Press.
5. C. Cachin and J. A. Poritz. Secure intrusion-tolerant replication on the Internet. In Proceedings of the International Conference on Dependable Systems and Networks, pages 167-176, June 2002.
6. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. of the 25th Annual ACM Symp. on Theory of Computing, pages 42-51, 1993.
7. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43, 1996.
8. M. Correia, N. F. Neves, L. C. Lung, and P. Verissimo. Low complexity Byzantine-resilient consensus. Distributed Computing, 17(3):237-249, 2005.
9. M. Correia, N. F. Neves, and P. Venssimo. From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures. The Computer Journal, 41(1):82-96, Jan. 2006.
10. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, Jan. 1987.
11. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, Apr. 1988.
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. S. Kent and R. Atkinson. Security architecture for the internet protocol. IETF RFC 2093, Nov. 1998.
14. K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. The SecureRing group communication system. ACM Transactions on Information and System Security, 4, 2001.
15. D. Malkhi and M. Reiter. Unreliable intrusion detection in distributed computations. In Proc.of the 10th Computer Security Foundations Workshop, pages 116-124, June 1997.
16. J. P. Martin and L. Alvisi. Fast Byzantine consensus. In Proceedings of the IEEE International Conference on Dependable Systems and Networks, June 2005.
17. A. J. Menezes, P. C. V. Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
18. L. E. Moser and P. M. Melliar-Smith. Byzantine-resistant total ordering algorithms. Information and Computation, 150:75-111, 1999.
19. N. F. Neves, M. Correia, and P. Verissimo. Solving vector consensus with a wormhole. IEEE Transactions on Parallel and Distributed Systems, 16(12), Dec. 2005.
20. M. O. Rabin. Randomized Byzantine generals. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, pages 403-409, Nov. 1983.
21. H. Ramasamy, P. Pandey, J. Lyons, M. Cukier, and W. H. Sanders. Quantifying the cost of providing intrusion tolerance in group communication systems. In Proceedings of the International Conference on Dependable Systems and Networks, pages 229-238, June 2002.
22. M. Reiter. Secure agreement protocols: Reliable and atomic group multicast in Rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, pages 68-80, Nov. 1994.
23. F. B. Schneider. Implementing faul-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, Dec. 1990.
24. S. Toueg. Randomized Byzantine agreements. In Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pages 163-178, Aug. 1984.
25. P. Verissimo, N. F. Neves, and M. Correia. Intrusion-tolerant architectures: Concepts and design. In Architect ing Dependable Systems. Springer-Verlag, 2003.
26. G. R. Wright and W. R. Stevens. TCP/IP Illustrated, Volume 2: The Implementation. Addison Wesley, 1995.