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
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper9
- CoqQ: Foundational Verification of Quantum ProgramsLi Zhou, Gilles Barthe, Pierre-Yves Strub, Junyi Liu 等POPL 2023 · 被引用 33 次
- Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and DilithiumManuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don 等CRYPTO 2023 · 被引用 33 次
- 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 次
- A Logic and an Interactive Prover for the Computational Post-Quantum Security of ProtocolsCas Cremers, Caroline Fontaine, Charlie JacommeS&P 2022 · 被引用 19 次
- 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 等CRYPTO 2024 · 被引用 16 次
它引用的顶会 Paper6
- A verified optimizer for Quantum circuitsKesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu 等POPL 2021 · 被引用 111 次
- An Interactive Prover for Protocol Verification in the Computational ModelDavid Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos 等S&P 2021 · 被引用 44 次
- Relational proofs for quantum programsGilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu 等POPL 2020 · 被引用 29 次
- Symbolic Proofs for Lattice-Based CryptographyGilles Barthe, Xiong Fan, Joshua Gancher, Benjamin Grégoire 等CCS 2018 · 被引用 14 次
- Mechanized Proofs of Adversarial Complexity and Application to Universal ComposabilityManuel Barbosa, Gilles Barthe, Benjamin Grégoire, Adrien Koutsos 等CCS 2021 · 被引用 13 次
相关 Paper
- Formal Verification of Saber's Public-Key Encryption Scheme in EasyCryptAndreas Hülsing, Matthias Meijers, Pierre-Yves StrubCRYPTO 2022 · 被引用 11 次
- Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security ProofsMartin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser 等OOPSLA 2024 · 被引用 5 次
- Post-quantum Security of Tweakable Even-Mansour, and ApplicationsGorjan Alagic, Chen Bai, Jonathan Katz, Christian Majenz 等EUROCRYPT 2024 · 被引用 10 次
- A High-Assurance Evaluator for Machine-Checked Secure Multiparty ComputationKarim Eldefrawy, Vitor PereiraCCS 2019 · 被引用 14 次
- 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 等CCS 2019 · 被引用 35 次
