User profiles for Olivier Sanders
Olivier SandersOrange Labs Verified email at orange.com Cited by 1035 |
Efficient redactable signature and application to anonymous credentials
O Sanders�- IACR International Conference on Public-Key�…, 2020 - Springer
Let us assume that Alice has received a constant-size signature on a set of messages $$\{m_i\}_{i=1}^n$$
from some organization. Depending on the situation, Alice might need to …
from some organization. Depending on the situation, Alice might need to …
Short randomizable signatures
D Pointcheval, O Sanders�- Topics in Cryptology-CT-RSA 2016: The�…, 2016 - Springer
Digital signature is a fundamental primitive with numerous applications. Following the
development of pairing-based cryptography, several taking advantage of this setting have been …
development of pairing-based cryptography, several taking advantage of this setting have been …
Improving revocation for group signature with redactable signature
O Sanders�- IACR International Conference on Public-Key�…, 2021 - Springer
Group signature is a major cryptographic tool allowing anonymous access to a service.
However, in practice, access to a service is usually granted for some periods of time, which …
However, in practice, access to a service is usually granted for some periods of time, which …
Reassessing security of randomizable signatures
D Pointcheval, O Sanders�- Cryptographers' Track at the RSA Conference, 2018 - Springer
The Camenisch-Lysyanskaya (CL) signature is a very popular tool in cryptography, especially
among privacy-preserving constructions. Indeed, the latter benefit from their numerous …
among privacy-preserving constructions. Indeed, the latter benefit from their numerous …
Divisible e-cash made practical
S Canard, D Pointcheval, O Sanders…�- …�International Workshop on�…, 2015 - Springer
Divisible E-cash systems allow users to withdraw a unique coin of value $$2^n$$ from a
bank, but then to spend it in several times to distinct merchants. In such a system, whereas …
bank, but then to spend it in several times to distinct merchants. In such a system, whereas …
Improved secure integer comparison via homomorphic encryption
Secure integer comparison has been one of the first problems introduced in cryptography,
both for its simplicity to describe and for its applications. The first formulation of the problem …
both for its simplicity to describe and for its applications. The first formulation of the problem …
Delegating a pairing can be both secure and efficient
S Canard, J Devigne, O Sanders�- …�, June 10-13, 2014. Proceedings 12, 2014 - Springer
Bilinear pairings have been widely used in cryptographic protocols since they provide very
interesting functionalities in regard of identity based cryptography, short signatures or …
interesting functionalities in regard of identity based cryptography, short signatures or …
Curves with fast computations in the first pairing group
R Clarisse, S Duquesne, O Sanders�- Cryptology and Network Security�…, 2020 - Springer
Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient
way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a …
way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a …
Pattern matching on encrypted streams
Pattern matching is essential in applications such as deep-packet inspection (DPI), searching
on genomic data, or analyzing medical data. A simple task to do on plaintext data, pattern …
on genomic data, or analyzing medical data. A simple task to do on plaintext data, pattern …
Efficient Issuer-Hiding Authentication, Application to Anonymous Credential
… Olivier Sanders. Efficient redactable signature and application to anonymous credentials. In
… Olivier Sanders. Improving revocation for group signature with redactable signature. In Juan …
… Olivier Sanders. Improving revocation for group signature with redactable signature. In Juan …