Olivier Sanders

Orcid: 0000-0003-1283-7257

According to our database1, Olivier Sanders authored at least 40 papers between 2012 and 2025.

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

2025
Fully dynamic group signatures from subset difference methods under simple assumptions.
Inf. Sci., 2025

Lattice EPID with Efficient Revocation.
IACR Cryptol. ePrint Arch., 2025

Improved Lattice Blind Signatures from Recycled Entropy.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Compact Issuer-Hiding Authentication, Application to Anonymous Credential.
Proc. Priv. Enhancing Technol., 2024

Worst-Case Lattice Sampler with Truncated Gadgets and Applications.
IACR Cryptol. ePrint Arch., 2024

Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets.
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

Practical Post-Quantum Signatures for Privacy.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

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

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

Pattern Matching in Encrypted Stream from Inner Product Encryption.
Proceedings of the Public-Key Cryptography - PKC 2023, 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

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
Practical Dynamic Group Signatures Without Knowledge Extractors.
IACR Cryptol. ePrint Arch., 2021

Improving Revocation for Group Signature with Redactable Signature.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

EPID with Malicious Revocation.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Public Key Encryption with Flexible Pattern Matching.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

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

Efficient Redactable Signature and Application to Anonymous Credentials.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Improved Secure Integer Comparison via Homomorphic Encryption.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

Curves with Fast Computations in the First Pairing Group.
Proceedings of the Cryptology and Network Security - 19th International Conference, 2020

Lattice-Based E-Cash, Revisited.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

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

Reassessing Security of Randomizable Signatures.
Proceedings of the Topics in Cryptology - CT-RSA 2018, 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

Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016
Short Randomizable Signatures.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Trick or Tweak: On the (In)security of OTR's Tweaks.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

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

Divisible E-Cash Made Practical.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Scalable Divisible E-cash.
Proceedings of the Applied Cryptography and Network Security, 2015

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

Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting.
Proceedings of the Public-Key Cryptography - PKC 2014, 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.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012


  Loading...