Th. Mefenza, D. Vergnaud : “Lattice attacks on pairing-based signatures”, Information Security Journal: A Global Perspective, vol. 33 (2), pp. 138-157, (Taylor & Francis) (2024)
Ch. Bouillaguet, F. Martinez, D. Vergnaud : “Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator”, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics (LIPIcs), Bordeaux, France, (Schloss Dagstuhl) (2023)
O. Blazy, P. Towa, D. Vergnaud : “Public-Key Generation with Verifiable Randomness”, Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Dadjeon South Korea, December 6-10, 2020. Proceedings, Part I, vol. 12491, Lecture Notes in Computer Science, Daejeon / Virtual, Korea, Republic of, pp. 97-127, (Springer) (2020)
P. Towa, D. Vergnaud : “Succinct Diophantine-Satisfiability Arguments”, Asiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, vol. 12493, Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Dadjeon South Korea, December 6-10, 2020. Proceedings, Part III, Daejeon / Virtual, Korea, Republic of, pp. 774-804, (Springer) (2020)
E. Kushilevitz, R. Ostrovsky, E. Prouff, A. Rosén, A. Thillard, D. Vergnaud : “Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND”, TCC 2019 - 17th International Conference on Theory of Cryptography, vol. 11892, Lecture Notes in Computer Science, Nuremberg, Germany, pp. 386-406, (Springer) (2019)
Th. Mefenza, D. Vergnaud : “Lattice Attacks on Pairing-Based Signatures”, IMACC 2017: Cryptography and Coding, vol. 10655, Lecture Notes in Computer Science, Oxford, United Kingdom, pp. 352-370, (Springer) (2017)
S. Belaid, F. Benhamouda, A. Passelègue, E. Prouff, A. Thillard, D. Vergnaud : “Private Multiplication over Finite Fields”, Advances in Cryptology - CRYPTO 2017, vol. 10403, Lecture Notes in Computer Science, Santa Barbara, United States, pp. 397-426, (Springer) (2017)