default search action
Yannick Seurin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]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 Commun. Cryptol. 1(2): 17 (2024) - 2022
- [i33]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: 846 (2022) - 2021
- [j7]Jérémy Jean, Ivica Nikolic, Thomas Peyrin
, Yannick Seurin:
The Deoxys AEAD Family. J. Cryptol. 34(3): 31 (2021) - [c37]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: 668-698 - [c36]Jonas Nick, Tim Ruffing, Yannick Seurin:
MuSig2: Simple Two-Round Schnorr Multi-signatures. CRYPTO (1) 2021: 189-221 - [c35]Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. CT-RSA 2021: 351-374 - [i32]Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud:
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2021: 330 (2021) - 2020
- [c34]Jonas Nick, Tim Ruffing, Yannick Seurin, Pieter Wuille
MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. CCS 2020: 1717-1731 - [c33]Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin:
Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model. EUROCRYPT (2) 2020: 63-95 - [i31]Jonas Nick, Tim Ruffing, Yannick Seurin, Pieter Wuille:
MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. IACR Cryptol. ePrint Arch. 2020: 1057 (2020) - [i30]Jonas Nick, Tim Ruffing, Yannick Seurin:
MuSig2: Simple Two-Round Schnorr Multi-Signatures. IACR Cryptol. ePrint Arch. 2020: 1261 (2020) - [i29]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: 1304 (2020)
2010 – 2019
- 2019
- [j6]Gregory Maxwell, Andrew Poelstra, Yannick Seurin
Simple Schnorr multi-signatures with applications to Bitcoin. Des. Codes Cryptogr. 87(9): 2139-2164 (2019) - [c32]Georg Fuchsbauer, Michele Orrù
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. EUROCRYPT (1) 2019: 657-689 - [i28]Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin:
Blind Schnorr Signatures in the Algebraic Group Model. IACR Cryptol. ePrint Arch. 2019: 877 (2019) - 2018
- [j5]Benoît Cogliati, Yannick Seurin
Analysis of the single-permutation encrypted Davies-Meyer construction. Des. Codes Cryptogr. 86(12): 2703-2723 (2018) - [j4]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. J. Cryptol. 31(4): 1064-1119 (2018) - [i27]Gregory Maxwell, Andrew Poelstra, Yannick Seurin, Pieter Wuille:
Simple Schnorr Multi-Signatures with Applications to Bitcoin. IACR Cryptol. ePrint Arch. 2018: 68 (2018) - [i26]Georg Fuchsbauer, Michele Orrù, Yannick Seurin:
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble. IACR Cryptol. ePrint Arch. 2018: 1039 (2018) - 2017
- [j3]Benoît Cogliati, Jooyoung Lee, Yannick Seurin:
New Constructions of MACs from (Tweakable) Block Ciphers. IACR Trans. Symmetric Cryptol. 2017(2): 27-58 (2017) - [j2]Tetsu Iwata, Yannick Seurin:
Reconsidering the Security Bound of AES-GCM-SIV. IACR Trans. Symmetric Cryptol. 2017(4): 240-267 (2017) - [c31]Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication. CRYPTO (3) 2017: 34-65 - [c30]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: 524-555 - [i25]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: 42 (2017) - [i24]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: 535 (2017) - [i23]Tetsu Iwata, Yannick Seurin:
Reconsidering the Security Bound of AES-GCM-SIV. IACR Cryptol. ePrint Arch. 2017: 708 (2017) - 2016
- [j1]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): 61-114 (2016) - [c29]Thomas Peyrin
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers. CRYPTO (1) 2016: 33-63 - [c28]Benoît Cogliati, Yannick Seurin:
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. CRYPTO (1) 2016: 121-149 - [c27]Benoît Cogliati, Yannick Seurin:
Strengthening the Known-Key Security Notion for Block Ciphers. FSE 2016: 494-513 - [i22]Benoît Cogliati, Yannick Seurin:
Strengthening the Known-Key Security Notion for Block Ciphers. IACR Cryptol. ePrint Arch. 2016: 394 (2016) - [i21]Benoît Cogliati, Yannick Seurin:
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC. IACR Cryptol. ePrint Arch. 2016: 525 (2016) - 2015
- [c26]Benoît Cogliati, Yannick Seurin:
Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. ASIACRYPT (2) 2015: 134-158 - [c25]Benoit Cogliati, Rodolphe Lampe, Yannick Seurin:
Tweaking Even-Mansour Ciphers. CRYPTO (1) 2015: 189-208 - [c24]Brice Minaud, Yannick Seurin:
The Iterated Random Permutation Problem with Applications to Cascade Encryption. CRYPTO (1) 2015: 351-367 - [c23]Benoit Cogliati, Yannick Seurin:
On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks. EUROCRYPT (1) 2015: 584-613 - [c22]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: 319-341 - [i20]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: 69 (2015) - [i19]Rodolphe Lampe, Yannick Seurin:
Tweakable Blockciphers with Asymptotically Optimal Security. IACR Cryptol. ePrint Arch. 2015: 182 (2015) - [i18]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: 397 (2015) - [i17]Brice Minaud, Yannick Seurin:
The Iterated Random Permutation Problem with Applications to Cascade Encryption. IACR Cryptol. ePrint Arch. 2015: 504 (2015) - [i16]Benoit Cogliati, Rodolphe Lampe, Yannick Seurin:
Tweaking Even-Mansour Ciphers. IACR Cryptol. ePrint Arch. 2015: 539 (2015) - [i15]Benoit Cogliati, Yannick Seurin:
Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing. IACR Cryptol. ePrint Arch. 2015: 851 (2015) - [i14]Yannick Seurin:
A Note on the Indifferentiability of the 10-Round Feistel Construction. IACR Cryptol. ePrint Arch. 2015: 903 (2015) - [i13]Thomas Peyrin, Yannick Seurin:
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers. IACR Cryptol. ePrint Arch. 2015: 1049 (2015) - 2014
- [c21]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. CRYPTO (1) 2014: 39-56 - [c20]Rodolphe Lampe, Yannick Seurin:
Security Analysis of Key-Alternating Feistel Ciphers. FSE 2014: 243-264 - [c19]Yannick Seurin:
On the Lossiness of the Rabin Trapdoor Function. Public Key Cryptography 2014: 380-398 - [c18]Benoit Cogliati, Jacques Patarin, Yannick Seurin:
Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results. Selected Areas in Cryptography 2014: 129-146 - [i12]Rodolphe Lampe, Yannick Seurin:
Security Analysis of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2014: 151 (2014) - [i11]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2014: 443 (2014) - 2013
- [c17]Rodolphe Lampe, Yannick Seurin:
How to Construct an Ideal Cipher from a Small Set of Public Permutations. ASIACRYPT (1) 2013: 444-463 - [c16]Yannick Seurin, Joana Treger:
A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. CT-RSA 2013: 68-83 - [c15]Rodolphe Lampe, Yannick Seurin:
Tweakable Blockciphers with Asymptotically Optimal Security. FSE 2013: 133-151 - [c14]Yannick Seurin:
New Constructions and Applications of Trapdoor DDH Groups. Public Key Cryptography 2013: 443-460 - [i10]Rodolphe Lampe, Yannick Seurin:
How to Construct an Ideal Cipher from a Small Set of Public Permutations. IACR Cryptol. ePrint Arch. 2013: 255 (2013) - [i9]Yannick Seurin:
On the Lossiness of the Rabin Trapdoor Function. IACR Cryptol. ePrint Arch. 2013: 256 (2013) - [i8]Yannick Seurin:
New Constructions and Applications of Trapdoor DDH Groups. IACR Cryptol. ePrint Arch. 2013: 331 (2013) - 2012
- [c13]Rodolphe Lampe, Jacques Patarin, Yannick Seurin:
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. ASIACRYPT 2012: 278-295 - [c12]Yannick Seurin:
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. EUROCRYPT 2012: 554-571 - [c11]Avradip Mandal, Jacques Patarin, Yannick Seurin:
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. TCC 2012: 285-302 - [i7]Yannick Seurin:
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2012: 29 (2012) - [i6]Yannick Seurin, Joana Treger:
A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. IACR Cryptol. ePrint Arch. 2012: 649 (2012) - 2011
- [i5]Avradip Mandal, Jacques Patarin, Yannick Seurin:
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. IACR Cryptol. ePrint Arch. 2011: 496 (2011) - 2010
- [c10]Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin:
A Domain Extender for the Ideal Cipher. TCC 2010: 273-289
2000 – 2009
- 2009
- [i4]Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin:
A Domain Extender for the Ideal Cipher. IACR Cryptol. ePrint Arch. 2009: 356 (2009) - [i3]Olivier Billet, Jacques Patarin, Yannick Seurin:
Analysis of Intermediate Field Systems. IACR Cryptol. ePrint Arch. 2009: 542 (2009) - 2008
- [c9]Olivier Billet, Matthew J. B. Robshaw, Yannick Seurin, Yiqun Lisa Yin:
Looking Back at a New Hash Function. ACISP 2008: 239-253 - [c8]Andrey Bogdanov
Hash Functions and RFID Tags: Mind the Gap. CHES 2008: 283-299 - [c7]Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model Are Equivalent. CRYPTO 2008: 1-20 - [c6]Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
HB#: Increasing the Security and Efficiency of HB+. EUROCRYPT 2008: 361-378 - [c5]Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
Good Variants of HB+ Are Hard to Find. Financial Cryptography 2008: 156-170 - [c4]Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
How to Encrypt with the LPN Problem. ICALP (2) 2008: 679-690 - [c3]Jacques Patarin, Yannick Seurin:
Building Secure Block Ciphers on Generic Attacks Assumptions. Selected Areas in Cryptography 2008: 66-81 - [i2]Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
HB#: Increasing the Security and Efficiency of HB+. IACR Cryptol. ePrint Arch. 2008: 28 (2008) - [i1]Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model are Equivalent. IACR Cryptol. ePrint Arch. 2008: 246 (2008) - 2007
- [c2]Andrey Bogdanov, Lars R. Knudsen, Gregor Leander
PRESENT: An Ultra-Lightweight Block Cipher. CHES 2007: 450-466 - [c1]Yannick Seurin, Thomas Peyrin:
Security Analysis of Constructions Combining FIL Random Oracles. FSE 2007: 119-136
Coauthor Index
aka: Benoît Cogliati
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-27 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: