Yannick Seurin

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 31

Top Topics

Encryption Algorithm

Asymptotically Optimal

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Benoît Cogliati, Jérémy Jean, Thomas Peyrin, Yannick Seurin
A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers. IACR Cryptol. ePrint Arch. 2022 (2022)
Jérémy Jean, Ivica Nikolic, Thomas Peyrin, Yannick Seurin
The Deoxys AEAD Family. J. Cryptol. 34 (3) (2021)
Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin
QCB: Efficient Quantum-Secure Authenticated Encryption. ASIACRYPT (1) (2021)
Jonas Nick, Tim Ruffing, Yannick Seurin
MuSig2: Simple Two-Round Schnorr Multi-signatures. CRYPTO (1) (2021)
Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2021 (2021)
Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. CT-RSA (2021)
Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin
Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model. EUROCRYPT (2) (2020)
Jonas Nick, Tim Ruffing, Yannick Seurin, Pieter Wuille
MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. CCS (2020)
Jonas Nick, Tim Ruffing, Yannick Seurin
MuSig2: Simple Two-Round Schnorr Multi-Signatures. IACR Cryptol. ePrint Arch. 2020 (2020)
Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin
QCB: Efficient Quantum-secure Authenticated Encryption. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonas Nick, Tim Ruffing, Yannick Seurin, Pieter Wuille
MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. IACR Cryptol. ePrint Arch. 2020 (2020)
Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin
Blind Schnorr Signatures in the Algebraic Group Model. IACR Cryptol. ePrint Arch. 2019 (2019)
Gregory Maxwell, Andrew Poelstra, Yannick Seurin, Pieter Wuille
Simple Schnorr multi-signatures with applications to Bitcoin. Des. Codes Cryptogr. 87 (9) (2019)
Georg Fuchsbauer, Michele Orrù, Yannick Seurin
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. EUROCRYPT (1) (2019)
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. J. Cryptol. 31 (4) (2018)
Gregory Maxwell, Andrew Poelstra, Yannick Seurin, Pieter Wuille
Simple Schnorr Multi-Signatures with Applications to Bitcoin. IACR Cryptol. ePrint Arch. 2018 (2018)
Georg Fuchsbauer, Michele Orrù, Yannick Seurin
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. IACR Cryptol. ePrint Arch. 2018 (2018)
Benoît Cogliati, Yannick Seurin
Analysis of the single-permutation encrypted Davies-Meyer construction. Des. Codes Cryptogr. 86 (12) (2018)
Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin, Yannick Seurin
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication. IACR Cryptol. ePrint Arch. 2017 (2017)
Tetsu Iwata, Yannick Seurin
Reconsidering the Security Bound of AES-GCM-SIV. IACR Cryptol. ePrint Arch. 2017 (2017)
Tetsu Iwata, Yannick Seurin
Reconsidering the Security Bound of AES-GCM-SIV. IACR Trans. Symmetric Cryptol. 2017 (4) (2017)
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam
Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour. IACR Cryptol. ePrint Arch. 2017 (2017)
Benoît Cogliati, Jooyoung Lee, Yannick Seurin
New Constructions of MACs from (Tweakable) Block Ciphers. IACR Trans. Symmetric Cryptol. 2017 (2) (2017)
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. CRYPTO (3) (2017)
Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin, Yannick Seurin
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication. CRYPTO (3) (2017)
Thomas Peyrin, Yannick Seurin
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers. CRYPTO (1) (2016)
Benoît Cogliati, Yannick Seurin
Strengthening the Known-Key Security Notion for Block Ciphers. FSE (2016)
Benoît Cogliati, Yannick Seurin
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. CRYPTO (1) (2016)
Benoît Cogliati, Yannick Seurin
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. IACR Cryptol. ePrint Arch. 2016 (2016)
Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction. J. Cryptol. 29 (1) (2016)
Benoît Cogliati, Yannick Seurin
Strengthening the Known-Key Security Notion for Block Ciphers. IACR Cryptol. ePrint Arch. 2016 (2016)
Peter Gazi, Jooyoung Lee, Yannick Seurin, John P. Steinberger, Stefano Tessaro
Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. IACR Cryptol. ePrint Arch. 2015 (2015)
Thomas Peyrin, Yannick Seurin
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers. IACR Cryptol. ePrint Arch. 2015 (2015)
Benoit Cogliati, Yannick Seurin
On the Provable Security of the Iterated Even-Mansour Cipher against Related-Key and Chosen-Key Attacks. IACR Cryptol. ePrint Arch. 2015 (2015)
Brice Minaud, Yannick Seurin
The Iterated Random Permutation Problem with Applications to Cascade Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Brice Minaud, Yannick Seurin
The Iterated Random Permutation Problem with Applications to Cascade Encryption. CRYPTO (1) (2015)
Peter Gazi, Jooyoung Lee, Yannick Seurin, John P. Steinberger, Stefano Tessaro
Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. FSE (2015)
Benoit Cogliati, Yannick Seurin
On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks. EUROCRYPT (1) (2015)
Yannick Seurin
A Note on the Indifferentiability of the 10-Round Feistel Construction. IACR Cryptol. ePrint Arch. 2015 (2015)
Benoit Cogliati, Rodolphe Lampe, Yannick Seurin
Tweaking Even-Mansour Ciphers. CRYPTO (1) (2015)
Benoît Cogliati, Yannick Seurin
Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. ASIACRYPT (2) (2015)
Benoit Cogliati, Yannick Seurin
Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. IACR Cryptol. ePrint Arch. 2015 (2015)
Rodolphe Lampe, Yannick Seurin
Tweakable Blockciphers with Asymptotically Optimal Security. IACR Cryptol. ePrint Arch. 2015 (2015)
Benoit Cogliati, Rodolphe Lampe, Yannick Seurin
Tweaking Even-Mansour Ciphers. IACR Cryptol. ePrint Arch. 2015 (2015)
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. CRYPTO (1) (2014)
Rodolphe Lampe, Yannick Seurin
Security Analysis of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2014 (2014)
Yannick Seurin
On the Lossiness of the Rabin Trapdoor Function. Public Key Cryptography (2014)
Rodolphe Lampe, Yannick Seurin
Security Analysis of Key-Alternating Feistel Ciphers. FSE (2014)
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2014 (2014)
Benoit Cogliati, Jacques Patarin, Yannick Seurin
Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results. Selected Areas in Cryptography (2014)
Rodolphe Lampe, Yannick Seurin
Tweakable Blockciphers with Asymptotically Optimal Security. FSE (2013)
Rodolphe Lampe, Yannick Seurin
How to Construct an Ideal Cipher from a Small Set of Public Permutations. ASIACRYPT (1) (2013)
Yannick Seurin
New Constructions and Applications of Trapdoor DDH Groups. Public Key Cryptography (2013)
Yannick Seurin
On the Lossiness of the Rabin Trapdoor Function. IACR Cryptol. ePrint Arch. 2013 (2013)
Yannick Seurin, Joana Treger
A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. CT-RSA (2013)
Yannick Seurin
New Constructions and Applications of Trapdoor DDH Groups. IACR Cryptol. ePrint Arch. 2013 (2013)
Rodolphe Lampe, Yannick Seurin
How to Construct an Ideal Cipher from a Small Set of Public Permutations. IACR Cryptol. ePrint Arch. 2013 (2013)
Rodolphe Lampe, Jacques Patarin, Yannick Seurin
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. ASIACRYPT (2012)
Yannick Seurin
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. EUROCRYPT (2012)
Yannick Seurin
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2012 (2012)
Avradip Mandal, Jacques Patarin, Yannick Seurin
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. TCC (2012)
Yannick Seurin, Joana Treger
A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. IACR Cryptol. ePrint Arch. 2012 (2012)
Avradip Mandal, Jacques Patarin, Yannick Seurin
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. IACR Cryptol. ePrint Arch. 2011 (2011)
Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin
A Domain Extender for the Ideal Cipher. TCC (2010)
Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin
A Domain Extender for the Ideal Cipher. IACR Cryptol. ePrint Arch. 2009 (2009)
Olivier Billet, Jacques Patarin, Yannick Seurin
Analysis of Intermediate Field Systems. IACR Cryptol. ePrint Arch. 2009 (2009)
Olivier Billet, Matthew J. B. Robshaw, Yannick Seurin, Yiqun Lisa Yin
Looking Back at a New Hash Function. ACISP (2008)
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
How to Encrypt with the LPN Problem. ICALP (2) (2008)
Jacques Patarin, Yannick Seurin
Building Secure Block Ciphers on Generic Attacks Assumptions. Selected Areas in Cryptography (2008)
Andrey Bogdanov, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin
Hash Functions and RFID Tags: Mind the Gap. CHES (2008)
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
Are Hard to Find. Financial Cryptography (2008)
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
HB#: Increasing the Security and Efficiency of HB+. IACR Cryptol. ePrint Arch. 2008 (2008)
Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin
The Random Oracle Model and the Ideal Cipher Model Are Equivalent. CRYPTO (2008)
Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin
The Random Oracle Model and the Ideal Cipher Model are Equivalent. IACR Cryptol. ePrint Arch. 2008 (2008)
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
. EUROCRYPT (2008)
Yannick Seurin, Thomas Peyrin
Security Analysis of Constructions Combining FIL Random Oracles. FSE (2007)
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin, C. Vikkelsoe
PRESENT: An Ultra-Lightweight Block Cipher. CHES (2007)