Olivier Sanders
Olivier Sanders
Orange Labs
Verified email at orange.com
Title
Cited by
Cited by
Year
Short randomizable signatures
D Pointcheval, O Sanders
Cryptographers’ Track at the RSA Conference, 111-126, 2016
1252016
Divisible e-cash made practical
S Canard, D Pointcheval, O Sanders, J Traoré
IET Information Security 10 (6), 332-347, 2016
422016
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
402014
Reassessing security of randomizable signatures
D Pointcheval, O Sanders
Cryptographers’ Track at the RSA Conference, 319-338, 2018
222018
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
162016
Forward secure non-interactive key exchange
D Pointcheval, O Sanders
International Conference on Security and Cryptography for Networks, 21-39, 2014
152014
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
132014
Pattern matching on encrypted streams
N Desmoulins, PA Fouque, C Onete, O Sanders
International Conference on the Theory and Application of Cryptology and …, 2018
12*2018
Scalable divisible e-cash
S Canard, D Pointcheval, O Sanders, J Traoré
International Conference on Applied Cryptography and Network Security, 287-306, 2015
112015
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
112013
Efficient group signatures in the standard model
L El Aimani, O Sanders
International Conference on Information Security and Cryptology, 410-424, 2012
92012
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
82017
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
82014
Efficient redactable signature and application to anonymous credentials
O Sanders
IACR International Conference on Public-Key Cryptography, 628-656, 2020
42020
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
42019
Group Signature without Random Oracles from Randomizable Signatures
R Clarisse, O Sanders
3*2020
Improved Secure Integer Comparison via Homomorphic Encryption
F Bourse, O Sanders, J Traoré
Cryptographers’ Track at the RSA Conference, 391-416, 2020
12020
Curves with fast computations in the first pairing group
R Clarisse, S Duquesne, O Sanders
2020
Searchable encryption method
O Sanders
US Patent App. 16/464,227, 2019
2019
Method and system for delegating calculation of a bilinear pairing value to a calculation server
S Canard, J Devigne, O Sanders
US Patent 10,122,530, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20