| Unidirectional chosen-ciphertext secure proxy re-encryption B Libert, D Vergnaud Public Key Cryptography–PKC 2008: 11th International Workshop on Practice …, 2008 | 429 | 2008 |
| Adaptive-ID secure revocable identity-based encryption B Libert, D Vergnaud Topics in Cryptology–CT-RSA 2009: The Cryptographers’ Track at the RSA …, 2009 | 221 | 2009 |
| Discrete-log-based signatures may not be equivalent to discrete log P Paillier, D Vergnaud Advances in Cryptology-ASIACRYPT 2005: 11th International Conference on the …, 2005 | 204 | 2005 |
| Designated verifier signatures: Anonymity and efficient construction from any bilinear map F Laguillaumie, D Vergnaud Security in Communication Networks, 105-119, 2005 | 195 | 2005 |
| Security analysis of pseudo-random number generators with input: /dev/random is not robust Y Dodis, D Pointcheval, S Ruhault, D Vergnaud, D Wichs Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013 | 152 | 2013 |
| Multi-use unidirectional proxy re-signatures B Libert, D Vergnaud Proceedings of the 15th ACM conference on Computer and communications …, 2008 | 150 | 2008 |
| Unidirectional chosen-ciphertext secure proxy re-encryption B Libert, D Vergnaud IEEE Transactions on Information Theory 57 (3), 1786-1802, 2011 | 147 | 2011 |
| Multi-designated verifiers signatures F Laguillaumie, D Vergnaud Information and Communications Security: 6th International Conference, ICICS …, 2004 | 140 | 2004 |
| New techniques for SPHFs and efficient one-round PAKE protocols F Benhamouda, O Blazy, C Chevalier, D Pointcheval, D Vergnaud Annual Cryptology Conference, 449-475, 2013 | 139 | 2013 |
| Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security B Hemenway, B Libert, R Ostrovsky, D Vergnaud Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011 | 120 | 2011 |
| Huff’s model for elliptic curves M Joye, M Tibouchi, D Vergnaud Algorithmic Number Theory: 9th International Symposium, ANTS-IX, Nancy …, 2010 | 119 | 2010 |
| Tracing malicious proxies in proxy re-encryption B Libert, D Vergnaud Pairing 8, 332-353, 2008 | 115 | 2008 |
| Signatures on randomizable ciphertexts O Blazy, G Fuchsbauer, D Pointcheval, D Vergnaud Public Key Cryptography–PKC 2011: 14th International Conference on Practice …, 2011 | 99 | 2011 |
| Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model. B Libert, D Vergnaud CANS 9, 498-517, 2009 | 97 | 2009 |
| Randomness complexity of private circuits for multiplication S Belaïd, F Benhamouda, A Passelègue, E Prouff, A Thillard, D Vergnaud Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 95 | 2016 |
| Transferable constant-size fair e-cash G Fuchsbauer, D Pointcheval, D Vergnaud Cryptology and Network Security: 8th International Conference, CANS 2009 …, 2009 | 91 | 2009 |
| Batch Groth–Sahai O Blazy, G Fuchsbauer, M Izabachene, A Jambert, H Sibert, D Vergnaud International Conference on Applied Cryptography and Network Security, 218-235, 2010 | 81 | 2010 |
| Separation results on the “one-more” computational problems E Bresson, J Monnerat, D Vergnaud Topics in Cryptology–CT-RSA 2008: The Cryptographers’ Track at the RSA …, 2008 | 64 | 2008 |
| Towards black-box accountable authority IBE with short ciphertexts and private keys B Libert, D Vergnaud Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009 | 60 | 2009 |
| Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions C Chevalier, F Laguillaumie, D Vergnaud Algorithmica 83 (1), 72-115, 2021 | 58 | 2021 |
David PointchevalSenior CNRS Researcher in Computer Science, Ecole Normale Superieure/PSL University, InriaVerified email at ens.fr
