PRESENT: An Ultra-Lightweight Block Cipher. - Andrey Bogdanov; Lars R. Knudsen; Gregor Leander; Christof Paar; Axel Poschmann; Matthew J. B. Robshaw; Yannick Seurin; C. Vikkelsoe (CHES, 2007)

Security Analysis of Constructions Combining FIL Random Oracles. - Yannick Seurin; Thomas Peyrin (FSE, 2007)

Looking Back at a New Hash Function. - Olivier Billet; Matthew J. B. Robshaw; Yannick Seurin; Yiqun Lisa Yin (ACISP, 2008)

Hash Functions and RFID Tags: Mind the Gap. - Andrey Bogdanov; Gregor Leander; Christof Paar; Axel Poschmann; Matthew J. B. Robshaw; Yannick Seurin (CHES, 2008)

HB#: Increasing the Security and Efficiency of HB+. - Henri Gilbert; Matthew J. B. Robshaw; Yannick Seurin (EUROCRYPT, 2008)

Good Variants of HB+ Are Hard to Find. - Henri Gilbert; Matthew J. B. Robshaw; Yannick Seurin (Financial Cryptography, 2008)

How to Encrypt with the LPN Problem. - Henri Gilbert; Matthew J. B. Robshaw; Yannick Seurin (ICALP (2), 2008)

Building Secure Block Ciphers on Generic Attacks Assumptions. - Jacques Patarin; Yannick Seurin (Selected Areas in Cryptography, 2008)

The Random Oracle Model and the Ideal Cipher Model are Equivalent. - Jean-Sébastien Coron; Jacques Patarin; Yannick Seurin (IACR Cryptol. ePrint Arch., 2008)

HB#: Increasing the Security and Efficiency of HB+. - Henri Gilbert; Matthew J. B. Robshaw; Yannick Seurin (IACR Cryptol. ePrint Arch., 2008)

Analysis of Intermediate Field Systems. - Olivier Billet; Jacques Patarin; Yannick Seurin (IACR Cryptol. ePrint Arch., 2009)

A Domain Extender for the Ideal Cipher. - Jean-Sébastien Coron; Yevgeniy Dodis; Avradip Mandal; Yannick Seurin (IACR Cryptol. ePrint Arch., 2009)

On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. - Avradip Mandal; Jacques Patarin; Yannick Seurin (IACR Cryptol. ePrint Arch., 2011)

An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. - Rodolphe Lampe; Jacques Patarin; Yannick Seurin (ASIACRYPT, 2012)

On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. - Yannick Seurin (IACR Cryptol. ePrint Arch., 2012)

A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. - Yannick Seurin; Joana Treger (IACR Cryptol. ePrint Arch., 2012)

How to Construct an Ideal Cipher from a Small Set of Public Permutations. - Rodolphe Lampe; Yannick Seurin (IACR Cryptol. ePrint Arch., 2013)

On the Lossiness of the Rabin Trapdoor Function. - Yannick Seurin (IACR Cryptol. ePrint Arch., 2013)

New Constructions and Applications of Trapdoor DDH Groups. - Yannick Seurin (IACR Cryptol. ePrint Arch., 2013)

Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results. - Benoit Cogliati; Jacques Patarin; Yannick Seurin (Selected Areas in Cryptography, 2014)

Security Analysis of Key-Alternating Feistel Ciphers. - Rodolphe Lampe; Yannick Seurin (IACR Cryptol. ePrint Arch., 2014)

Tweaking Even-Mansour Ciphers. - Benoit Cogliati; Rodolphe Lampe; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

On the Provable Security of the Iterated Even-Mansour Cipher against Related-Key and Chosen-Key Attacks. - Benoit Cogliati; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. - Benoit Cogliati; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. - Peter Gazi; Jooyoung Lee 001; Yannick Seurin; John P. Steinberger; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2015)

Tweakable Blockciphers with Asymptotically Optimal Security. - Rodolphe Lampe; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

The Iterated Random Permutation Problem with Applications to Cascade Encryption. - Brice Minaud; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers. - Thomas Peyrin; Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

