Explore the latest advancements in ProVerif, a powerful tool for automated security protocol analysis, in this 17-minute IEEE conference talk. Delve into the enhanced features including lemmas, induction, and fast subsumption techniques. Learn how these improvements contribute to more efficient and comprehensive security protocol verification. Gain insights from experts Bruno Blanchet, Vincent Cheval, and Véronique Cortier as they discuss the expanded capabilities and potential applications of ProVerif in modern cryptographic protocol analysis.
ProVerif with Lemmas, Induction, Fast Subsumption, and Much More
Overview
Syllabus
ProVerif with Lemmas, Induction, Fast Subsumption, and Much More
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
-
Distance-Bounding Protocols - Verification without Time and Location
-
WebSpec - Towards Machine-Checked Analysis of Browser Security Mechanisms
-
Bulletproofs - Short Proofs for Confidential Transactions and More
-
A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols
-
Automated Analysis and Verification of TLS 1.3 - 0-RTT, Resumption and Delayed Authentication
-
An I/O Separation Model for Formal Verification of Kernel Implementations
