Mail:
olivier.sanders@orange.com
Phone:
Mobile phone:
Web page:
Advanced crypto for privacy
Pattern Matching in Encrypted Stream from Inner Product Encryption (PKC, 2023)
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials (CRYPTO, 2023)
EPID with Efficient Proof of Non-Revocation (Asia CCS, 2022)
Practical dynamic group signatures without knowledge extractors (Designs, Codes and Cryptography, 2022)
Public Key Encryption with Flexible Pattern Matching (ASIACRYPT, 2021)
EPID with Malicious Revocation (CT-RSA, 2021)
Improving Revocation for Group Signature with Redactable Signature (PKC, 2021)
Efficient Redactable Signature and Application to Anonymous Credentials (PKC, 2020)
Improved Secure Integer Comparison via Homomorphic Encryption (CT-RSA, 2020)
Curves with fast computations in the first pairing group (CANS, 2020)
Group Signature without Random Oracles from Randomizable Signatures (ProvSec, 2020)
Lattice-Based E-Cash, Revisited (ASIACRYPT, 2020)
Divisible E-Cash from Constrained Pseudo-Random Functions (ASIACRYPT, 2019)
Pattern Matching on Encrypted Streams (ASIACRYPT, 2018)
Reassessing Security of Randomizable Signatures (CT-RSA, 2018)
Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash (PKC, 2017)
Trick or Tweak : on the (In)security of OTR’s Tweaks (ASIACRYPT, 2016)
Divisible E-Cash Made Practical (IET Information Security, 2016)
Short Randomizable Signature (CT-RSA, 2016)
Divisible E-Cash Made Practical (PKC, 2015)
Scalable Divisible E-Cash (ACNS, 2015)
Direct Anonymous Attestation with Dependent Basename opening (CANS, 2014)
Forward Secure Non-Interactive Key Exchange (SCN, 2014)
Delegating a Pairing Can Be Both Secure and Efficient (ACNS, 2014)
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting (PKC, 2014)
Toward Generic Method for Server-Aided Cryptography (ICICS, 2013)