Abstracting Cryptographic Protocols by Prolog Rules
Abstract elided by the publisher.
Related papers
- Abstracting Cryptographic Protocols with Tree Automata SAS 1999
- ILC: a calculus for composable, computational cryptography PLDI 2019
- What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis ESOP 2003
- TAPS: A First-Order Verifier for Cryptographic Protocols CAV 2000
- Analyzing Cryptographic Protocols in a Reactive Framework VMCAI 2002
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis CAV 2000
- A Bisimulation Method for Cryptographic Protocols ESOP 1998
- Automatic Verification of Time Sensitive Cryptographic Protocols TACAS 2004