Intruder deduction for the equational theory of Abelian groups with distributive encryption

Information and Computation

Volumn 205, Issue 4, 2007, Pages 581-623

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

^a AIX MARSEILLE UNIVERSITY   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CALCULATIONS; GROUP THEORY;

ALGEBRAIC PROPERTIES; AUTOMATED DEDUCTION; CRYPTOGRAPHIC PROTOCOLS; DECISION PROCEDURE; EQUATIONAL THEORY; INTRUDER DEDUCTION; PROCESS CALCULI; PROTOCOL SPECIFICATIONS;

CRYPTOGRAPHY;

EID: 84855190787     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.10.008     Document Type: Article

References (40)

1. G. Lowe, An attack on the Needham-Schroeder public key authentication protocol, Information Processing Letters 56(3) (1995) 131-133.
2. J. Clark, J. Jacob, A survey of authentication protocol literature, http://www.cs.york.ac.uk/~jac/papers/drareviewps.ps, 1997.
3. F. Jacquemard, Security protocols open repository, 2003. Available at http://www.lsv.ens-cachan.fr/spore/index.html.
4. AVISPA Project, Avispa protocol library, 2003. Available at http://www.avispa-project.org/.
5. M. Abadi, A. D. Gordon, A calculus for cryptographic protocols: the spi calculus, Information and Computation 148(1) (1999) 1-70. (Pubitemid 129608821)
6. M. Abadi, P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), in: Proceedings of the 1st IFIP International Conference on Theoretical Computer Science (IFIP-TCS), Lecture Notes in Computer Science, vol. 1872, Springer-Verlag, 2000, pp. 3-22.
7. D. Dolev, A. Yao, On the security of public-key protocols, in: Transactions on Information Theory, vol. 29, IEEE Computer Society Press, 1983, pp. 198-208.
8. V. Cortier, S. Delaune, P. Lafourcade, A survey of algebraic properties used in cryptographic protocols, Journal of Computer Security 14(1) (2006) 1-43. (Pubitemid 43177436)
9. IEEE 802.11 Local and Metropolitan Area Networks: Wireless LAN Medium Acess Control (MAC) and Physical (PHY) Specifications, 1999. URL http://grouper.ieee.org/groups/802/11/main.html.
10. L. Gong, Using one-way functions for authentication, SIGCOMM Computer Communication 19(5) (1989) 8-11.
11. J. Bull, D. J. Otway, The authentication protocol, Tech. Rep. DRA/CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defence Research Agency, 1997.
12. H. Comon-Lundh, V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, in: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), IEEE Comp. Soc. Press, Ottawa (Canada), 2003, pp. 271-280.
13. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, An NP decision procedure for protocol insecurity with XOR, in: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), IEEE Comp. Soc. Press, Ottawa (Canada), 2003, pp. 261-270.
14. J. Millen, V. Shmatikov, Symbolic protocol analysis with products and Diffie-Hellman exponentiation, in: Proceedings of the 16th Computer Security Foundation Workshop (CSFW'03), IEEE Comp. Soc. Press, Pacific Grove (California, USA), 2003, pp. 47-62.
15. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents, in: P. K. Pandya, J. Radhakrishnan (Eds.), FSTTCS, Lecture Notes in Computer Science, vol. 2914, Springer, 2003, pp. 124-135.
16. H. Comon-Lundh, R. Treinen, Easy intruder deductions, in: N. Dershowitz (Ed.), Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, 2003, pp. 225-242. (Pubitemid 38318527)
17. S. Delaune, Easy intruder deduction problems with homomorphisms, Information Processing Letters 97(6) (2006) 213-218. (Pubitemid 43144825)
18. S. Delaune, P. Lafourcade, D. Lugiez, R. Treinen, Symbolic protocol analysis in presence of a homomorphism operator and exclusive or, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), Lecture Notes in Computer Science, vol. 4052, Springer, Venice, Italy, 2006, pp. 132-141.
19. S. Delaune, An undecidability result for AGh, Theoretical Computer Science, To appear.
20. M. Baudet, Deciding security of protocols against off-line guessing attacks, in: Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS'05), ACM Press, Alexandria, Virginia, USA, 2005, pp. 16-25. (Pubitemid 44021986)
21. S. Delaune, F. Jacquemard, A decision procedure for the verification of security protocols with explicit destructors, in: V. Atluri, B. Pfitzmann, P. McDaniel (Eds.), Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS'04), ACM Press, Washington, DC, USA, 2004, pp. 278-287. (Pubitemid 40338209)
22. M. Abadi, V. Cortier, Deciding knowledge in security protocols under equational theories, in: Proceedings of 31st International Colloquium on Automata, Languages, and Programming (ICALP'04), Lecture Notes in Computer Science, vol. 3142, Springer-Verlag, Turku (Finland), 2004, pp. 46-58.
23. M. Abadi, V. Cortier, Deciding knowledge in security protocols under (many more) equational theories, in: CSFW'05: Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW'05), IEEE Computer Society, Washington, DC, USA, 2005, pp. 62-76. (Pubitemid 41696421)
24. Y. Chevalier, M. Rusinowitch, Combining intruder theories, in: L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, M. Yung (Eds.), ICALP, Lecture Notes in Computer Science, vol. 3580, Springer, 2005, pp. 639-651. (Pubitemid 41436135)
25. H. Comon-Lundh, Intruder theories (ongoing work), in: Proceedings of the 7th International Conferenceon Foundations of Software Science and Computation Structures (FOSSACS'04), LNCS, vol. 987, Springer-Verlag, Barcelona (Spain), 2004, pp. 1-4.
26. N. Durgin, P. Lincoln, J. Mitchell, A. Scedrov, Undecidability of bounded security protocols, in: Proceedings of the Workshop on Formal Methods and Security Protocols (FMSP'99), Trento (Italy), 1999.
27. J. Millen, V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, in: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS'01), ACM Press, 2001, pp. 166-175. (Pubitemid 34974717)
28. M. Tatebayashi, N. Matsuzaki, D. B. Newman, Key distribution protocol for digital mobile communication systems, in: Proceedings of the 9th Annual International Cryptology Conference (CRYPTO'89), LNCS, vol. 435, Springer-Verlag, Santa Barbara (California, USA), 1989, pp. 324-333.
29. D. Prawitz, Natural Deduction, a Proof-Theoretical Study, Almquist and Wiksell, 1965.
30. D. Basin, S. Mödersheim, Luca Viganó, Ofmc:a symbolic model checker for security protocols, International Journal of Information Security 4(3) (2005) 181-208, published online December 2004.
31. M. Turuani, The CL-Atse protocol analyser, in: F. Pfenning (Ed.), 17th International Conference on Term Rewriting and Applications, Lecture Notes in Computer Science, vol. 4098, Springer, Seattle, WA, USA, 2006, pp. 277-286. (Pubitemid 44502673)
32. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Formal Models and Semantics, vol. B, Elsevier Science Publishers and The MIT Press, 1990, pp. 243-320, Chapter 6.
33. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
34. P. Lafourcade, D. Lugiez, R. Treinen, Intruder deduction for AC-like equational theories with homomorphisms, Research Report LSV-04-16, LSV, ENS de Cachan, November 2004.
35. D. A. McAllester, Automatic recognition of tractability in inference relations, Journal of the ACM 40(2) (1993) 284-303.
36. L. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n prime factors, American Journal Mathematical Society 35(1913) 413-422.
37. D. Caucal, On the regular structure of prefix rewriting, Theoretical Computer Science 106(1) (1992) 61-86. (Pubitemid 23605842)
38. M. Rusinowitch, M. Turuani, Protocol insecurity with finite number of sessions is NP-complete, in: Proceedings of the 14th Computer Security Foundations Workshop (CSFW'01), IEEE Comp. Soc. Press, Cape Breton (Canada), 2001, pp. 174-190.
39. P. Lafourcade, D. Lugiez, R. Treinen, Intruder deduction for AC-like equational theories with homomorphisms, in: J. Giesl (Ed.), Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), Lecture Notes in Computer Science, vol. 467, Springer-Verlag, Nara, Japan, 2005, pp. 308-322. (Pubitemid 41313365)
40. P. Lafourcade, Intruder deduction for the equational theory of exclusive-or with commutative and distributive encryption, in: Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06), Venice, Italy, 2006.