EasyPQC: Verifying Post-Quantum Cryptography

Barbosa, Manuel; Barthe, Gilles; Fan, Xiong; Grégoire, Benjamin; Hung, Shih-Han; Katz, Jonathan; Strub, Pierre-Yves; Wu, Xiaodi; Zhou, Li

doi:10.1145/3460120.3484567

Cited by 13 publications

(2 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generalizations and other approaches. Two recent works [Barbosa et al 2021;Barthe et al 2019;Li and Unruh 2021;Unruh 2019b] develop relational Hoare logics for quantum programs. A promising direction for future work is to enhance our formalization to support relational reasoning.…”

Section: Related Workmentioning

confidence: 99%

CoqQ: Foundational Verification of Quantum Programs

Li¹,

Barthe²,

Strub³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its main components are: a deeply embedded quantum programming language, in which classic quantum algorithms are easily expressed, and an expressive program logic for proving properties of programs. CoqQ is foundational: the program logic is formally proved sound with respect to a denotational semantics based on state-of-art mathematical libraries (mathcomp and mathcomp analysis). CoqQ is also practical: assertions can use Dirac expressions, which eases concise specifications, and proofs can exploit local and parallel reasoning, which minimizes verification effort. We illustrate the applicability of CoqQ with many examples from the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

CoqQ: Foundational Verification of Quantum Programs

Li¹,

Barthe²,

Strub³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The previously mentioned EasyCrypt is a toolset for constructing cryptographic proofs, which currently mainly targets cryptographic primitives. It was first adapted to the quantum setting with qRHL [63], a formal security prover based on a quantum relational Hoare logic, and later (in concurrent work to ours) to the post-quantum setting with EasyPQC [8]. The qRHL approach works on quantum constructions, which substantially complicates proving classical constructions.…”

Section: Introductionmentioning

confidence: 99%

A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols

Cremers

Fontaine

Jacomme

2022

2022 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

We provide the first mechanized post-quantum sound security protocol proofs. We achieve this by developing PQ-BC, a computational first-order logic that is sound with respect to quantum attackers, and corresponding mechanization support in the form of the PQ-Squirrel prover.Our work builds on the classical BC logic [7] and its mechanization in the Squirrel [5] prover. Our development of PQ-BC requires making the BC logic sound for a single interactive quantum attacker. We implement the PQ-Squirrel prover by modifying Squirrel, relying on the soundness results of PQ-BC and enforcing a set of syntactic conditions; additionally, we provide new tactics for the logic that extend the tool's scope.Using PQ-Squirrel, we perform several case studies, thereby giving the first mechanical proofs of their computational post-quantum security. These include two generic constructions of KEM based key exchange, two sub-protocols from IKEv1 and IKEv2, and a proposed post-quantum variant of Signal's X3DH protocol. Additionally, we use PQ-Squirrel to prove that several classical Squirrel case studies are already post-quantum sound.

show abstract