Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later

DOI10.1007/978-3-319-23165-5_22zbMath1322.94089OpenAlexW2403610009MaRDI QIDQ2945721

Catherine A. Meadows

Publication date: 14 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_22

Mathematics Subject Classification ID

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

Related Items (1)

Modular verification of protocol equivalence in the presence of randomness

Uses Software

• AVISPA
• EasyCrypt
• TAMARIN
• CoSP
• Helios

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal analysis of Kerberos 5
• Verifying the SET purchase protocols
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Folding variant narrowing and optimal variant termination
• Automated verification of selected equivalences for security protocols
• Cryptographic puzzles and DoS resilience, revisited
• Analysing Routing Protocols: Four Nodes Topologies Are Sufficient
• Verification of Security Protocols with Lists: From Length One to Unbounded Length
• Towards Unconditional Soundness: Computationally Complete Symbolic Attacker
• An Introduction to Security API Analysis
• A logic of authentication
• Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis
• Symmetric Authentication within a Simulatable Cryptographic Library
• Mobile values, new names, and secure communication
• Computer-Aided Security Proofs for the Working Cryptographer
• Deciding Security for Protocols with Recursive Tests
• STACS 2004
• Secure Communications over Insecure Channels Based on Short Authenticated Strings
• Term Rewriting and Applications
• Computer Aided Verification
• Automata, Languages and Programming
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• Searching for Shapes in Cryptographic Protocols
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later