Logic for verifying public-key cryptographic protocols
From MaRDI portal
Recommendations
Cited in
(16)- Using probabilistic argumentation for key validation in public-key cryptography
- LACPV'2001. Logical aspects of cryptographic protocol verification. Proceedings of the 1st workshop (a satellite workshop of CAV'01), Paris, France, July 23, 2001.
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Proof techniques for cryptographic processes
- Modal logics for cryptographic processes
- Protocol composition logic (PCL)
- Cryptographic Verification by Typing for a Sample Protocol Implementation
- scientific article; zbMATH DE number 4195145 (Why is no real title available?)
- A logic of authentication
- Verification logic
- scientific article; zbMATH DE number 1926618 (Why is no real title available?)
- scientific article; zbMATH DE number 1424193 (Why is no real title available?)
- scientific article; zbMATH DE number 4197466 (Why is no real title available?)
- Probabilistic relational verification for cryptographic implementations
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
This page was built for publication: Logic for verifying public-key cryptographic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125910)
