Short Randomizable Signatures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Short Randomizable Signatures


Digital signature is a fundamental primitive with numerous applications. Following the development of pairing-based cryptography, several taking advantage of this setting have been proposed. Among them, the Camenisch-Lysyanskaya (CL) signature scheme is one of the most flexible and has been used as a building block for many other protocols. Unfortunately, this scheme suffers from a linear size in the number of messages to be signed which limits its use in many situations. In this paper, we propose a new signature scheme with the same features as CL-signatures but without the linear-size drawback: our signature consists of only two elements, whatever the message length, and our algorithms are more efficient. This construction takes advantage of using type 3 pairings, that are already widely used for security and efficiency reasons. We prove the security of our scheme without random oracles but in the generic group model. Finally, we show that protocols using CL-signatures can easily be instantiated with ours, leading to much more efficient constructions.
Fichier principal
Vignette du fichier
525.pdf (413.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01377997 , version 1 (08-10-2016)



David Pointcheval, Olivier Sanders. Short Randomizable Signatures. The Cryptographers' Track at the RSA Conference 2016, Feb 2016, San Francisco, United States. pp.111 - 126, ⟨10.1007/978-3-319-29485-8_7⟩. ⟨hal-01377997⟩
233 View
749 Download



Gmail Facebook Twitter LinkedIn More