Revisiting liveness properties in the context of secure systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2629, Issue , 2003, Pages 221-238

  Gärtner, Felix C ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FAULT TOLERANCE; NETWORK SECURITY;

BRUTE-FORCE ATTACK; CONCURRENCY THEORY; FAULT TOLERANT SYSTEMS; LIVENESS PROPERTIES; RELATED WORKS; SAFETY PROPERTY; SECURE SYSTEM; SYSTEM PROPERTY;

DENIAL-OF-SERVICE ATTACK;

EID: 35248833782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40981-6_18     Document Type: Article

References (47)

1. Martin Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73-132, January 1993.
2. Martin Abadi and Leslie Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5):1543-1571, September 1994.
3. Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, 1985.
4. Krzysztof R. Apt, Nissim Francez, and Shmuel Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226-241, 1988.
5. Anish Arora and Mohamed Gouda. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering, 19(11):1015-1027, 1993.
6. Anish Arora and Sandeep S. Kulkarni. Component based design of multitolerant systems. IEEE Transactions on Software Engineering, 24(1):63-78, January 1998.
7. Michael Barborak, Anton Dahbura, and Miroslaw Malek. The consensus problem in fault-tolerant computing. ACM Computing Surveys, 25(2):171-220, June 1993.
8. K. J. Biba. Integrity considerations for secure computer systems. Technical Report MTR-3153 Rev. 1, The MITRE Corp., Bedford, Massachusetts, April 1977. Electronic Systems Division, U. S. Air Force Systems Command, Technical Report ESD-TR-76-372.
9. Mike Bond and Ross Anderson. API-level attacks on embedded systems. IEEE Computer, 34(10):67-75, October 2001.
10. Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824-840, October 1985.
11. Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, and Reto Strobl. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS-9), Washington, DC, 2002.
12. Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology - CRYPTO ' 2001, Lecture Notes in Computer Science. International Association for Cryptologic Research, Springer-Verlag, 2001. See [13] for long version.
13. Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. Record 2001/006, Cryptology ePrint Archive, January 2001. An extended abstract was published as [12].
14. Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography. In Proceedings of the Symposium on Principles of Distributed Computing, pages 123-132, Portland, Oregon, 2000.
15. CERT Coordination Center. CERT advisory CA-1996-21 TCP SYN flooding and IP spoofing attacks. Internet: http://www.cert.org/advisories/CA-1996-21. html, September 1996. last revision: November 2000.
16. CERT Coordination Center. Denial of service attacks. Internet: http://www.cert. org/tech_tips/danial_of_service.html, June 2001.
17. CERT Coordination Center. Email bombing and spamming. Internet: http:// www.cert.org/tech_tips/email_bombing_spamming.html, August 2002.
18. Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
19. CNN.com. Cyber-attacks batter web heavyweights. Internet: http://www. cnn.com/2000/TECH/computing/02/09/cyber.attacks.01/index.htm%l, February 2000.
20. Flaviu Cristian and Christof Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems, 10(6), June 1999.
21. Danny Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, March 1983.
22. Shlomi Dolev. Self-Stabilization. MIT Press, 2000.
23. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, April 1988.
24. Christof Fetzer and Flaviu Cristian. Fail-awareness: An approach to construct fail-safe applications. In Proceedings of The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS'97), pages 282-291. IEEE, June 1997.
25. J. A. Goguen and J. Meseguer. Security policies and security models. In Proceedings of the 1982 Symposium on Security and Privacy (SSP '82), pages 11-20, Los Alamitos, Ca., USA, April 1982. IEEE Computer Society Press.
26. Jean-François Hermant and Gérard Le Lann. Fast asynchronous uniform consensus in real-time distributed systems. IEEE Transactions on Computers, 51(8):931-944, August 2002.
27. Mei-Chen Hsueh, Timothy K. Tsai, and Ravishankar K. Iyer. Fault injection techniques and tools. IEEE Computer, 30(4):75-82, April 1997.
28. Ekkart Kindler. Safety and liveness properties: A survey. EATCS-Bulletin, (53), June 1994.
29. Klaus Kursawe. Asynchronous byzantine group communication. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS), Workshop on Reliable Peer-to-Peer Distributed Systems, pages 352-357, Osaka, Japan, October 2002. IEEE Computer Society Press.
30. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
31. Leslie Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, 3(2):125-143, March 1977.
32. Leslie Lamport. Fairness and hyperfairness. Distributed Computing, 13(4):239-245, 2000.
33. Jean-Claude Laprie, editor. Dependability: Basic concepts and Terminology, volume 5 of Dependable Computing and Fault-Tolerant Systems. Springer-Verlag, 1992.
34. Gerard Le Lann. On real-time and non real-time distributed computing. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG95), pages 51-70, September 1995.
35. Zhiming Liu and Mathai Joseph. Specification and verification of fault-tolerance, timing and scheduling. ACM Transactions on Programming Languages and Systems, 21(1):46-89, 1999.
36. Heiko Mantel. Possibilistic definitions of security - An assembly kit. In Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW 2000), Cambridge, England, July 2000. IEEE Computer Society Press.
37. Asif Masum. Non-cooperative Byzantine failures: A new framework for the design of efficient fault tolerance protocols. PhD thesis, Universität-Gesamthochschule Essen, Fachbereich Mathematik und Informatik, 2000. Published by Libri Books on demand, ISBN 3-8311-0815-3.
38. John McLean. A general theory of composition for a class of "possibilistic" properties. IEEE Transactions on Software Engineering, 22(1):53-67, January 1996. Special Section - Best Papers of the IEEE Symposium on Security and Privacy 1994.
39. Catherine Meadows. Open issues in formal methods for cryptographic protocol analysis. In DISCEX 2000, pages 237-250. IEEE Computer Society Press, January 2000.
40. David Powell. Failure mode assumptions and assumption coverage. In Dhiraj K. Pradhan, editor, Proceedings of the 22nd Annual International Symposium on Fault-Tolerant Computing (FTCS '92), pages 386-395, Boston, MA, July 1992. IEEE Computer Society Press.
41. Inc. RSA Data Security. RSA code-breaking contest again won by Distributed.net and Electronic Frontier Foundation (EFF). Internet: http://www.rsasecurity. com/company/news/releases/pr.asp?doc\_id=462, January 1999.
42. John Rushby. Critical system properties: Survey and taxonomy. Reliability Engineering and System Safety, 43(2):189-219, 1994.
43. John Rushby. Systematic formal verification for fault-tolerant time-triggered algorithms. In Mario Dal Cin, Catherine Meadows, and William H. Sanders, editors, Dependable Computing for Critical Applications - 6, volume 11 of Dependable Computing and Fault Tolerant Systems, pages 203-222, Garmisch-Partenkirchen, Germany, March 1997. IEEE Computer Society.
44. Fred B. Schneider. What good are models and what models are good? In Sape Mullender, editor, Distributed Systems, chapter 2, pages 17-26. Addison-Wesley, Reading, MA, second edition, 1993.
45. John Turek and Dennis Shasha. The many faces of consensus in distributed systems. IEEE Computer, 25(6):8-17, June 1992.
46. Paulo Veríssimo. Real-time communication. In Sape Mullender, editor, Distributed Systems, chapter 17, pages 447-490. Addison-Wesley, Reading, MA, second edition, 1993.
47. Hagen Völzer. Fairness, Randomisierung und Konspiration in verteilten Algorithmen. PhD thesis, Humboldt Universität zu Berlin, Fakultät für Informatik, December 2000.