A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming

DOI10.1007/978-3-642-04238-6_30MaRDI QIDQ3643130zbMATH OpenOpenAlexFDO

Authors James Delgrande, Torsten Grote, Aaron Hunter

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_30

Mathematics Subject Classification ID

Cryptography (94A60) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1832234
• scientific article; zbMATH DE number 1405638
• scientific article; zbMATH DE number 1926618
• Three systems for cryptographic protocol analysis
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis

Cited in

(4)

• Automatic verification of cryptographic protocols with SETHEO
• LACPV'2001. Logical aspects of cryptographic protocol verification. Proceedings of the 1st workshop (a satellite workshop of CAV'01), Paris, France, July 23, 2001.
• Optimization of ProVerif Programs for AKE Protocols
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis

Describes a project that uses

Uses Software

• clasp
• Gringo

This page was built for publication: A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming

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