إصدارات 2016-2025

• 2025
  • J. Maire, D. Vergnaud : “Compact zero-knowledge arguments for Blum integers”, Theoretical Computer Science, vol. 1038, pp. 115155, (Elsevier) (2025)
• 2024
  • P. Giorgi, F. Laguillaumie, L. Ottow, D. Vergnaud : “Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations”, ITC 2024 - 5^th Information-Theoretic Cryptography Conference, Stanford, CA, United States (2024)
  • J. Maire, D. Vergnaud : “Secure Multi-Party Linear Algebra with Perfect Correctness”, IACR Communications in Cryptology, (International Association for Cryptologic Research (IACR)) (2024)
  • S. Bouaziz‑‑Ermann, A. Bredariol Grilo, D. Vergnaud, Q.‑H. Vu : “Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions”, IACR Communications in Cryptology, (International Association for Cryptologic Research (IACR)) (2024)
  • 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)
• 2023
  • J. Maire, D. Vergnaud : “Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head”, Computer Security - ESORICS 2023 - 28^th European Symposium on Research in Computer Security, The Hague, Netherlands, September 25-29, 2023, Proceedings, The Hague, Netherlands, (Springer Nature) (2023)
  • D. Vergnaud : “Exercices et problèmes de cryptographie - 4^e édition”, Info sup, (Dunod), (ISBN: 9782100852840) (2023)
  • S. Bouaziz‑‑Ermann, A. Bredariol Grilo, D. Vergnaud : “Quantum security of subset cover problems”, 4^th Conference on Information-Theoretic Cryptography (ITC 2023), vol. 267, Leibniz International Proceedings in Informatics (LIPIcs), Aahrus, Denmark, pp. 9:1-9:17, (Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik), (ISBN: 978-3-95977-271-6) (2023)
  • J. Maire, D. Vergnaud : “Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems”, Computer Security - ESORICS 2023 - 28^th European Symposium on Research in Computer Security,, Lecture Notes in Computer Science, The Hague, Netherlands, (Springer Nature) (2023)
  • Ch. Bouillaguet, F. Martinez, D. Vergnaud : “Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator”, 48^th 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)
  • A. Berzati, A. Calle Viera, M. Chartouny, S. Madec, D. Vergnaud, D. Vigilant : “Exploiting Intermediate Value Leakage in Dilithium: A Template-Based Approach”, IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2023 (4), pp. 188-210, (IACR) (2023)
• 2022
  • R. Benadjila, L. Khati, D. Vergnaud : “Secure storage—Confidentiality and authentication”, Computer Science Review, vol. 44, pp. 100465, (Elsevier) (2022)
  • Th. Feneuil, J. Maire, M. Rivain, D. Vergnaud : “Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection”, Advances in Cryptology - Asiacrypt 2022, vol. 13792, Lecture Notes in Computer Science, Taipei, Taiwan, Province of China, pp. 371–402, (Springer) (2022)
  • Ch. Bouillaguet, F. Martinez, D. Vergnaud : “Cryptanalysis of Modular Exponentiation Outsourcing Protocols”, The Computer Journal, vol. 65 (9), pp. 2299–2314, (Oxford University Press (UK)) (2022)
• 2021
  • S. Belaid, M. Rivain, A. Taleb, D. Vergnaud : “Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity”, Advances in Cryptology – Asiacrypt 2021, vol. 13091, Lecture Notes in Computer Science, Singapour, Singapore, pp. 157-188, (Springer) (2021)
  • O. Blazy, L. Brouilhet, C. Chevalier, P. Towa, I. Tucker, D. Vergnaud : “Hardware security without secure hardware: How to decrypt with a password and a server”, Theoretical Computer Science, vol. 895, pp. 178-211, (Elsevier) (2021)
  • P. Farshim, L. Khati, Y. Seurin, D. Vergnaud : “The Key-Dependent Message Security of Key-Alternating Feistel Ciphers”, Topics in Cryptology - CT-RSA 2021 - The Cryptographers' Track at the RSA Conference 2021, San Francisco, CA, United States (2021)
  • A. Taleb, D. Vergnaud : “Speeding-Up Verification of Digital Signatures”, Journal of Computer and System Sciences, vol. 116, pp. 22-39, (Elsevier) (2021)
  • C. Chevalier, F. Laguillaumie, D. Vergnaud : “Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions”, Algorithmica, vol. 83 (1), pp. 72-115, (Springer Verlag) (2021)
  • 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”, SIAM Journal on Discrete Mathematics, vol. 35 (1), pp. 465-484, (Society for Industrial and Applied Mathematics) (2021)
  • D. Goudarzi, Th. Prest, M. Rivain, D. Vergnaud : “Probing Security through Input-Output Separation and Revisited Quasilinear Masking”, IACR Transactions on Cryptographic Hardware and Embedded Systems, (IACR) (2021)
• 2020
  • O. Blazy, P. Towa, D. Vergnaud : “Public-Key Generation with Verifiable Randomness”, Advances in Cryptology - ASIACRYPT 2020 - 26^th 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 - 26^th Annual International Conference on the Theory and Application of Cryptology and Information Security, vol. 12493, Advances in Cryptology - ASIACRYPT 2020 - 26^th 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)
  • Th. Mefenza, D. Vergnaud : “Inferring sequences produced by elliptic curve generators using Coppersmith’s methods”, Theoretical Computer Science, vol. 830-831, pp. 20-42, (Elsevier) (2020)
  • D. Vergnaud : “Comment on "Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things"”, IEEE internet of things journal, vol. 7 (11), pp. 11327-11329, (IEEE) (2020)
• 2019
  • 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 - 17^th International Conference on Theory of Cryptography, vol. 11892, Lecture Notes in Computer Science, Nuremberg, Germany, pp. 386-406, (Springer) (2019)
  • Th. Mefenza, D. Vergnaud : “Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting”, The Computer Journal, vol. 62 (8), pp. 1194–1213, (Oxford University Press (UK)) (2019)
  • L. Khati, D. Vergnaud : “Analysis and Improvement of an Authentication Scheme in Incremental Cryptography”, SAC 2018 - 25^th International Conference on Selected Areas in Cryptography, vol. 11349, Lecture Notes in Computer Science, Calgary, Canada, pp. 50-70, (Springer) (2019)
  • Th. Mefenza, D. Vergnaud : “Polynomial interpolation of the generalized Diffie–Hellman and Naor–Reingold functions”, Designs, Codes and Cryptography, vol. 87 (1), pp. 75-85, (Springer Verlag) (2019)
  • D. Vergnaud : “Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)”, Information Security Theory and Practice, vol. 11469, Lecture Notes in Computer Science, Brussels, Belgium, pp. 7-11, (Springer International Publishing) (2019)
• 2018
  • D. Vergnaud : “Exercices et problèmes de cryptographie - 3^e édition”, (DUNOD) (2018)
• 2017
  • 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)
• 2016
  • S. Belaid, F. Benhamouda, A. Passelègue, E. Prouff, A. Thillard, D. Vergnaud : “Randomness Complexity of Private Circuits for Multiplication”, EUROCRYPT 2016, Vienna, Austria, pp. 616-648 (2016)