What makes a cryptographic protocol secure? The evolution of requirements specification in formal cryptographic protocol analysis

DOI10.1007/3-540-36575-3_2MaRDI QIDQ4417879zbMATH OpenFDO

Authors Catherine Meadows

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/2618/26180010.htm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols
• A formal language for cryptographic protocol requirements
• Formal verification of cryptographic protocols: A survey
• scientific article; zbMATH DE number 3965967
• Alice and Bob meet equational theories

Cited in

(7)

• A brief history of security protocols
• Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols
• MoSS: modular security specifications framework
• The meeting businessmen problem: requirements and limitations
• Security protocols and their properties
• Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
• Separating the specification and implementation phases in cryptology (extended abstract)

This page was built for publication: What makes a cryptographic protocol secure? The evolution of requirements specification in formal cryptographic protocol analysis

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