Alternation in equational tree automata modulo XOR

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

Volumn 3328, Issue , 2004, Pages 518-530

  Verma, Kumar Neeraj ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GROUP THEORY; NETWORK SECURITY; FORESTRY; SOFTWARE ENGINEERING; VECTORS;

% REDUCTIONS; ABELIAN GROUP; ALGEBRAIC PROPERTIES; CRYPTOGRAPHIC PRIMITIVES; DECIDABILITY QUESTIONS; EQUATIONAL THEORY; EQUATIONAL TREE AUTOMATA; SECURITY PROTOCOLS; TWO WAYS; UNDECIDABILITY; COMPLEMENTATION; VECTOR ADDITION SYSTEMS;

VECTORS; AUTOMATA THEORY;

EID: 35048885180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_43     Document Type: Article

References (23)

1. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents. In FSTTCS'03, pages 124-135. Springer-Verlag LNCS 2914, 2003.
2. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In LICS'03, pages 261-270, 2003.
3. H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science, 2004. To appear.
4. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata, 1997.
5. H. Comon-Lundh and V. Cortier. New decidability results for fragments of first-order logic and application to cryptographic protocols. In RTA'03, pages 148-164. Springer-Verlag LNCS 2706, 2003.
6. V. Cortier. Vérification Automatique des Protocoles Cryptographiques. Ph.D. thesis, ENS Cachan, France, 2003.
7. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1-68. Springer-Verlag, 1997.
8. J. Goubault-Larrecq. A method for automatic cryptographic protocol verification. In FMPPTA'00, pages 977-984. Springer-Verlag LNCS 1800, 2000.
9. J. Goubault-Larrecq. Une fois qu'on n'a pas trouvé de preuve, comment le faire comprendre à un assistant de preuve? In V. Ménissier-Morain, editor, Actes des 12èmes Journées Francophones des Langages Applicatifs (JFLA'04). INRIA, collection didactique, 2004.
10. J. Goubault-Larrecq, M. Roger, and K. N. Verma. Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. Journal of Logic and Algebraic Programming, 2004. To Appear. Available as Research Report LS V-04-7, LSV, ENS Cachan.
11. J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
12. R. M. Karp and R. E. Miller. Parallel program schemata. J. Computer and System Sciences, 3(2):147-195, 1969.
13. D. Lugiez. Counting and equality constraints for multitree automata. In FOSSACS'03, pages 328-342. Springer-Verlag LNCS 2620, 2003.
14. D. Monniaux. Abstracting cryptographic protocols with tree automata. In SAS'99, pages 149-163. Springer-Verlag LNCS 1694, 1999.
15. H. Ohsaki. Beyond regularity: Equational tree automata for associative and commutative theories. In CSL'01, pages 539-553. Springer-Verlag LNCS 2142, 2001.
16. L. C. Paulson. Mechanized proofs for a recursive authentication protocol. In CSFW'97, pages 84-95. IEEE Computer Society Press, 1997.
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. G. Slutzki. Alternating tree automata. Theoretical Computer science, 41:305-318, 1985.
19. M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11 (8):769-780, 2000.
20. K. N. Verma. Automates d'arbres bidirectionnels modulo théories équationnelles. Ph.D. thesis, ENS Cachan, 2003.
21. K. N. Verma. On closure under complementation of equational tree automata for theories extending AC. In LPAR'03, pages 183-197. Springer-Verlag LNCS 2850, 2003.
22. K. N. Verma. Two-way equational tree automata for AC-like theories: Decidability and closure properties. In RTA'03, pages 180-196. Springer-Verlag LNCS 2706, 2003.
23. K. N. Verma and J. Goubault-Larrecq. Karp-Miller trees for a branching extension of VASS. Research Report LSV-04-3, LSV, ENS Cachan, France, January 2004.