Verifying Cryptographic Protocols with Subterms Constraints

DOI10.1007/978-3-540-75560-9_15zbMath1137.94341OpenAlexW1813607262MaRDI QIDQ3498465

Yannick Chevalier, Michaël Rusinowitch, Denis Lugiez

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_15

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Uses Software

• TulaFale

Cites Work

• On the symbolic reduction of processes with cryptographic functions.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Unification in the union of disjoint equational theories: Combining decision procedures
• On the security of public key protocols
• Formal Methods for Components and Objects
• Algebraic Intruder Deductions
• Deciding Key Cycles for Security Protocols
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifying Cryptographic Protocols with Subterms Constraints