Verifying Cryptographic Protocols with Subterms Constraints

DOI10.1007/978-3-540-75560-9_15MaRDI QIDQ3498465zbMATH OpenOpenAlexFDO

Authors Yannick Chevalier, Michaël Rusinowitch, D. 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

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Towards an Automatic Analysis of Web Service Security
• scientific article; zbMATH DE number 1927583
• scientific article; zbMATH DE number 1614701
• scientific article; zbMATH DE number 2163007
• Transducer-based analysis of cryptographic protocols

Cites work

• Algebraic Intruder Deductions
• Deciding Key Cycles for Security Protocols
• Formal Methods for Components and Objects
• scientific article; zbMATH DE number 1341618 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1973985 (Why is no real title available?)
• On the relationship between web services security and traditional protocols
• On the relative soundness of the free algebra model for public key encryption
• On the security of public key protocols
• 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

Cited in

(5)

• Verification of cryptographic protocols: tagging enforces termination
• scientific article; zbMATH DE number 3877090 (Why is no real title available?)
• Computer Science Logic
• Probabilistic relational verification for cryptographic implementations
• Key Substitution in the Symbolic Analysis of Cryptographic Protocols

Describes a project that uses

Uses Software

• TulaFale

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498465)