Damien Vergnaud

According to our database1, Damien Vergnaud authored at least 87 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Hardware security without secure hardware: How to decrypt with a password and a server.
Theor. Comput. Sci., 2021

Probing Security through Input-Output Separation and Revisited Quasilinear Masking.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
SIAM J. Discret. Math., 2021

Speeding-up verification of digital signatures.
J. Comput. Syst. Sci., 2021

The Key-Dependent Message Security of Key-Alternating Feistel Ciphers.
IACR Cryptol. ePrint Arch., 2021

Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity.
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

Succinct Diophantine-Satisfiability Arguments.
IACR Cryptol. ePrint Arch., 2020

Public-Key Generation with Verifiable Randomness.
IACR Cryptol. ePrint Arch., 2020

2019
Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions.
Des. Codes Cryptogr., 2019

Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting.
Comput. J., 2019

2018
Reusing Nonces in Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2018

Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk).
Proceedings of the Information Security Theory and Practice, 2018

Analysis and Improvement of an Authentication Scheme in Incremental Cryptography.
Proceedings of the Selected Areas in Cryptography - SAC 2018, 2018

2017
Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures.
IACR Cryptol. ePrint Arch., 2017

Security of Even-Mansour Ciphers under Key-Dependent Messages.
IACR Cryptol. ePrint Arch., 2017

Polynomial interpolation of the Naor-Reingold pseudo-random function.
Appl. Algebra Eng. Commun. Comput., 2017

Security of Pseudo-Random Number Generators with Input - (Invited Talk).
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017

Lattice Attacks on Pairing-Based Signatures.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

Reusing Nonces in Schnorr Signatures - (and Keeping It Secure...).
Proceedings of the Computer Security - ESORICS 2017, 2017

Private Multiplication over Finite Fields.
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

Comment on "Attribute-Based Signatures for Supporting Anonymous Certification" by N. Kaaniche and M. Laurent (ESORICS 2016).
IACR Cryptol. ePrint Arch., 2016

Full Disk Encryption: Bridging Theory and Practice.
IACR Cryptol. ePrint Arch., 2016

Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2016

Randomness Complexity of Private Circuits for Multiplication.
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

Non-Interactive Zero-Knowledge Proofs of Non-Membership.
IACR Cryptol. ePrint Arch., 2015

New Techniques for SPHFs and Efficient One-Round PAKE Protocols.
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
Algorithms for Outsourcing Pairing Computation.
Proceedings of the Smart Card Research and Advanced Applications, 2014

Primitives et constructions en cryptographie asymétrique.
, 2014

2013
Short blind signatures.
J. Comput. Secur., 2013

Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks.
IACR Cryptol. ePrint Arch., 2013

New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2013

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.
IACR Cryptol. ePrint Arch., 2013

Analysis and Improvement of Lindell's UC-Secure Commitment Schemes.
IACR Cryptol. ePrint Arch., 2013

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Time/Memory/Data Tradeoffs for Variants of the RSA Problem.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.
IACR Cryptol. ePrint Arch., 2012

Enumeration formula for (2, n)-cubes in discrete planes.
Discret. Appl. Math., 2012

Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Compact Round-Optimal Partially-Blind Signatures.
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

Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption.
IEEE Trans. Inf. Theory, 2011

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.
IACR Cryptol. ePrint Arch., 2011

Signatures on Randomizable Ciphertexts.
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

Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Time-selective convertible undeniable signatures with short conversion receipts.
Inf. Sci., 2010

Huff's Model for Elliptic Curves.
IACR Cryptol. ePrint Arch., 2010

Fair Blind Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2010

Batch Groth-Sahai.
IACR Cryptol. ePrint Arch., 2010

On The Broadcast and Validity-Checking Security of PKCS \#1 v1.5 Encryption.
IACR Cryptol. ePrint Arch., 2010

Mediated Traceable Anonymous Encryption.
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

Transferable Constant-Size Fair E-Cash.
IACR Cryptol. ePrint Arch., 2009

Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys.
Proceedings of the Public Key Cryptography, 2009

Fair E-Cash: Be Compact, Spend Faster.
Proceedings of the Information Security, 12th International Conference, 2009

Provably Secure Code-Based Threshold Ring Signatures.
Proceedings of the Cryptography and Coding, 2009

Adaptive-ID Secure Revocable Identity-Based Encryption.
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

Tracing Malicious Proxies in Proxy Re-encryption.
Proceedings of the Pairing-Based Cryptography, 2008

Separation Results on the "One-More" Computational Problems.
Proceedings of the Topics in Cryptology, 2008

Multi-use unidirectional proxy re-signatures.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Multi-designated verifiers signatures: anonymity without encryption.
Inf. Process. Lett., 2007

On Kabatianskii-Krouk-Smeets Signatures.
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

Trapdoor Permutation Polynomials of Z/ <i>n</i> Z and Public Key Cryptosystems.
Proceedings of the Information Security, 10th International Conference, 2007

Gradually Convertible Undeniable Signatures.
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
RSA-Based Secret Handshakes.
Proceedings of the Coding and Cryptography, International Workshop, 2005

Short Undeniable Signatures Without Random Oracles: The Missing Link.
Proceedings of the Progress in Cryptology, 2005

Time-Selective Convertible Undeniable Signatures.
Proceedings of the Topics in Cryptology, 2005

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log.
Proceedings of the Advances in Cryptology, 2005

Universally Convertible Directed Signatures.
Proceedings of the Advances in Cryptology, 2005

2004
Universal forgery on Sekhar's signature scheme with message recovery.
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

Multi-designated Verifiers Signatures.
Proceedings of the Information and Communications Security, 6th International Conference, 2004


  Loading...