| Short randomizable signatures D Pointcheval, O Sanders Cryptographers’ Track at the RSA Conference, 111-126, 2016 | 141 | 2016 |
| Divisible e-cash made practical S Canard, D Pointcheval, O Sanders, J Traoré IACR International Workshop on Public Key Cryptography, 77-100, 2015 | 53 | 2015 |
| Delegating a pairing can be both secure and efficient S Canard, J Devigne, O Sanders International Conference on Applied Cryptography and Network Security, 549-565, 2014 | 43 | 2014 |
| Reassessing security of randomizable signatures D Pointcheval, O Sanders Cryptographers’ Track at the RSA Conference, 319-338, 2018 | 26 | 2018 |
| Trick or tweak: On the (in) security of OTR’s tweaks R Bost, O Sanders International Conference on the Theory and Application of Cryptology and …, 2016 | 18 | 2016 |
| Pattern matching on encrypted streams N Desmoulins, PA Fouque, C Onete, O Sanders International Conference on the Theory and Application of Cryptology and …, 2018 | 16* | 2018 |
| Forward secure non-interactive key exchange D Pointcheval, O Sanders International Conference on Security and Cryptography for Networks, 21-39, 2014 | 16 | 2014 |
| Direct anonymous attestations with dependent basename opening N Desmoulins, R Lescuyer, O Sanders, J Traoré International Conference on Cryptology and Network Security, 206-221, 2014 | 15 | 2014 |
| Toward generic method for server-aided cryptography S Canard, I Coisel, J Devigne, C Gallais, T Peters, O Sanders International Conference on Information and Communications Security, 373-392, 2013 | 12 | 2013 |
| Scalable divisible e-cash S Canard, D Pointcheval, O Sanders, J Traoré International Conference on Applied Cryptography and Network Security, 287-306, 2015 | 11 | 2015 |
| Efficient group signatures in the standard model L El Aimani, O Sanders International conference on information security and cryptology, 410-424, 2012 | 9 | 2012 |
| Cut down the tree to achieve constant complexity in divisible E-cash D Pointcheval, O Sanders, J Traoré IACR International Workshop on Public Key Cryptography, 61-90, 2017 | 8 | 2017 |
| Efficient delegation of zero-knowledge proofs of knowledge in a pairing-friendly setting S Canard, D Pointcheval, O Sanders International Workshop on Public Key Cryptography, 167-184, 2014 | 8 | 2014 |
| Divisible e-cash from constrained pseudo-random functions F Bourse, D Pointcheval, O Sanders International Conference on the Theory and Application of Cryptology and …, 2019 | 6 | 2019 |
| Group Signature without Random Oracles from Randomizable Signatures R Clarisse, O Sanders International Conference on Provable Security, 3-23, 2020 | 5* | 2020 |
| Improved secure integer comparison via homomorphic encryption F Bourse, O Sanders, J Traoré Cryptographers’ Track at the RSA Conference, 391-416, 2020 | 5 | 2020 |
| Efficient redactable signature and application to anonymous credentials O Sanders IACR International Conference on Public-Key Cryptography, 628-656, 2020 | 4 | 2020 |
| Cryptographic method for group signature O Sanders US Patent App. 16/955,426, 2021 | | 2021 |
| Curves with fast computations in the first pairing group R Clarisse, S Duquesne, O Sanders International Conference on Cryptology and Network Security, 280-298, 2020 | | 2020 |
| Lattice-Based E-Cash, Revisited A Deo, B Libert, K Nguyen, O Sanders International Conference on the Theory and Application of Cryptology and …, 2020 | | 2020 |
David PointchevalSenior CNRS Researcher in Computer Science, Ecole Normale Superieure/PSL University, InriaAdresse e-mail validée de ens.fr
