Yannick Seurin

dblp:25/3463 · DBLP profile ↗
← Back
40ranked-venue papers
3as first author
6since 2021 · last 2026
0000-0002-2948-9423ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 38 · 3 first-author · 5 since 2021Theory of computation · 3Software engineering, systems software and programming languages · 1 · 1 since 2021
YearPublicationVenuePosition
2026 DahLIAS: Discrete Logarithm-Based Interactive Aggregate Signatures
Jonas Nick, Tim Ruffing, Yannick Seurin
EUROCRYPT (1)3
2025 Exposing Go's Hidden Bugs: A Novel Concolic Framework
abstract
The widespread adoption of the Go programming language [1] in infrastructure backends and blockchain projects has heightened the need for improved security measures. Established techniques such as unit testing, static analysis, and program fuzzing provide foundational protection mechanisms. Although symbolic execution tools have made significant contributions, opportunities remain to address the complexities of Go’s runtime and concurrency model. In this work, we present Zorya, a novel methodology leveraging concrete and symbolic (concolic) execution to evaluate Go programs comprehensively. By systematically exploring execution paths to uncover vulnerabilities beyond conventional testing, symbolic execution offers distinct advantages, and coupling it with concrete execution mitigates the path explosion problem. Our solution employs Ghidra’s PCode [2] as an intermediate representation (IR). This implementation detects runtime panics in the TinyGo compiler [3] and supports both generic and custom invariants. Furthermore, $\mathbf{P}$ Code’s generic IR nature enables analysis of programs written in other languages such as $\mathbf{C}$. Future enhancements may include intelligent classification of concolic execution logs to identify vulnerability patterns.
Karolina Gorna, Nicolas Iooss, Yannick Seurin, Rida Khatoun
SERA3
2021 QCB: Efficient Quantum-Secure Authenticated Encryption
Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin
ASIACRYPT (1)7
2021 MuSig2: Simple Two-Round Schnorr Multi-signatures
Jonas Nick, Tim Ruffing, Yannick Seurin
CRYPTO (1)3
2021 The Key-Dependent Message Security of Key-Alternating Feistel Ciphers
Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud
CT-RSA3
2021 The Deoxys AEAD Family
Jérémy Jean, Ivica Nikolic, Thomas Peyrin, Yannick Seurin
J. Cryptol.4
2020 MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces
abstract
MuSig is a multi-signature scheme for Schnorr signatures, which supports key aggregation and is secure in the plain public key model. Standard derandomization techniques for discrete logarithm-based signatures such as RFC~6979, which make the signing procedure immune to catastrophic failures in the randomness generation, are not applicable to multi-signatures as an attacker could trick an honest user into producing two different partial signatures with the same randomness, which would reveal the user's secret key.
Jonas Nick, Tim Ruffing, Yannick Seurin, Pieter Wuille
CCS3
2020 Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model
Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin
EUROCRYPT (2)3
2019 Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble
Georg Fuchsbauer, Michele Orrù, Yannick Seurin
EUROCRYPT (1)3
2019 Simple Schnorr multi-signatures with applications to Bitcoin
Gregory Maxwell, Andrew Poelstra, Yannick Seurin, Pieter Wuille
Des. Codes Cryptogr.3
2018 Analysis of the single-permutation encrypted Davies-Meyer construction
Benoit Cogliati, Yannick Seurin
Des. Codes Cryptogr.2
2018 Minimizing the Two-Round Even-Mansour Cipher
Rodolphe Lampe, Jooyoung Lee 0001, Yannick Seurin, John P. Steinberger
J. Cryptol.4
2017 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)2
2017 ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication
Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin, Yannick Seurin
CRYPTO (3)4
2016 EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
Benoit Cogliati, Yannick Seurin
CRYPTO (1)2
2016 Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
Thomas Peyrin, Yannick Seurin
CRYPTO (1)2
2016 Strengthening the Known-Key Security Notion for Block Ciphers
Benoit Cogliati, Yannick Seurin
FSE2
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.5
2015 Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing
Benoit Cogliati, Yannick Seurin
ASIACRYPT (2)2
2015 Tweaking Even-Mansour Ciphers
Benoit Cogliati, Rodolphe Lampe, Yannick Seurin
CRYPTO (1)3
2015 The Iterated Random Permutation Problem with Applications to Cascade Encryption
Brice Minaud, Yannick Seurin
CRYPTO (1)2
2015 On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
Benoit Cogliati, Yannick Seurin
EUROCRYPT (1)2
2015 Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
Peter Gazi, Jooyoung Lee 0001, Yannick Seurin, John P. Steinberger, Stefano Tessaro
FSE3
2014 Minimizing the Two-Round Even-Mansour Cipher
Rodolphe Lampe, Jooyoung Lee 0001, Yannick Seurin, John P. Steinberger
CRYPTO (1)4
2014 Security Analysis of Key-Alternating Feistel Ciphers
Rodolphe Lampe, Yannick Seurin
FSE2
2014 Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results
Benoit Cogliati, Jacques Patarin, Yannick Seurin
Selected Areas in Cryptography3
2013 How to Construct an Ideal Cipher from a Small Set of Public Permutations
Rodolphe Lampe, Yannick Seurin
ASIACRYPT (1)2
2013 A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption
Yannick Seurin, Joana Treger
CT-RSA1
2013 Tweakable Blockciphers with Asymptotically Optimal Security
Rodolphe Lampe, Yannick Seurin
FSE2
2012 An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
Rodolphe Lampe, Jacques Patarin, Yannick Seurin
ASIACRYPT3
2012 On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
Yannick Seurin
EUROCRYPT1
2012 On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
Avradip Mandal, Jacques Patarin, Yannick Seurin
TCC3
2010 A Domain Extender for the Ideal Cipher
Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin
TCC4
2008 Looking Back at a New Hash Function
Olivier Billet, Matthew J. B. Robshaw, Yannick Seurin, Yiqun Lisa Yin
ACISP3
2008 Hash Functions and RFID Tags: Mind the Gap
Andrey Bogdanov, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin
CHES6
2008 The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin
CRYPTO3
2008 HB#: Increasing the Security and Efficiency of HB+
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
EUROCRYPT3
2008 How to Encrypt with the LPN Problem
Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin
ICALP (2)3
2007 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
CHES7
2007 Security Analysis of Constructions Combining FIL Random Oracles
Yannick Seurin, Thomas Peyrin
FSE1