Separation Results on the "One-More" Computational Problems

Abstract : 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.
Type de document :
Communication dans un congrès
T. Malkin. Topics in cryptology - CT-RSA 2008, 2008, San Francisco, United States. Springer, 4964, pp.71-87, 2008, Lect. Notes Comput. Sci. 〈10.1007/978-3-540-79263-5_5〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00357754
Contributeur : Damien Vergnaud <>
Soumis le : dimanche 1 février 2009 - 18:36:46
Dernière modification le : mardi 24 avril 2018 - 17:20:10
Document(s) archivé(s) le : mardi 8 juin 2010 - 19:53:42

Fichiers

ct-rsa08.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

PSL

Citation

Emmanuel Bresson, Jean Monnerat, Damien Vergnaud. Separation Results on the "One-More" Computational Problems. T. Malkin. Topics in cryptology - CT-RSA 2008, 2008, San Francisco, United States. Springer, 4964, pp.71-87, 2008, Lect. Notes Comput. Sci. 〈10.1007/978-3-540-79263-5_5〉. 〈inria-00357754〉

Partager

Métriques

Consultations de la notice

200

Téléchargements de fichiers

125