Separation Results on the "One-More" Computational Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Separation Results on the "One-More" Computational Problems


In 2001, Bellare, Namprempre, Pointcheval and Semanko introduced the notion of "one-more" computational problems. Since their introduction, these problems have found numerous applications in cryptography. For instance, Bellare et al. showed how they lead to a proof of security for Chaum's RSA-based blind signature scheme in the random oracle model. In this paper, we provide separation results for the computational hierarchy of a large class of algebraic "one-more" computational problems (e.g. the one-more discrete logarithm problem, the one-more RSA problem and the one-more static Computational Diffie-Hellman problem in a bilinear setting). We also give some cryptographic implications of these results and, in particular, we prove that it is very unlikely, that one will ever be able to prove the unforgeability of Chaum's RSA-based blind signature scheme under the sole RSA assumption.
Fichier principal
Vignette du fichier
ct-rsa08.pdf (250.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00357754 , version 1 (01-02-2009)



Emmanuel Bresson, Jean Monnerat, Damien Vergnaud. Separation Results on the "One-More" Computational Problems. Topics in cryptology - CT-RSA 2008, 2008, San Francisco, United States. pp.71-87, ⟨10.1007/978-3-540-79263-5_5⟩. ⟨inria-00357754⟩
189 View
225 Download



Gmail Facebook Twitter LinkedIn More