- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c15 |      | Yannick Seurin, Joana Treger: A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. CT-RSA 2013: 68-83 |
| c14 | | Yannick Seurin: New Constructions and Applications of Trapdoor DDH Groups. Public Key Cryptography 2013: 443-460 |
| 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 Cryptology ePrint Archive 2012: 29 (2012) |
| i6 | | Yannick Seurin, Joana Treger: A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption. IACR Cryptology ePrint Archive 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 Cryptology ePrint Archive 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 |
| 2009 | ||
| i4 | | Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin: A Domain Extender for the Ideal Cipher. IACR Cryptology ePrint Archive 2009: 356 (2009) |
| i3 | | Olivier Billet, Jacques Patarin, Yannick Seurin: Analysis of Intermediate Field Systems. IACR Cryptology ePrint Archive 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, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin: 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 Cryptology ePrint Archive 2008: 28 (2008) |
| i1 | | Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin: The Random Oracle Model and the Ideal Cipher Model are Equivalent. IACR Cryptology ePrint Archive 2008: 246 (2008) |
| 2007 | ||
| c2 | | 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: 450-466 |
| c1 | | Yannick Seurin, Thomas Peyrin: Security Analysis of Constructions Combining FIL Random Oracles. FSE 2007: 119-136 |
Data released under the ODC-BY 1.0 license — See also our legal information page