Intruder deductions, constraint solving and insecurity decision in presence of exclusive or

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 271-280

  Comon Lundh, H ^a   Shmatikov, V ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY; PROBLEM SOLVING; THEOREM PROVING; AUTHENTICATION; COMPUTER SCIENCE; CONSTRAINT THEORY; POLYNOMIALS;

CONSTRAINT SYSTEMS;

NETWORK PROTOCOLS; GROUP THEORY;

ALGEBRAIC PROPERTIES; CONTEXT MODELING; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; EQUATIONS; LOGIC; REACHABILITY PROBLEM; SYMBOLIC VERIFICATION;

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

References (19)

1. R. Amadio and W. Charatonik. On name generation and setbased analysis in the Dolev-Yao model. In Proc. CONCUR '02, volume 2421 of LNCS, pages 499-514, 2002.
2. R. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In Proc. CONCUR '00, volume 1877 of LNCS, pages 380-394, 2000.
3. F. Baader and K. Schulz. Combining constraint solving. In Constraints in Computational Logics (CCL '99), volume 2002 of LNCS, pages 104-158, 2001.
4. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proc. ICALP '01, pages 667-681, 2001.
5. Y. Chevalier, R. Kuester, M. Rusinowitch, and M. Turuani. An np decision procedure for protocol insecurity with xor. In These proceedings, 2003.
6. H. Comon, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints, and ping-pong protocols. In Proc. ICALP '01, pages 682-693, 2001.
7. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
8. 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.
9. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 160-173, 2001.
10. D. McAllester. Automatic recognition of tractability in inference relations. J. ACM, 40(2):284-303, 1993.
11. C. Meadows and P. Narendran. A unification algorithm for the group Diffie-Hellman protocol. In Proc. Workshop on Issues in Theory of Security, 2002.
12. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
13. J. Millen and V. Shmatikov. Constraint solving for bounded process cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communications Security (CCS '01), pages 166-175, 2001.
14. P. Narendran, Q. Guo, and D. Wolfram. Unification and matching modulo nilpotence. In Proc. CADE-13, volume 1104 of LNCS, pages 261-274, 1996.
15. L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. 10th IEEE Computer Security Foundations Workshop, pages 84-95, 1997.
16. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 174-190, 2001.
17. P. Ryan and S. Schneider. An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters, 65(1):7-10, 1998.
18. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 8(1/2):51-99, 1989.
19. M. Steiner, G. Tsudik, and M. Waidner. Diffie-Hellman key distribution extended to group communication. In Proc. 3rd ACM Conference on Computer and Communications Security (CCS '96), pages 31-37, 1996.