The finite variant property: How to get rid of some algebraic properties

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 294-307

  Comon Lundh, Hubert ^b   Delaune, Stéphanie ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; FINITE ELEMENT METHOD; INFORMATION THEORY; NETWORK PROTOCOLS; SET THEORY;

EQUATIONAL THEORIES; FINITE SET OF EQUATIONS; MODULAR EXPONENTIATION; SECURITY PROTOCOLS;

ALGEBRA;

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

References (19)

1. H. Comon. Complete axiomatizations of some quotient term algebras. Theoretical Computer Science, 118(2): 167-191, 1993.
2. H. Comon-Lundh. Intruder theories (ongoing work). In 7th International Conference on Foundations of Software Science and Computation Structures (FoS-SaCS'04), Barcelona, Spain, 2004. Invited talk, slides available at http://www.lsv.ens-cachan.fr/~comon/biblio.html.
3. H. Comon-Lundh and V. Cortier. New decidability results for fragments of firstorder logic and application to cryptographic protocols. In Proc. 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of LNCS, pages 148-164, Valencia, Spain, 2003. Springer-Verlag.
4. H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. Research Report LSV-04-17, Laboratoire Spécification et Vérification, ENS Cachan, France, 2004. 21 pages.
5. 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.
6. S. Delaune and F. Jacquemard. A decision procedure for the verification of security protocols with explicit destructors. In Proc. 11th ACM Conference on Computer and Communications Security (CCS'04), pages 278-287, Washington, USA, 2004. ACM.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier and MIT Press, 1990.
8. J.-M. Hullot. Canonical forms and unification. In Proc. 5th Conference on Automated Deduction, (CADE'80), volume 87 of LNCS, pages 318-324, Les Arcs, France, 1980. Springer.
9. J.-M. Hullot. A catalogue of canonical term rewriting systems. Technical Report CSL-114, Computer Science Laboratory, SRI, CA, USA, 1980.
10. D. Kapur, P. Narendran, and L. Wang. An E-unification algorithm for analyzing protocols that use modular exponentiation. In Proc. 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of LNCS, pages 165-179, Valencia, Spain, 2003. Springer-Verlag.
11. C. Kirchner. Méthodes et Outils de Conception Systématique d'Algorithmes d'Unification dans les Théories Équationnelles. PhD thesis, Université de Nancy I, 1985.
12. C. Meadows and P. Narendran. A unification algorithm for the group Diffie-Hellman protocol. In Proc. of the Workshop on Issues in the Theory of Security (WITS'02), Portland, USA, 2002.
13. P. Narendran, Q. Guo, and D. Wolfram. Unification and matching modulo nilpotence. In Proc. of the 13th International Conference on Automated Deduction, (CADE'96), volume 1104 of LNCS, pages 261-274, New Brunswick, USA, 1996. Springer-Verlag.
14. P. Narendran, F. Pfenning, and R. Statman. On the unification problem for cartesian closed categories. Journal of Symbolic Logic, 62(2):636-647, 1997.
15. L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. 10th Computer Security Foundations Workshop (CSFW'97), pages 84-95, Rockport, USA), 1997. IEEE Comp. Soc. Press.
16. C. Rackoff. On the complexity of the theories of weak direct products (preliminary report). In Proc. of the 6th Annual ACM Symposium on Theory of Computing, pages 149-160. ACM Press, 1974.
17. P. Y. A. Ryan and S. A. Schneider. An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters, 65(1):7-10, 1998.
18. R. Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14(5):437-457, 1992.
19. E. Viola. E-unifiability via narrowing. In Proc. of the 7th Italian Conference on Theoretical Computer Science, (ICTCS'01), volume 2202 of LNCS, pages 426-438, Torino, Italy, 2001. Springer.