Multi-designated Verifiers Signatures. - Fabien Laguillaumie; Damien Vergnaud (ICICS, 2004)

Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map. - Fabien Laguillaumie; Damien Vergnaud (SCN, 2004)

Universal forgery on Sekhar's signature scheme with message recovery. - Fabien Laguillaumie; Jacques Traoré; Damien Vergnaud (Int. J. Comput. Math., 2004)

Universally Convertible Directed Signatures. - Fabien Laguillaumie; Pascal Paillier; Damien Vergnaud (ASIACRYPT, 2005)

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. - Pascal Paillier; Damien Vergnaud (ASIACRYPT, 2005)

Time-Selective Convertible Undeniable Signatures. - Fabien Laguillaumie; Damien Vergnaud (CT-RSA, 2005)

Short Undeniable Signatures Without Random Oracles: The Missing Link. - Fabien Laguillaumie; Damien Vergnaud (INDOCRYPT, 2005)

RSA-Based Secret Handshakes. - Damien Vergnaud (WCC, 2005)

New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures. - Damien Vergnaud (ICALP (2), 2006)

Gradually Convertible Undeniable Signatures. - Laila El Aimani; Damien Vergnaud (ACNS, 2007)

Trapdoor Permutation Polynomials of Z/ n Z and Public Key Cryptosystems. - Guilhem Castagnos; Damien Vergnaud (ISC, 2007)

On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures. - Fabien Laguillaumie; Damien Vergnaud (ISC, 2007)

On Kabatianskii-Krouk-Smeets Signatures. - Pierre-Louis Cayrel; Ayoub Otmani; Damien Vergnaud (WAIFI, 2007)

Multi-designated verifiers signatures: anonymity without encryption. - Fabien Laguillaumie; Damien Vergnaud (Inf. Process. Lett., 2007)

Multi-use unidirectional proxy re-signatures. - Benoît Libert; Damien Vergnaud (CCS, 2008)

Separation Results on the "One-More" Computational Problems. - Emmanuel Bresson; Jean Monnerat; Damien Vergnaud (CT-RSA, 2008)

Tracing Malicious Proxies in Proxy Re-encryption. - Benoît Libert; Damien Vergnaud (Pairing, 2008)

Efficient Accountable Authority Identity-Based Encryption under Static Complexity Assumptions - Benoît Libert; Damien Vergnaud (CoRR, 2008)

Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model. - Benoît Libert; Damien Vergnaud (CANS, 2009)

Adaptive-ID Secure Revocable Identity-Based Encryption. - Benoît Libert; Damien Vergnaud (CT-RSA, 2009)

Provably Secure Code-Based Threshold Ring Signatures. - Léonard Dallot; Damien Vergnaud (IMACC, 2009)

Fair E-Cash: Be Compact, Spend Faster. - Sébastien Canard; Cécile Delerablée; Aline Gouget; Emeline Hufschmitt; Fabien Laguillaumie; Hervé Sibert; Jacques Traoré; Damien Vergnaud (ISC, 2009)

Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys. - Benoît Libert; Damien Vergnaud (Public Key Cryptography, 2009)

Transferable Constant-Size Fair E-Cash. - Georg Fuchsbauer; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2009)

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. - Brett Hemenway; Benoît Libert; Rafail Ostrovsky; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2009)

New Extensions of Pairing-Based Signatures into Universal (Multi) Designated Verifier Signatures. - Damien Vergnaud (Int. J. Found. Comput. Sci., 2009)

Mediated Traceable Anonymous Encryption. - Malika Izabachène; David Pointcheval; Damien Vergnaud (LATINCRYPT, 2010)

On The Broadcast and Validity-Checking Security of PKCS #1 v1.5 Encryption. - Aurélie Bauer; Jean-Sébastien Coron; David Naccache; Mehdi Tibouchi; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2010)

Batch Groth-Sahai. - Olivier Blazy; Georg Fuchsbauer; Malika Izabachène; Amandine Jambert; Hervé Sibert; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2010)

Fair Blind Signatures without Random Oracles. - Georg Fuchsbauer; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2010)

Huff's Model for Elliptic Curves. - Marc Joye; Mehdi Tibouchi; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2010)

Time-selective convertible undeniable signatures with short conversion receipts. - Fabien Laguillaumie; Damien Vergnaud (Inf. Sci., 2010)

Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform. - Damien Vergnaud (AFRICACRYPT, 2011)

Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes. - Malika Izabachène; Benoît Libert; Damien Vergnaud (IMACC, 2011)

