Pierre-Yves Strub

Computer Science · Physical Sciences

29h-index3.1kcitations115works2.42yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptographic Implementations and Security(34), Cryptography and Data Security(32), Security and Verification in Computing(31), Logic, programming, and type systems(30), Formal Methods in Verification(20)

Publications115 total

Formally Verified Correctness Bounds for Lattice-Based Cryptography
2025Open Access
Jazzline: Composable CryptoLine Functional Correctness Proofs for Jasmin Programs
2025Open Access
Faster Verification of Faster Implementations: Combining Deductive and Circuit-Based Reasoning in EasyCrypt
2025
A Tight Security Proof for SPHINCS$$^{+}$$, Formally Verified
Lecture notes in computer science·2024Open Access
High-Performance NTT Hardware Accelerator to Support ML-KEM and ML-DSA
2024· 4 citedOpen Access
CV2EC: Getting the Best of Both Worlds
2024· 2 citedOpen Access
Formally Verifying Kyber
Lecture notes in computer science·2024· 11 citedOpen Access
Formally verifying Kyber
IACR Transactions on Cryptographic Hardware and Embedded Systems·2023· 9 citedOpen Access
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
ACM Transactions on Privacy and Security·2023· 2 citedOpen Access
A Formal Disproof of Hirsch Conjecture
2023· 3 citedOpen Access
A Formal Disproof of the Hirsch Conjecture
arXiv (Cornell University)·2023Open Access
Coq Development for Article `CoqQ: Foundational Verification of Quantum Programs`
Artifact Digital Object Group·2023· 2 cited
CoqQ: Foundational Verification of Quantum Programs
Proceedings of the ACM on Programming Languages·2023· 28 citedOpen Access
Design patterns of hierarchies for order structures
SPIRE - Sciences Po Institutional REpository·2023· 1 citedOpen Access
Machine-Checked Security for $$\textrm{XMSS} $$ as in RFC 8391 and $$\mathrm {SPHINCS^{+}} $$
Lecture notes in computer science·2023· 2 citedOpen Access
CoqQ: Foundational Verification of Quantum Programs
arXiv (Cornell University)·2022· 1 citedOpen Access
Actema : une interface graphique et gestuelle pour preuves formelles (démonstration)
HAL (Le Centre pour la Communication Scientifique Directe)·2022Open Access
Formalizing the Face Lattice of Polyhedra
Logical Methods in Computer Science·2022Open Access
A drag-and-drop proof tactic
2022· 5 citedOpen Access
Formal Verification of Saber’s Public-Key Encryption Scheme in EasyCrypt
Lecture notes in computer science·2022· 6 citedOpen Access
page 1 of 6Next →

Frequent Co-authors

Gilles Barthe(25), Benjamin Grégoire(19), Cédric Fournet(17), Karthikeyan Bhargavan(12), Nikhil Swamy(11), Justin Hsu(11), Markulf Kohlweiss(8), François Dupressoir(8), Juan Chen(7), Marco Gaboardi(7), Santiago Zanella-Béguelin(6), A. Pironti(6), Manuel Barbosa(5), Antoine Delignat-Lavaud(4), José Bacelar Almeida(4), Vincent Laporte(4), Tiago Oliveira(4), Emilio Jesús Gallego Arias(4), Thomas Espitau(4), Sonia Belaïd(3)