Intruder theories (Ongoing Work)

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

Volumn 2987, Issue , 2004, Pages 1-4

  Comon Lundh, Hubert ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048861399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_1     Document Type: Article

References (10)

1. Y. Chevalier, R. Kuester, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with xor. In Kolaitis [8].
2. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents. In J. Radhakrishnan and P. Pandya, editors, Proc. FST/TCS, Mumbai, volume 2914 of Lecture Notes in Computer Science, 2003.
3. H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Comput. Sci., 2004. To appear. Also available as LSV research report LSV-01-13.
4. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in preence of exclusive or. In Kolaitis [8].
5. S. Delaune and F. Jacquemard. A theory of guessing attacks and its complexity. Research Report LSV-04-1, Lab. Specification and Verification, ENS de Cachan, Cachan, Prance, 2004.
6. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999.
7. J. Goubault-Larrecq, M. Roger, and K. N. Verma. Abstraction and resolution modulo AC: How to verify diffie-hellman-like protocols automatically. Journal of Logic and Algebraic Programming, 2004. Submitted to the special issue on processes and security, 40 pages.
8. P. Kolaitis, editor. Eighteenth Annual IEEE Symposium on Logic in Computer Science, Ottawa, Canada, June 2003. IEEE Computer Society.
9. J. Millen and V. Shmatikov. Symbolic protocol analysis with products and diffiehellman exponentiation, nvited submission to Journal of Computer Security (selected papers of CSFW-16), 2004.
10. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, June 2001.