A Note on the Indifferentiability of the 10-Round Feistel Construction. - Yannick Seurin (IACR Cryptol. ePrint Arch., 2015)

Strengthening the Known-Key Security Notion for Block Ciphers. - Benoît Cogliati; Yannick Seurin (IACR Cryptol. ePrint Arch., 2016)

EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. - Benoît Cogliati; Yannick Seurin (IACR Cryptol. ePrint Arch., 2016)

How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction. - Jean-Sébastien Coron; Thomas Holenstein; Robin Künzler; Jacques Patarin; Yannick Seurin; Stefano Tessaro (J. Cryptol., 2016)

Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. - Yuanxi Dai; Yannick Seurin; John P. Steinberger; Aishwarya Thiruvengadam (CRYPTO (3), 2017)

Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour. - Yuanxi Dai; Yannick Seurin; John P. Steinberger; Aishwarya Thiruvengadam (IACR Cryptol. ePrint Arch., 2017)

ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication. - Tetsu Iwata; Kazuhiko Minematsu; Thomas Peyrin; Yannick Seurin (IACR Cryptol. ePrint Arch., 2017)

New Constructions of MACs from (Tweakable) Block Ciphers. - Benoît Cogliati; Jooyoung Lee 001; Yannick Seurin (IACR Trans. Symmetric Cryptol., 2017)

Reconsidering the Security Bound of AES-GCM-SIV. - Tetsu Iwata; Yannick Seurin (IACR Trans. Symmetric Cryptol., 2017)

Analysis of the single-permutation encrypted Davies-Meyer construction. - Benoît Cogliati; Yannick Seurin (Des. Codes Cryptogr., 2018)

Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. - Georg Fuchsbauer; Michele Orrù; Yannick Seurin (IACR Cryptol. ePrint Arch., 2018)

Minimizing the Two-Round Even-Mansour Cipher. - Shan Chen; Rodolphe Lampe; Jooyoung Lee 001; Yannick Seurin; John P. Steinberger (J. Cryptol., 2018)

Simple Schnorr multi-signatures with applications to Bitcoin. - Gregory Maxwell; Andrew Poelstra; Yannick Seurin; Pieter Wuille (Des. Codes Cryptogr., 2019)

Blind Schnorr Signatures in the Algebraic Group Model. - Georg Fuchsbauer; Antoine Plouviez; Yannick Seurin (IACR Cryptol. ePrint Arch., 2019)

Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model. - Georg Fuchsbauer; Antoine Plouviez; Yannick Seurin (EUROCRYPT (2), 2020)

QCB: Efficient Quantum-secure Authenticated Encryption. - Ritam Bhaumik; Xavier Bonnetain; André Chailloux; Gaëtan Leurent; María Naya-Plasencia; André Schrottenloher; Yannick Seurin (IACR Cryptol. ePrint Arch., 2020)

MuSig2: Simple Two-Round Schnorr Multi-Signatures. - Jonas Nick; Tim Ruffing; Yannick Seurin (IACR Cryptol. ePrint Arch., 2020)

MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. - Jonas Nick; Tim Ruffing; Yannick Seurin; Pieter Wuille (IACR Cryptol. ePrint Arch., 2020)

The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. - Pooya Farshim; Louiza Khati; Yannick Seurin; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2021)

The Deoxys AEAD Family. - Jérémy Jean; Ivica Nikolic; Thomas Peyrin; Yannick Seurin (J. Cryptol., 2021)

A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers. - Benoît Cogliati; Jérémy Jean; Thomas Peyrin; Yannick Seurin (IACR Commun. Cryptol., 2024)

DahLIAS: Discrete Logarithm-Based Interactive Aggregate Signatures. - Jonas Nick; Tim Ruffing; Yannick Seurin (IACR Cryptol. ePrint Arch., 2025)

Exposing Go's Hidden Bugs: A Novel Concolic Framework. - Karolina Gorna; Nicolas Iooss; Yannick Seurin; Rida Khatoun (CoRR, 2025)