Yannick Seurin

Orcid: 0000-0002-2948-9423

According to our database1, Yannick Seurin authored at least 51 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Exposing Go's Hidden Bugs: A Novel Concolic Framework.
CoRR, May, 2025

DahLIAS: Discrete Logarithm-Based Interactive Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2025

2024
A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers.
IACR Commun. Cryptol., 2024

2021
The Deoxys AEAD Family.
J. Cryptol., 2021

The Key-Dependent Message Security of Key-Alternating Feistel Ciphers.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

MuSig2: Simple Two-Round Schnorr Multi-signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

QCB: Efficient Quantum-Secure Authenticated Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Blind Schnorr Signatures in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2019

Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Simple Schnorr Multi-Signatures with Applications to Bitcoin.
IACR Cryptol. ePrint Arch., 2018

Analysis of the single-permutation encrypted Davies-Meyer construction.
Des. Codes Cryptogr., 2018

2017
New Constructions of MACs from (Tweakable) Block Ciphers.
IACR Trans. Symmetric Cryptol., 2017

Reconsidering the Security Bound of AES-GCM-SIV.
IACR Cryptol. ePrint Arch., 2017

Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour.
IACR Cryptol. ePrint Arch., 2017

ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.
J. Cryptol., 2016

Strengthening the Known-Key Security Notion for Block Ciphers.
Proceedings of the Fast Software Encryption - 23rd International Conference, 2016

Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

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

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.
Proceedings of the Fast Software Encryption - 22nd International Workshop, 2015

On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

The Iterated Random Permutation Problem with Applications to Cascade Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Tweaking Even-Mansour Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

On the Lossiness of the Rabin Trapdoor Function.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Security Analysis of Key-Alternating Feistel Ciphers.
Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

Minimizing the Two-Round Even-Mansour Cipher.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
New Constructions and Applications of Trapdoor DDH Groups.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Tweakable Blockciphers with Asymptotically Optimal Security.
Proceedings of the Fast Software Encryption - 20th International Workshop, 2013

A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

How to Construct an Ideal Cipher from a Small Set of Public Permutations.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2010
A Domain Extender for the Ideal Cipher.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009
Analysis of Intermediate Field Systems.
IACR Cryptol. ePrint Arch., 2009

2008
HB#: Increasing the Security and Efficiency of HB+.
IACR Cryptol. ePrint Arch., 2008

Building Secure Block Ciphers on Generic Attacks Assumptions.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

How to Encrypt with the LPN Problem.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Good Variants of HB<sup>+</sup> Are Hard to Find.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

HB<sup>#</sup>: Increasing the Security and Efficiency of HB<sup>+</sup>.
Proceedings of the Advances in Cryptology, 2008

The Random Oracle Model and the Ideal Cipher Model Are Equivalent.
Proceedings of the Advances in Cryptology, 2008

Hash Functions and RFID Tags: Mind the Gap.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

Looking Back at a New Hash Function.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007
Security Analysis of Constructions Combining FIL Random Oracles.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

PRESENT: An Ultra-Lightweight Block Cipher.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2007


  Loading...