The practice of cryptographic protocol verification

DOI10.1016/S1571-0661(04)00241-5MaRDI QIDQ2841213zbMATH OpenOpenAlexFDO

Authors Michaël Rusinowitch

Publication date 24 July 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)00241-5

zbMATH Keywords

CASRULcomplexitycryptographic protocolsnon-atomic keysverification

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1696763
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• scientific article; zbMATH DE number 1759624
• Three systems for cryptographic protocol analysis
• scientific article; zbMATH DE number 1832234

Cited in

(11)

• Verification of cryptographic protocols: tagging enforces termination
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• scientific article; zbMATH DE number 1696763 (Why is no real title available?)
• Shared verification cryptography domains: Security in computers
• Proof techniques for cryptographic processes
• Cryptographic Verification by Typing for a Sample Protocol Implementation
• scientific article; zbMATH DE number 7297874 (Why is no real title available?)
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• The coinductive approach to verifying cryptographic protocols.
• Verification, Model Checking, and Abstract Interpretation
• Compiling and securing cryptographic protocols

This page was built for publication: The practice of cryptographic protocol verification

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