S. Agrawal, D. Boneh, and X. Boyen, Efficient Lattice (H)IBE in the Standard Model, Advances in Cryptology ? EUROCRYPT 2010, pp.553-572, 2010.

J. Alwen, S. Krenn, K. Pietrzak, and D. Wichs, Learning with Rounding, Revisited, Advances in Cryptology ? CRYPTO 2013, pp.57-74, 2013.

W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen, vol.296, issue.1, pp.625-635, 1993.

A. Banerjee and C. Peikert, New and Improved Key-Homomorphic Pseudorandom Functions, Advances in Cryptology ? CRYPTO 2014, pp.353-370, 2014.

A. Banerjee, C. Peikert, and A. Rosen, Pseudorandom Functions and Lattices, Advances in Cryptology ? EUROCRYPT 2012, pp.719-737, 2012.

C. Baum, I. Damgård, V. Lyubashevsky, S. Oechsner, and C. Peikert, More Efficient Commitments from Structured Lattice Assumptions, Lecture Notes in Computer Science, pp.368-385, 2018.

M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya, Compact E-Cash and Simulatable VRFs Revisited, Pairing-Based Cryptography ? Pairing 2009, pp.114-131, 2009.

D. Boneh, K. Lewi, H. Montgomery, and A. Raghunathan, Key Homomorphic PRFs and Their Applications, Advances in Cryptology ? CRYPTO 2013, pp.410-428, 2013.

J. Bootle, V. Lyubashevsky, and G. Seiler, Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs, Advances in Cryptology ? CRYPTO 2019, pp.176-202, 2019.

F. Bourse, D. Pointcheval, and O. Sanders, 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

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, 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

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Compact E-Cash, Lecture Notes in Computer Science, pp.302-321, 2005.

S. Canard, D. Pointcheval, O. Sanders, and J. Traoré, Divisible e-cash made practical, IET Information Security, vol.10, issue.6, pp.332-347, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01088999

D. Chaum, Blind Signatures for Untraceable Payments, Advances in Cryptology, pp.199-203, 1983.

I. Damgård, 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.

Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, 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.

A. El-kaafarani and S. Katsumata, Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices, Public-Key Cryptography ? PKC 2018, pp.89-119, 2018.