Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation
No abstract available.
DOI 10.1007/978-3-540-24725-8_25
Related papers
- Modular verification of security protocol code by typing POPL 2010
- Modularity for decidability of deductive verification with applications to distributed systems PLDI 2018
- SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq TOPLAS 2023
- What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis ESOP 2003
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis CAV 2000
- Cryptographic Protocol Analysis on Real C Code VMCAI 2005
- Automatic Verification of Cryptographic Protocols through Compositional Analysis Techniques TACAS 1999
- A Simple Language for Real-Time Cryptographic Protocol Analysis ESOP 2003