Name
Title | ||
|---|---|---|
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. |
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/s00145-002-0120-1 | Journal of Cryptology |
Keywords | Field | DocType |
inverse problem,blind signature,discrete logarithm problem,digital signature,digital cash,random oracle model,computational complexity | Electronic money,Computational problem,Inversion (meteorology),Algorithm,Random oracle,Digital signature,Theoretical computer science,Blind signature,Public-key cryptography,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
16.0 | 3.0 | 0933-2790 |
Citations | PageRank | References |
92 | 2.21 | 19 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihir Bellare | 1 | 16437 | 1481.16 |
| Chanathip Namprempre | 2 | 600 | 28.88 |
| David Pointcheval | 3 | 381 | 20.62 |
| Michael Semanko | 4 | 142 | 5.10 |
| dept d informatiquecnrs | 5 | 92 | 2.21 |
| ecole normale superieure | 6 | 368 | 13.33 |