Signatures on Randomizable Ciphertexts. - Olivier Blazy; Georg Fuchsbauer; David Pointcheval; Damien Vergnaud (Public Key Cryptography, 2011)

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. - Aurore Guillevic; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2011)

Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption. - Benoît Libert; Damien Vergnaud (IEEE Trans. Inf. Theory, 2011)

Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys. - Benoît Libert; Damien Vergnaud (IEEE Trans. Inf. Theory, 2011)

Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith's Methods. - Aurélie Bauer; Damien Vergnaud; Jean-Christophe Zapalowicz (Public Key Cryptography, 2012)

Compact Round-Optimal Partially-Blind Signatures. - Olivier Blazy; David Pointcheval; Damien Vergnaud (SCN, 2012)

Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions. - Olivier Blazy; David Pointcheval; Damien Vergnaud (TCC, 2012)

Enumeration formula for (2, n)-cubes in discrete planes. - Eric Domenjoud; Damien Jamet; Damien Vergnaud; Laurent Vuillon (Discret. Appl. Math., 2012)

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages. - Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2012)

Time/Memory/Data Tradeoffs for Variants of the RSA Problem. - Pierre-Alain Fouque; Damien Vergnaud; Jean-Christophe Zapalowicz (COCOON, 2013)

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages. - Fabrice Ben Hamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (Public Key Cryptography, 2013)

Analysis and Improvement of Lindell's UC-Secure Commitment Schemes. - Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2013)

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust. - Yevgeniy Dodis; David Pointcheval; Sylvain Ruhault; Damien Vergnaud; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange. - Fabrice Ben Hamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2013)

Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks. - Damien Vergnaud; David Xiao (IACR Cryptol. ePrint Arch., 2013)

Short blind signatures. - Olivier Blazy; Georg Fuchsbauer; David Pointcheval; Damien Vergnaud (J. Comput. Secur., 2013)

Primitives et constructions en cryptographie asymétrique. - Damien Vergnaud (2014)

Algorithms for Outsourcing Pairing Computation. - Aurore Guillevic; Damien Vergnaud (CARDIS, 2014)

Practical Key Recovery for Discrete-Logarithm Based Authentication Schemes from Random Nonce Bits. - Aurélie Bauer; Damien Vergnaud (CHES, 2015)

Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks. - Michel Abdalla; Sonia Belaïd; David Pointcheval; Sylvain Ruhault; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2015)

New Techniques for SPHFs and Efficient One-Round PAKE Protocols. - Fabrice Benhamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2015)

Non-Interactive Zero-Knowledge Proofs of Non-Membership. - Olivier Blazy; Céline Chevalier; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2015)

Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions. - Olivier Blazy; Céline Chevalier; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2015)

Lattice Attacks Against Elliptic-Curve Signatures with Blinded Scalar Multiplication. - Dahmun Goudarzi; Matthieu Rivain; Damien Vergnaud (SAC, 2016)

Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function. - Thierry Mefenza; Damien Vergnaud (WAIFI, 2016)

Randomness Complexity of Private Circuits for Multiplication. - Sonia Belaïd; Fabrice Benhamouda; Alain Passelègue; Emmanuel Prouff; Adrian Thillard; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2016)

Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness. - Fabrice Benhamouda; Céline Chevalier; Adrian Thillard; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2016)

Full Disk Encryption: Bridging Theory and Practice. - Louiza Khati; Nicky Mouha; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2016)

Comment on "A strong provably secure IBE scheme without bilinear map" by M. Zheng, Y. Xiang and H. Zhou [J. Comput. Syst. Sci. 81 (2015) 125-131]. - Damien Vergnaud (J. Comput. Syst. Sci., 2016)

Private Multiplication over Finite Fields. - Sonia Belaïd; Fabrice Benhamouda; Alain Passelègue; Emmanuel Prouff; Adrian Thillard; Damien Vergnaud (CRYPTO (3), 2017)

Reusing Nonces in Schnorr Signatures - (and Keeping It Secure...). - Marc Beunardeau; Aisling Connolly; Houda Ferradi; Rémi Géraud; David Naccache; Damien Vergnaud (ESORICS (1), 2017)

Security of Pseudo-Random Number Generators with Input - (Invited Talk). - Damien Vergnaud (SECITC, 2017)

Polynomial interpolation of the Naor-Reingold pseudo-random function. - Thierry Mefenza; Damien Vergnaud (Appl. Algebra Eng. Commun. Comput., 2017)

Comment on 'Attribute-Based Signatures for Supporting Anonymous Certification' by N. Kaaniche and M. Laurent (ESORICS 2016). - Damien Vergnaud (Comput. J., 2017)

Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures. - Dahmun Goudarzi; Matthieu Rivain; Damien Vergnaud; Srinivas Vivek 001 (IACR Cryptol. ePrint Arch., 2017)

