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 …

Digital signature is a fundamental primitive with numerous applications. Following the
development of pairing-based cryptography, several taking advantage of this setting have been …

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 …

The Camenisch-Lysyanskaya (CL) signature is a very popular tool in cryptography, especially
among privacy-preserving constructions. Indeed, the latter benefit from their numerous …

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 …

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 …

Bilinear pairings have been widely used in cryptographic protocols since they provide very
interesting functionalities in regard of identity based cryptography, short signatures or …

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 …

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 …

… Olivier Sanders. Efficient redactable signature and application to anonymous credentials. In
… Olivier Sanders. Improving revocation for group signature with redactable signature. In Juan …