Finite Models in FOL-Based Crypto-Protocol Verification
From MaRDI portal
Recommendations
- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- On the reachability problem in cryptographic protocols
- Equal to the task?
- Cryptographically sound and machine-assisted verification of security protocols
Cited in
(4)
This page was built for publication: Finite Models in FOL-Based Crypto-Protocol Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184717)