Security of Even-Mansour Ciphers under Key-Dependent Messages. - Pooya Farshim; Louiza Khati; Damien Vergnaud (IACR Trans. Symmetric Cryptol., 2017)

Analysis and Improvement of an Authentication Scheme in Incremental Cryptography. - Louiza Khati; Damien Vergnaud (SAC, 2018)

Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk). - Damien Vergnaud (WISTP, 2018)

Reusing Nonces in Schnorr Signatures. - Marc Beunardeau; Aisling Connolly; Houda Ferradi; Rémi Géraud; David Naccache; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2018)

Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting. - Thierry Mefenza; Damien Vergnaud (Comput. J., 2019)

Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions. - Thierry Mefenza; Damien Vergnaud (Des. Codes Cryptogr., 2019)

Public-Key Generation with Verifiable Randomness. - Olivier Blazy; Patrick Towa; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2020)

Succinct Diophantine-Satisfiability Arguments. - Patrick Towa; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2020)

Comment on "Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things". - Damien Vergnaud (IEEE Internet Things J., 2020)

Inferring sequences produced by elliptic curve generators using Coppersmith's methods. - Thierry Mefenza; Damien Vergnaud (Theor. Comput. Sci., 2020)

Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions. - Céline Chevalier; Fabien Laguillaumie; Damien Vergnaud (Algorithmica, 2021)

Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity. - Sonia Belaïd; Matthieu Rivain; Abdul Rahman Taleb; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2021)

The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. - Pooya Farshim; Louiza Khati; Yannick Seurin; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2021)

Speeding-up verification of digital signatures. - Abdul Rahman Taleb; Damien Vergnaud (J. Comput. Syst. Sci., 2021)

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. - Eyal Kushilevitz; Rafail Ostrovsky; Emmanuel Prouff; Adi Rosén; Adrian Thillard; Damien Vergnaud (SIAM J. Discret. Math., 2021)

Probing Security through Input-Output Separation and Revisited Quasilinear Masking. - Dahmun Goudarzi; Thomas Prest; Matthieu Rivain; Damien Vergnaud (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021)

Hardware security without secure hardware: How to decrypt with a password and a server. - Olivier Blazy; Laura Brouilhet; Céline Chevalier; Patrick Towa; Ida Tucker; Damien Vergnaud (Theor. Comput. Sci., 2021)

Cryptanalysis of Modular Exponentiation Outsourcing Protocols. - Charles Bouillaguet; Florette Martinez; Damien Vergnaud (Comput. J., 2022)

Secure storage - Confidentiality and authentication. - Ryad Benadjila; Louiza Khati; Damien Vergnaud (Comput. Sci. Rev., 2022)

Quantum security of subset cover problems. - Samuel Bouaziz-Ermann; Alex B. Grilo; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2022)

Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection. - Thibauld Feneuil; Jules Maire; Matthieu Rivain; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2022)

Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator. - Charles Bouillaguet; Florette Martinez; Damien Vergnaud (MFCS, 2023)

A Practical Template Attack on CRYSTALS-Dilithium. - Alexandre Berzati; Andersson Calle Viera; Maya Chartouni; Steven Madec; Damien Vergnaud; David Vigilant (IACR Cryptol. ePrint Arch., 2023)

Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems. - Jules Maire; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2023)

Exploiting Intermediate Value Leakage in Dilithium: A Template-Based Approach. - Alexandre Berzati; Andersson Calle Viera; Maya Chartouny; Steven Madec; Damien Vergnaud; David Vigilant (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023)

Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions. - Samuel Bouaziz-Ermann; Alex B. Grilo; Damien Vergnaud; Quoc-Huy Vu (IACR Commun. Cryptol., 2024)

Secure Multi-Party Linear Algebra with Perfect Correctness. - Jules Maire; Damien Vergnaud (IACR Commun. Cryptol., 2024)

Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations. - Pascal Giorgi; Fabien Laguillaumie; Lucas Ottow; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2024)

Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head. - Jules Maire; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2024)

Lattice attacks on pairing-based signatures. - Thierry Mefenza; Damien Vergnaud (Inf. Secur. J. A Glob. Perspect., 2024)

Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding. - Charles Bouillaguet; Claire Delaplace; Mickaël Hamdad; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2025)

Blinding Post-Quantum Hash-and-Sign Signatures. - Charles Bouillaguet; Thibauld Feneuil; Jules Maire; Matthieu Rivain; Julia Sauvage; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2025)

Threshold Niederreiter: Chosen-Ciphertext Security and Improved Distributed Decoding. - Pascal Giorgi; Fabien Laguillaumie; Lucas Ottow; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2025)

Compact zero-knowledge arguments for Blum integers. - Jules Maire; Damien Vergnaud (Theor. Comput. Sci., 2025)