From secrecy to authenticity in security protocols

DOI10.1007/3-540-45789-5_25MaRDI QIDQ4411970zbMATH OpenFDO

Authors Bruno Blanchet

Publication date 13 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/2477/24770342.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Type-Based Automated Verification of Authenticity in Cryptographic Protocols
• A type and effect analysis of security protocols
• Rewriting for cryptographic protocol verification
• scientific article; zbMATH DE number 1956589
• scientific article; zbMATH DE number 2086169

Cited in

(21)

• Verification of cryptographic protocols: tagging enforces termination
• Basing cryptographic protocols on tamper-evident seals
• Formal analysis and offline monitoring of electronic exams
• Automated verification of selected equivalences for security protocols
• Breaking and fixing public-key Kerberos
• A static analysis of cryptographic processes: the denotational approach
• Rewriting for cryptographic protocol verification
• A syntactic criterion for injectivity of authentication protocols
• Verification of security protocols with lists: from length one to unbounded length
• An introduction to security API analysis
• Type-based automated verification of authenticity in asymmetric cryptographic protocols
• Constraint Abstraction in Verification of Security Protocols
• Implementing Spi Calculus Using Nominal Techniques
• Proving Group Protocols Secure Against Eavesdroppers
• Integrating Verification, Testing, and Learning for Cryptographic Protocols
• scientific article; zbMATH DE number 1956589 (Why is no real title available?)
• scientific article; zbMATH DE number 1497865 (Why is no real title available?)
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• Modeling and verifying time sensitive security protocols with constraints
• Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
• Deciding knowledge in security protocols under equational theories

This page was built for publication: From secrecy to authenticity in security protocols

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