Deciding knowledge properties of security protocols

Proceedings of the Tenth Conference on the Theoretical Aspects of Rationality and Knowledge

Volumn , Issue , 2005, Pages 219-235

  Ramanujam, R ^a   Suresh, S P ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SEMANTICS;

KNOWLEDGE PROPERTIES; SECURITY PROTOCOLS;

KNOWLEDGE ACQUISITION;

EID: 32144452580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Martin Abadi, Michael Burrows, Charles Kaufman, and Butler Lampson. Authentication and Delegation with Smart-Cards. Science of Computer Programming, 21(2):93-113, October 1993.
2. Martin Abadi and Mark Tuttle. A Semantics fo a Logic of Authentication. In Proceedings of the 10th ACM Annual Symposium on Principles of Distributed Computing, pages 201-216, Aug 1991.
3. Kamel Adi, Mourad Debbabi, and Mohamed Mejri. A new logic for electronic commerce protocols. Theoretical Computer Science, 29(3):223-283, 2003.
4. Ross Anderson and Roger M. Needham. Programming Satan's computer. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 426-441, 1995.
5. Giampaolo Bella. Inductive Verification of Smartcard Protocols. Journal of Computer Security, 11(1):87-132, 2003.
6. Bruno Blanchet and Andreas Podelski. Verification of Cryptographic Protocols: Tagging Enforces Termination. In Andrew D. Gordon, editor, Proceedings of FoSSaCS'03, volume 2620 of Lecture Notes in Computer Science, pages 136-152, 2003.
7. Michael Burrows, Martin Abadi, and Roger M. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(1):18-36, Feb 1990.
8. Anupam Datta, A. Derek, John C. Mitchell, and Dusko Pavlovic. Secure protocol composition. In Proceedings of 19th Conference on Mathematical Foundations of Programming Semantics, volume 83 of Electronic Notes in Theoretical Computer Science, 2003.
9. Clare Dixon, M. Carmel Fernandez Gago, Michael Fisher, and Wiebe van der Hoek. Using Temporal Logics of Knowledge in the Formal Verification of Security Protocols. In Proceedings of TIME 2004, July 2004.
10. Danny Dolev and Andrew Yao. On the Security of public-key protocols. IEEE Transactions on Information Theory, 29:198-208, 1983.
11. Nancy A. Durgin, Patrick D. Lincoln, John C. Mitchell, and Andre Scedrov. The undecidability of bounded security protocols. In Proceedings of the Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
12. Nancy A. Durgin, John C. Mitchell, and Dusko Pavlovic. A compositional logic for proving security properties of protocols. Journal of Computer Security, 11(4):677-721, 2003.
13. Shimon Even and Oded Goldreich. On the security of multi-party ping-pong protocols. Technical Report 285, Technion - Israel Institute of Technology, 1983.
14. Janice Glasgow, Glenn MacEwen, and Prakash Panangaden. A logic for reasoning about security. ACM Transactions on Computer Systems, 10(3):226-264, Aug 1992.
15. Li Gong, Roger Needham, and Raphael Yahalom. Reasoning About Belief in Cryptographic Protocols. In Deborah Cooper and Teresa Lunt, editors, Proceedings 1990 IEEE Symposium on Research in Security and Privacy, pages 234-248. IEEE Computer Society, 1990.
16. Joseph Y. Halpern and Riccardo Pucella. Modeling adversaries in a logic for security protocol analysis. In Formal Aspects of Security, First International Conference, FASec 2002, volume 2629 of Lecture Notes in Computer Science, pages 115-132, 2003.
17. Joseph Y. Halpern and Ron van der Meyden. A logical reconstruction of SPKI. Journal of Computer Security, 11(4):581-613, 2003.
18. James Heather, Gavin Lowe, and Steve Schneider. How to Prevent Type Flaw Attacks on Security Protocols. In Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW 13), pages 255-268, July 2000.
19. Darreil Kindred and Jeannette Wing. Fast, automatic checking of security protocols. In Proceedings of the 2nd USENIX workshop on e-commerce, pages 41-52, 1996.
20. Gavin Lowe. Breaking and fixing the Needham-Schroeder public key protocol using FDR. In Proceedings of TACAS'96, volume 1055 of Lecture Notes in Computer Science, pages 147-166, 1996.
21. Gavin Lowe. Towards a completeness result for model checking of security protocols. Journal of computer security, 7:89-146, 1999.
22. Roger M. Needham and Michael D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Communications of the ACM, 21(12):993-999, 1978.
23. D. M. Nessett. A critique of the Burrows, Abadi and Needham logic. ACM Operating systems review, 24(2):35-38, 1990.
24. Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of computer security, 6:85-128, 1998.
25. Riccardo Pucella. Deductive Algorithmic Knowledge. In Proceedings of the Eighth International Symposium on Artificial Intelligence and Mathematics, 2004.
26. R. Ramanujam and S.P.Suresh. Decidability of context-explicit security protocols. Journal of Computer Security, 13(1):135-165, 2005.
27. R. Ramanujam and S.P. Suresh. Tagging makes secrecy decidable for unbounded nonces as well. In Proceedings of 23rd FST&TCS, volume 2914, pages 363-374, Mumbai, India, December 2003.
28. Michael Rusinowitch and Mathieu Turuani. Protocol insecurity with finite number of sessions is NP-complete. Theoretical Computer Science, 299:451-475, 2003.
29. S.P. Suresh. Foundations of Security Protocol Analysis. PhD thesis, The Institute of Mathematical Sciences, Chennai, India, November 2003. Madras University. Available at http://www.cmi.ac.in/~spsuresh.