Abstracting cryptographic protocols by Prolog rules

DOI10.1007/3-540-47764-0_27MaRDI QIDQ4778712zbMATH OpenFDO

Authors Bruno Blanchet

Publication date 19 November 2002

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/2126/21260433

Mathematics Subject Classification ID

Logic programming (68N17) Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99) Cryptography (94A60)

Recommendations

• Abstracting cryptographic protocols with tree automata.
• Abstracting cryptographic protocols with tree automata
• Three systems for cryptographic protocol analysis
• Abstract interpretation for proving secrecy properties in security protocols
• Pattern-based abstraction for verifying secrecy in protocols

Cited in

(10)

• Abstracting cryptographic protocols with tree automata.
• A formal language for cryptographic protocol requirements
• The practice of cryptographic protocol verification
• Abstract interpretation for proving secrecy properties in security protocols
• Computational soundness of symbolic analysis for protocols using hash functions
• Protocol Verification Via Rigid/Flexible Resolution
• A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming
• A new knowledge representation strategy for cryptographic protocol analysis
• scientific article; zbMATH DE number 2079665 (Why is no real title available?)
• Abstracting cryptographic protocols with tree automata

This page was built for publication: Abstracting cryptographic protocols by Prolog rules

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