Olivier Sanders

According to our database1, Olivier Sanders authored at least 34 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Practical Post-Quantum Signatures for Privacy.
IACR Cryptol. ePrint Arch., 2024

2023
Practical dynamic group signatures without knowledge extractors.
Des. Codes Cryptogr., March, 2023

Efficient Issuer-Hiding Authentication, Application to Anonymous Credential.
IACR Cryptol. ePrint Arch., 2023

Revisiting Preimage Sampling for Lattices.
IACR Cryptol. ePrint Arch., 2023

Lattice Signature with Efficient Protocols, Application to Anonymous Credentials.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Lattice-Based Signature with Efficient Protocols, Revisited.
IACR Cryptol. ePrint Arch., 2022

Pattern Matching in Encrypted Stream from Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2022

EPID with Efficient Proof of Non-Revocation.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Public Key Encryption with Flexible Pattern Matching.
IACR Cryptol. ePrint Arch., 2021

2020
EPID with Malicious Revocation.
IACR Cryptol. ePrint Arch., 2020

Improving Revocation for Group Signature with Redactable Signature.
IACR Cryptol. ePrint Arch., 2020

Lattice-Based E-Cash, Revisited.
IACR Cryptol. ePrint Arch., 2020

Curves with fast computations in the first pairing group.
IACR Cryptol. ePrint Arch., 2020

Group Signature Without Random Oracles from Randomizable Signatures.
Proceedings of the Provable and Practical Security - 14th International Conference, ProvSec 2020, Singapore, November 29, 2020

2019
Efficient Redactable Signature and Application to Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2019

Improved Secure Integer Comparison via Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2019

Divisible E-Cash from Constrained Pseudo-Random Functions.
IACR Cryptol. ePrint Arch., 2019

Divisible E-Cash from Constrained Pseudo-Random Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Short Group Signature in the Standard Model.
IACR Cryptol. ePrint Arch., 2018

Pattern Matching on Encrypted Streams.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Pattern Matching on Encrypted Streams: Applications to DPI and searches on genomic data.
IACR Cryptol. ePrint Arch., 2017

Reassessing Security of Randomizable Signatures.
IACR Cryptol. ePrint Arch., 2017

2016
Divisible e-cash made practical.
IET Inf. Secur., 2016

Trick or Tweak: On the (In)security of OTR's Tweaks.
IACR Cryptol. ePrint Arch., 2016

2015
Conception et Optimisation de Mécanismes Cryptographiques Anonymes. (Design and Improvements of Anonymous Cryptographic Primitives).
PhD thesis, 2015

Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash.
IACR Cryptol. ePrint Arch., 2015

Short Randomizable Signatures.
IACR Cryptol. ePrint Arch., 2015

Scalable Divisible E-cash.
IACR Cryptol. ePrint Arch., 2015

Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting.
IACR Cryptol. ePrint Arch., 2015

2014
Forward Secure Non-Interactive Key Exchange.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Direct Anonymous Attestations with Dependent Basename Opening.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

Delegating a Pairing Can Be Both Secure and Efficient.
Proceedings of the Applied Cryptography and Network Security, 2014

2013
Toward Generic Method for Server-Aided Cryptography.
Proceedings of the Information and Communications Security - 15th International Conference, 2013

2012
Efficient Group Signatures in the Standard Model.
IACR Cryptol. ePrint Arch., 2012


  Loading...