EasyPQC: Verifying Post-Quantum Cryptography
Manuel Barbosa, Gilles Barthe, Xiong Fan, Benjamin Grégoire, Shih-Han Hung, Jonathan Katz, Pierre-Yves Strub, Xiaodi Wu, Li Zhou
Abstract
EasyCrypt is a formal verification tool used extensively for formalizing concrete security proofs of cryptographic constructions. However, the EasyCrypt formal logics consider only classical at- tackers, which means that post-quantum security proofs cannot be formalized and machine-checked with this tool. In this paper we prove that a natural extension of the EasyCrypt core logics permits capturing a wide class of post-quantum cryptography proofs, settling a question raised by (Unruh, POPL 2019). Leveraging our positive result, we implement EasyPQC, an extension of EasyCrypt for post-quantum security proofs, and use EasyPQC to verify post- quantum security of three classic constructions: PRF-based MAC, Full Domain Hash and GPV08 identity-based encryption.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- CoqQ: Foundational Verification of Quantum ProgramsLi Zhou, Gilles Barthe, Pierre-Yves Strub, Junyi Liu et al.POPL 2023 · 33 citations
- Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and DilithiumManuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don et al.CRYPTO 2023 · 33 citations
- Formal verification of the PQXDH Post-Quantum key agreement protocol for end-to-end secure messagingKarthikeyan Bhargavan, Charlie Jacomme, Franziskus Kiefer, Rolfe SchmidtUSENIX Security 2024 · 27 citations
- A Logic and an Interactive Prover for the Computational Post-Quantum Security of ProtocolsCas Cremers, Caroline Fontaine, Charlie JacommeS&P 2022 · 19 citations
- Formally Verifying Kyber - Episode V: Machine-Checked IND-CCA Security and Correctness of ML-KEM in EasyCryptJosé Bacelar Almeida, Santiago Arranz-Olmos, Manuel Barbosa, Gilles Barthe et al.CRYPTO 2024 · 16 citations
Builds on6
- A verified optimizer for Quantum circuitsKesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu et al.POPL 2021 · 111 citations
- An Interactive Prover for Protocol Verification in the Computational ModelDavid Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos et al.S&P 2021 · 44 citations
- Relational proofs for quantum programsGilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu et al.POPL 2020 · 29 citations
- Symbolic Proofs for Lattice-Based CryptographyGilles Barthe, Xiong Fan, Joshua Gancher, Benjamin Grégoire et al.CCS 2018 · 14 citations
- Mechanized Proofs of Adversarial Complexity and Application to Universal ComposabilityManuel Barbosa, Gilles Barthe, Benjamin Grégoire, Adrien Koutsos et al.CCS 2021 · 13 citations
Related papers
- Formal Verification of Saber's Public-Key Encryption Scheme in EasyCryptAndreas Hülsing, Matthias Meijers, Pierre-Yves StrubCRYPTO 2022 · 11 citations
- Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security ProofsMartin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser et al.OOPSLA 2024 · 5 citations
- Post-quantum Security of Tweakable Even-Mansour, and ApplicationsGorjan Alagic, Chen Bai, Jonathan Katz, Christian Majenz et al.EUROCRYPT 2024 · 10 citations
- A High-Assurance Evaluator for Machine-Checked Secure Multiparty ComputationKarim Eldefrawy, Vitor PereiraCCS 2019 · 14 citations
- Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3José Bacelar Almeida, Cécile Baritel-Ruet, Manuel Barbosa, Gilles Barthe et al.CCS 2019 · 35 citations
