Damien Vergnaud
Orcid: 0000-0002-2113-3967
According to our database1,
Damien Vergnaud
authored at least 99 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Inf. Secur. J. A Glob. Perspect., March, 2024
Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head.
IACR Cryptol. ePrint Arch., 2024
Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations.
IACR Cryptol. ePrint Arch., 2024
IACR Commun. Cryptol., 2024
Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions.
IACR Commun. Cryptol., 2024
2023
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
2022
Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection.
IACR Cryptol. ePrint Arch., 2022
2021
Hardware security without secure hardware: How to decrypt with a password and a server.
Theor. Comput. Sci., 2021
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021
SIAM J. Discret. Math., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions.
Algorithmica, 2021
2020
Inferring sequences produced by elliptic curve generators using Coppersmith's methods.
Theor. Comput. Sci., 2020
Comment on "Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things".
IEEE Internet Things J., 2020
2019
Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions.
Des. Codes Cryptogr., 2019
Comput. J., 2019
2018
Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk).
Proceedings of the Information Security Theory and Practice, 2018
Proceedings of the Selected Areas in Cryptography - SAC 2018, 2018
2017
IACR Trans. Symmetric Cryptol., 2017
Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures.
IACR Cryptol. ePrint Arch., 2017
Comment on 'Attribute-Based Signatures for Supporting Anonymous Certification' by N. Kaaniche and M. Laurent (ESORICS 2016).
Comput. J., 2017
Appl. Algebra Eng. Commun. Comput., 2017
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017
Proceedings of the Computer Security - ESORICS 2017, 2017
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
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].
J. Comput. Syst. Sci., 2016
Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016
Lattice Attacks Against Elliptic-Curve Signatures with Blinded Scalar Multiplication.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016
2015
Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions.
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks.
IACR Cryptol. ePrint Arch., 2015
Practical Key Recovery for Discrete-Logarithm Based Authentication Schemes from Random Nonce Bits.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2015, 2015
2014
Proceedings of the Smart Card Research and Advanced Applications, 2014
2013
Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
IACR Cryptol. ePrint Arch., 2012
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012
Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith's Methods.
Proceedings of the Public Key Cryptography - PKC 2012, 2012
2011
Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys.
IEEE Trans. Inf. Theory, 2011
IEEE Trans. Inf. Theory, 2011
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.
IACR Cryptol. ePrint Arch., 2011
Proceedings of the Public Key Cryptography - PKC 2011, 2011
Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011
2010
Inf. Sci., 2010
IACR Cryptol. ePrint Arch., 2010
Proceedings of the Progress in Cryptology, 2010
2009
New Extensions of Pairing-Based Signatures into Universal (Multi) Designated Verifier Signatures.
Int. J. Found. Comput. Sci., 2009
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2009
Proceedings of the Public Key Cryptography, 2009
Proceedings of the Information Security, 12th International Conference, 2009
Proceedings of the Cryptography and Coding, 2009
Proceedings of the Topics in Cryptology, 2009
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009
2008
Efficient Accountable Authority Identity-Based Encryption under Static Complexity Assumptions
CoRR, 2008
Proceedings of the Pairing-Based Cryptography, 2008
Proceedings of the Topics in Cryptology, 2008
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008
2007
Inf. Process. Lett., 2007
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007
On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures.
Proceedings of the Information Security, 10th International Conference, 2007
Proceedings of the Information Security, 10th International Conference, 2007
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007
2006
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Proceedings of the Coding and Cryptography, International Workshop, 2005
Proceedings of the Progress in Cryptology, 2005
Proceedings of the Topics in Cryptology, 2005
Proceedings of the Advances in Cryptology, 2005
Proceedings of the Advances in Cryptology, 2005
2004
Int. J. Comput. Math., 2004
Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004
Proceedings of the Information and Communications Security, 6th International Conference, 2004