Prof. Dr. Jean-Sébastien Coron
|
|
||||||
| Faculté ou Centre | Faculté des Sciences, des Technologies et de Médecine | ||||||
| Department | Département Informatique | ||||||
| Adresse postale |
Université du Luxembourg Maison du Nombre 6, Avenue de la Fonte L-4364 Esch-sur-Alzette |
||||||
| Bureau sur le campus | MNO, E03 0335-040 | ||||||
|
|||||||
| Téléphone | (+352) 46 66 44 6615 | ||||||
| Fax | (+352) 46 66 44 5500 | ||||||
Jean-Sebastien Coron is full professor in computer science at the University of Luxembourg, where he is leading the Applied Crypto Group (ACG). He is a former student of the Ecole Normale Supérieure (Paris, France) and received his Ph.D. in Computer Science from the Ecole Polytechnique (Palaiseau, France) in 2001, and his habilitation from University Paris 7 in 2006. His research interests include fully-homomorphic encryption, multilinear maps, and side-channel attacks and countermeasures. He is the author of more than 60 publications in cryptography.
URL: www.crypto-uni.lu
Last updated on: lundi 25 juin 2018
2020
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem;
in Advances in Cryptology -- CRYPTO 2020 (2020, August 10)
Simultaneous Diagonalization of Incomplete Matrices and Applications; ;
in Proceedings of the Fourteenth Algorithmic Number Theory Symposium (ANTS-XIV), edited by Steven Galbraith, Open Book Series 4, Mathematical Sciences Publishers, Berkeley, 2020 (2020, December)
2019
Improved Cryptanalysis of the AJPS Mersenne Based Cryptosystem;
in Journal of Mathematical Cryptology (2019)
Cryptanalysis of CLT13 Multilinear Maps with Independent Slots;
in Advances in Cryptology – ASIACRYPT 2019, 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II (2019, December)
On Kilian's Randomization of Multilinear Map Encodings;
in Coron, Jean-Sébastien; Pereira, Vitor (Eds.) On Kilian's Randomization of Multilinear Map Encodings (2019)
2017
High-Order Conversion from Boolean to Arithmetic Maskingin Proceedings of CHES 2017 (2017, September)
Zeroizing Attacks on Indistinguishability Obfuscation over CLT13; ; ;
in Proceedings of PKC 2017 (2017)
2016
Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme; ; ;
in Proceedings of CHES 2016 (2016)
2015
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitationsin Proceedings of Crypto 2015 (2015)
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity; ; ;
in Leander, Gregor (Ed.) Fast Software Encryption, 22nd International Workshop, FSE 2015, Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers (2015, March)
2014
Secure Conversion between Boolean and Arithmetic Masking of Any Order; ;
in Batina, Lejla; Robshaw, Matthew (Eds.) Cryptographic Hardware and Embedded Systems - CHES 2014, 16th International Workshop, Busan, South Korea, September 23-26, 2014. Proceedings (2014, September)
Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures; ;
in Batina, Lejla; Robshaw, Matthew (Eds.) Cryptographic Hardware and Embedded Systems – CHES 2014 (2014)
2013
2012
Conversion of Security Proofs from One Leakage Model to Another: A New Issue; ; ; ; ;
in Proceedings of COSADE 2012 (2012)
2011
2010
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009;
in Proceedings of CHES 2010 (2010)
2009
Fault Attacks on RSA Signatures with Partially Unknown Messages; ; ; ;
in Proceedings of CHES 2009 (2009)
An Efficient Method for Random Delay Generation in Embedded Software;
in Proceedings of CHES 2009 (2009)
Analysis of the split mask countermeasure for embedded systems;
in 4th Workshop on Embedded Systems Security (2009)
Practical Cryptanalysis of ISO/IEC 9796-2 and EMV Signatures; ; ;
in Proceedings of CRYPTO 2009 (2009)
2008
Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform; ; ;
in Advances in Cryptography (2008)
The Random Oracle Model and the Ideal Cipher Model Are Equivalent; ;
in Advances in Cryptography (2008)
