| Unidirectional chosen-ciphertext secure proxy re-encryption B Libert, D Vergnaud International Workshop on Public Key Cryptography, 360-379, 2008 | 385 | 2008 |
| Adaptive-ID secure revocable identity-based encryption B Libert, D Vergnaud Cryptographers’ Track at the RSA Conference, 1-15, 2009 | 185 | 2009 |
| Designated verifier signatures: Anonymity and efficient construction from any bilinear map F Laguillaumie, D Vergnaud Security in Communication Networks, 105-119, 2005 | 173 | 2005 |
| Discrete-log-based signatures may not be equivalent to discrete log P Paillier, D Vergnaud International Conference on the Theory and Application of Cryptology and …, 2005 | 160 | 2005 |
| Unidirectional chosen-ciphertext secure proxy re-encryption B Libert, D Vergnaud IEEE Transactions on Information Theory 57 (3), 1786-1802, 2011 | 135 | 2011 |
| Multi-use unidirectional proxy re-signatures B Libert, D Vergnaud Proceedings of the 15th ACM conference on Computer and communications …, 2008 | 133 | 2008 |
| 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 | 131 | 2013 |
| Multi-designated verifiers signatures F Laguillaumie, D Vergnaud International Conference on Information and Communications Security, 495-507, 2004 | 130 | 2004 |
| Tracing malicious proxies in proxy re-encryption B Libert, D Vergnaud International Conference on Pairing-Based Cryptography, 332-353, 2008 | 112 | 2008 |
| 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 | 111 | 2013 |
| Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security B Hemenway, B Libert, R Ostrovsky, D Vergnaud International Conference on the Theory and Application of Cryptology and …, 2011 | 100 | 2011 |
| Huff’s model for elliptic curves M Joye, M Tibouchi, D Vergnaud International Algorithmic Number Theory Symposium, 234-250, 2010 | 87 | 2010 |
| Group signatures with verifier-local revocation and backward unlinkability in the standard model B Libert, D Vergnaud International Conference on Cryptology and Network Security, 498-517, 2009 | 87 | 2009 |
| Signatures on randomizable ciphertexts O Blazy, G Fuchsbauer, D Pointcheval, D Vergnaud International Workshop on Public Key Cryptography, 403-422, 2011 | 81 | 2011 |
| Transferable constant-size fair e-cash G Fuchsbauer, D Pointcheval, D Vergnaud International Conference on Cryptology and Network Security, 226-247, 2009 | 78 | 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 | 70 | 2010 |
| Randomness complexity of private circuits for multiplication S Belaïd, F Benhamouda, A Passelègue, E Prouff, A Thillard, D Vergnaud Annual International Conference on the Theory and Applications of …, 2016 | 64 | 2016 |
| Separation results on the “one-more” computational problems E Bresson, J Monnerat, D Vergnaud Cryptographers’ Track at the RSA Conference, 71-87, 2008 | 57 | 2008 |
| Towards black-box accountable authority IBE with short ciphertexts and private keys B Libert, D Vergnaud International Workshop on Public Key Cryptography, 235-255, 2009 | 54 | 2009 |
| RSA-based secret handshakes D Vergnaud International Workshop on Coding and Cryptography, 252-274, 2005 | 52 | 2005 |
Benoit LibertCNRS & ENS de Lyon (France)Adresse e-mail validée de ens-lyon.fr
