Algebraic intruder deductions

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

Volumn 3835 LNAI, Issue , 2005, Pages 549-564

  Basin, David ^a   Mödersheim, Sebastian ^a   Viganò, Luca ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER CRIME; CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

ALGEBRAIC INTRUDER DEDUCTIONS; CRYPTOGRAPHIC OPERATORS; MESSAGES; SECURITY PROTOCOLS;

SECURITY SYSTEMS;

EID: 33646262130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_38     Document Type: Conference Paper

References (28)

1. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. In Proceedings of ICALP'2004, LNCS 3142, pp. 46-58. Springer, 2004.
2. M. Abadi and V. Cortier. Deciding knowledge in security protocols under (many more) equational theories. In Proceedings of CSFW'05, pp. 62-76. IEEE Computer Society Press, 2005.
3. A. Armando and L. Compagna. Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In Proceedings of FORTE 2002, LNCS 2529, pp. 210-225. Springer, 2002.
4. F. Baader and T. Nipkow. Term Rewriting and All Thai. Cambridge University Press, 1998.
5. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation, 21:211-243, 1996.
6. F. Baader and W. Snyder. Unification theory. In Handbook of Automated Reasoning, volume I, pp. 445-532. Elsevier Science, 2001.
7. L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67:173-201, 1989.
8. D. Basin, S. Mödersheim, and L. Viganò. Constraint Differentiation: A New Reduction Technique for Constraint-Based Analysis of Security Protocols. In Proceedings of CCS'03, pp. 335-344. ACM Press, 2003.
9. D. Basin, S. Mödersheim, and L. Viganò. Algebraic Intruder Deductions (Extended Version). Technical Report 485, Dep. of Computer Science, ETH Zurich, 2005. Available at www.infsec.ethz.ch.
10. D. Basin, S. Mödersheim, and L. Viganò. OFMC: A symbolic model checker for security protocols. International Journal of Information Security, 4(3):181-208, 2005.
11. M. Boreale and M. G. Buscemi. A framework for the analysis of security protocols. In Proceedings of CONCUR 2002, LNCS 2421, pp. 483-498. Springer, 2002.
12. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In Proceedings of LICS'03, pp. 261-270. IEEE Computer Society Press, 2003.
13. 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 FST TCS'03, LNCS 2914, pp. 124-135. Springer, 2003.
14. Y. Chevalier and M. Rusinowitch. Combining Intruder Theories. In Proceedings of ICALP 2005, LNCS 3580, pp. 639-651, 2005.
15. H. Comon and V. Shmatikov. Is It Possible to Decide Whether a Cryptographic Protocol Is Secure Or Not? Journal of Telecommunications and Information Technology, 4:5-15, 2002.
16. H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. In Proceedings of RTA '05, LNCS 3467, pp. 294-307. Springer, 2005.
17. V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security, to appear.
18. S. Delaune and F. Jacquemard. A decision procedure for the verification of security protocols with explicit destructors. In Proceedings of CCS'04, pp. 278-287. ACM Press, 2004.
19. D. Dolev and A. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 2(29), 1983.
20. N. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. Undecidability of Bounded Security Protocols. In Proceedings of the FLOC'99 Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
21. IETF: The Internet Engineering Task Force. http://www.ietf.org.
22. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4):1155-1194, 1986.
23. D. Kapur, P. Narendran, and L. Wang. An E-unification algorithm for analyzing protocols that use modular exponentiation. In Proceedings of RTA '03, LNCS 2706, pp. 165-179. Springer, 2003.
24. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for AC-like equational theories with homomorphisms. In Proceedings of RTA '05, LNCS 3467, pp. 308-322. Springer, 2005.
25. G. Lowe. Casper: a Compiler for the Analysis of Security Protocols. Journal of Computer Security, 6(1):53-84, 1998.
26. J. Meseguer and P. Thati. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Journal of Higher-Order and Symbolic Computation, to appear.
27. J. K. Millen and V. Shmatikov. Symbolic protocol analysis with products and Diffie-Hellman exponentiation. In Proceedings of CSFW'03, pp. 47-61. IEEE Computer Society Press, 2003.
28. J. Siekmann and P. Szabó. The undecidability of the DA unification problem. Journal of Symbolic Computation, 54(2):402-414, 1989.