Intruder deduction for AC-like equational theories with homomorphisms

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 308-322

  Lafourcade, Pascal ^a,b   Lugiez, Denis ^b   Treinen, Ralf ^a  

^a CNRS   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONCURRENCY CONTROL; CRYPTOGRAPHY; DECISION THEORY; PROBLEM SOLVING;

CRYPTOGRAPHIC PROTOCOLS; INTRUDER DEDUCTION; PROCESS CALCULUS; PUSHDOWN AUTOMATA;

NETWORK PROTOCOLS;

EID: 24944560619     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_23     Document Type: Conference Paper

References (19)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1): 1-70, Jan. 1999.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In Proc. 1st IFIP International Conference on Theoretical Computer Science (IFIP-TCS), volume 1872 of LNCS, pages 3-22. Springer-Verlag, 2000.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
4. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 261-270, Ottawa (Canada), 2003. IEEE Comp. Soc. Press.
5. J. Clark and J. Jacob. A survey of authentication protocol literature. http://www.cs.york.ac.uk/~jac/papers/drareviewps. ps, 1997.
6. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 271-280, Ottawa (Canada), 2003. IEEE Comp. Soc. Press.
7. H. Comon-Lundh and R. Treinen. Easy intruder deductions. In N. Dershowitz, editor, Verification: Theory & Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, volume 2772 of LNCS, pages 225-242. Springer-Verlag, 2003.
8. V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Research Report LSV-04-15, LSV, ENS de Cachan, Sept. 2004. Available at http://www.lsv.ens-cachan.fr/Publis/ RAPPORTS_LSV/rapports-year-2004-list.php.
9. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B - Formal Models and Semantics, chapter 6, pages 243-320. Elsevier Science Publishers and The MIT Press, 1990.
10. D. Dolev and A. Yao. On the security of public-key protocols. In Transactions on Information Theory, volume 29, pages 198-208. IEEE Comp. Soc. Press, 1983.
11. F. Jacquemard. Security protocols open repository. Available at http://www.lsv.ens-cachan.fr/spore/index.html.
12. E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders. Fast parallel computation of hermite and smith forms of polynomial matrices. SIAM J. Algebraic Discrete Methods, 8(4):683-690, 1987.
13. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for ac-like equational theories with homomorphisms. Research Report LSV-04-16, LSV, ENS de Cachan, Nov. 2004. Available at http://www.lsv.ens-cachan.fr/Publis/ RAPPORTS_LSV/rapports-year-2004-list.php.
14. G. Lowe. An attack on the Needham-Schroeder public key authentication protocol. Information Processing Letters, 56(3): 131-133, 1995.
15. D. A. McAllester. Automatic recognition of tractability in inference relations. JACM, 40(2):284-303, April 1993.
16. P. Narendran. Solving linear equations over polynomial semirings. In Proc. of 11th Annual Symposium on Logic in Computer Science (LICS), pages 466-472, July 1996.
17. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
18. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
19. M. Turuani. Personal communication, 2003.