Efficient Lattice (H)IBE in the Standard Model, Advances in Cryptology ? EUROCRYPT 2010, pp.553-572, 2010. ,
Learning with Rounding, Revisited, Advances in Cryptology ? CRYPTO 2013, pp.57-74, 2013. ,
New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen, vol.296, issue.1, pp.625-635, 1993. ,
New and Improved Key-Homomorphic Pseudorandom Functions, Advances in Cryptology ? CRYPTO 2014, pp.353-370, 2014. ,
Pseudorandom Functions and Lattices, Advances in Cryptology ? EUROCRYPT 2012, pp.719-737, 2012. ,
More Efficient Commitments from Structured Lattice Assumptions, Lecture Notes in Computer Science, pp.368-385, 2018. ,
Compact E-Cash and Simulatable VRFs Revisited, Pairing-Based Cryptography ? Pairing 2009, pp.114-131, 2009. ,
Key Homomorphic PRFs and Their Applications, Advances in Cryptology ? CRYPTO 2013, pp.410-428, 2013. ,
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs, Advances in Cryptology ? CRYPTO 2019, pp.176-202, 2019. ,
Divisible E-Cash from Constrained Pseudo-Random Functions, Lecture Notes in Computer Science, pp.679-708, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02357173
Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00922194
Compact E-Cash, Lecture Notes in Computer Science, pp.302-321, 2005. ,
Divisible e-cash made practical, IET Information Security, vol.10, issue.6, pp.332-347, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01088999
Blind Signatures for Untraceable Payments, Advances in Cryptology, pp.199-203, 1983. ,
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model, Advances in Cryptology ? EUROCRYPT 2000, pp.418-430, 2000. ,
, Contacts avec les médias, Rapport Annuel, pp.120-120, 2013.
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, SIAM Journal on Computing, vol.38, issue.1, pp.97-139, 2008. ,
Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices, Public-Key Cryptography ? PKC 2018, pp.89-119, 2018. ,