scientific article; zbMATH DE number 1754629

zbMath0986.68047MaRDI QIDQ4535056

Hubert Comon, Véronique Cortier, John C. Mitchell

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760682

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Related Items

Protocol insecurity with a finite number of sessions and composed keys is NP-complete., Alternating two-way AC-tree automata, Transducer-based analysis of cryptographic protocols, Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically, Verification of cryptographic protocols: tagging enforces termination, Tree automata with one memory set constraints and cryptographic protocols, An NP decision procedure for protocol insecurity with XOR, Simulation relations for alternating Büchi automata, A method for symbolic analysis of security protocols, On the symbolic reduction of processes with cryptographic functions.