Hierarchical combination of intruder theories

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

Volumn 4098 LNCS, Issue , 2006, Pages 108-122

  Chevalier, Yannick ^a   Rusinowitch, Michaël ^b  

^a IRIT   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; MATHEMATICAL OPERATORS; NETWORK PROTOCOLS; OPTIMIZATION;

ABELIAN GROUP; ALGEBRAIC OPERATORS; DEDUCTION PROBLEM;

SECURITY OF DATA;

EID: 33749446224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_9     Document Type: Conference Paper

References (26)

1. R. Amadio, D. Lugiez, and V. Vanackère. On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci., 290(1):695-740, 2003.
2. F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories, combining decision procedures. J. Symb. Comput., 21(2):211-243, 1996.
3. D. Basin, S. Mödersheim, and L. Viganò. An On-The-Fly Model-Checker for Security Protocol Analysis. In Einar Snekkenes and Dieter Gollmann, editors, Proceedings of ESORICS'03, LNCS 2808, pages 253-270. Springer-Verlag, 2003.
4. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proceedings of the 28th ICALP'01, LNCS 2076, pages 667-681. Springer-Verlag, Berlin, 2001.
5. N. Borisov, I. Goldberg, and D. Wagner. Intercepting mobile communications: the insecurity of 802.11. In Proceedings of MOBICOM 2001, pages 180-189, 2001.
6. Y. Chevalier, R. Kuesters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In Proceedings of the Logic In Computer Science Conference, LICS'03, June 2003.
7. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'03, Lecture Notes in Computer Science. Springer, December 2003.
8. Y. Chevalier and M. Rusinowitch. Combining intruder theories. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, ICALP, volume 3580 of Lecture Notes in Computer Science, pages 639-651. Springer, 2005.
9. Y. Chevalier and L. Vigneron. A Tool for Lazy Verification of Security Protocols. In Proceedings of the Automated Software Engineering Conference (ASE'01). IEEE Computer Society Press, 2001.
10. H. Comon-Lundh. Intruder theories (ongoing work). In Igor Walukiewicz, editor, 7th International Conference, FOSSACS 2004, volume 2987 of Lecture Notes on Computer Science, pages 1-4, Barcelona, Spain, March 2004. Springer Verlag.
11. H. Comon-Lundh and V. Shmatikov. Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. In Proceedings of the Logic In Computer Science Conference, LICS'03, pages 271-280, 2003.
12. H. Comon-Lundh and R. Treinen. Easy intruder deductions. In Verification: Theory and Practice, volume 2772 of Lecture Notes in Computer Science, pages 225-242, 2003.
13. S. Delaune and F. Jacquemard. A decision procedure for the verification of security protocols with explicit destructors. In Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS'04), pages 278-287, Washington, D.C., USA, October 2004. ACM Press.
14. N. Dershowitz and J-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, Volume B, pages 243-320. Elsevier, 1990.
15. R. Givan and D. A. McAllester. New results on local inference relations. In KR, pages 403-412, 1992.
16. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In ICALP, volume 267 of LNCS, pages 54-71. Springer, 1987.
17. D. Kapur, P. Narendran, and L. Wang. An e-unification algorithm for analyzing protocols that use modular exponentiation. In Robert Nieuwenhuis, editor, RTA, volume 2706 of Lecture Notes in Computer Science, pages 165-179. Springer, 2003.
18. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for ac-like equational theories with homomorphisms. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA '05), Lecture Notes in Computer Science, Nara, Japan, April 2005. Springer. To appear.
19. David A. McAllester. Automatic recognition of tractability in inference relations. J. ACM, 40(2):284-303, 1993.
20. C. Meadows. The NRL protocol analyzer: an overview. Journal of Logic Programming, 26(2):113-131, 1996.
21. C. Meadows and P. Narendran. A unification algorithm for the group Diffie-Hellman protocol. In Workshop on Issues in the Theory of Security (in conjunction with POPL'02), Portland, Oregon, USA, January 14-15, 2002.
22. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In ACM Conference on Computer and Communications Security, pages 166-175, 2001.
23. J. Millen and V. Shmatikov. Symbolic protocol analysis with an abelian group operator or Diffie-Hellman exponentiation. Journal of Computer Security, 2005.
24. 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.
25. V. Shmatikov. Decidable analysis of cryptographic protocols with products and modular exponentiation. In Proceedings of ESOP'04, volume 2986 of Lecture Notes in Computer Science, pages 355-369. Springer-Verlag, 2004.
26. T. Wu. The srp authentication and key exchange system. Technical Report RFC 2945, IETF - Network Working Group, September 2000. available at http://www.ietf.org/rfc/rfc2945.txt.