Pattern-based abstraction for verifying secrecy in protocols

DOI10.1007/3-540-36577-X_22MaRDI QIDQ4417934zbMATH OpenFDO

Authors Liana Bozga, M. Perin, Yassine Lakhnech

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2619/26190299.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Abstract interpretation for proving secrecy properties in security protocols
• Abstracting cryptographic protocols with tree automata.
• Abstracting cryptographic protocols with tree automata
• scientific article; zbMATH DE number 1330434
• From secrecy to authenticity in security protocols

Cited in

(10)

• Abstracting cryptographic protocols with tree automata.
• Abstract interpretation for proving secrecy properties in security protocols
• A Dolev-Yao-Based Definition of Abuse-Free Protocols
• scientific article; zbMATH DE number 1330434 (Why is no real title available?)
• From secrecy to authenticity in security protocols
• scientific article; zbMATH DE number 2079665 (Why is no real title available?)
• Abstracting cryptographic protocols with tree automata
• Abstracting cryptographic protocols by Prolog rules
• Handling left-quadratic rules when completing tree automata
• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives

Describes a project that uses

Uses Software

• Casper

This page was built for publication: Pattern-based abstraction for verifying secrecy in protocols

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