Welcome to the resource topic for 2001/002
Title:
The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme
Authors: M. Bellare, C. Namprempre, D. Pointcheval, M. Semanko
Abstract:We introduce a new class of computational problems which we
call the one-more-RSA-inversion'' problems. Our main result is that two problems in this class, which we call the chosen-target and known-target inversion problems respectively, have polynomially-equivalent computational complexity. We show how this leads to a proof of security for Chaum's RSA-based blind signature scheme in the random oracle model based on the assumed hardness of either of these problems. We define and prove analogous results for one-more-discrete-logarithm’’ problems. Since the appearence of the
preliminary version of this paper, the new problems we have introduced
have found other uses as well.
ePrint: https://eprint.iacr.org/2001/002
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .