The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme

The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme (2003)

Cached

Download Links

by M. Bellare , C. Namprempre , D. Pointcheval , M. Semanko

Venue:	Journal of Cryptology
Citations:	51 - 4 self

BibTeX

@ARTICLE{Bellare03theone-more-rsa-inversion,
    author = {M. Bellare and C. Namprempre and D. Pointcheval and M. Semanko},
    title = {The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme},
    journal = {Journal of Cryptology},
    year = {2003},
    volume = {16},
    pages = {185--215}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract We introduce a new class of computational problems which we call the "one-more-RSAinversion " 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.

Citations

1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
240	Approximate formulas for some functions of prime numbers - Rosser, Schoenfeld - 1962
227	Security arguments for digital signatures and blind signatures - Pointcheval, Stern
148	Collision-free accumulators and fail-stop signature schemes without trees - Baric, Pfitzmann - 1997
127	Signature schemes based on the strong RSA assumption - Cramer, Shoup
125	signatures for untraceable payments - Blind - 1982
118	T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations - Fujisaki, Okamoto - 1997
107	Twenty years of attacks on the RSA cryptosystem - Boneh - 1999
106	Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi, et al. - 1999
101	On the exact security of full domain hash - Coron - 2000
79	A “paradoxical” identity-based signature scheme resulting from zero-knowledge - Guillou, Quisquater - 1990
69	Identity escrow - Kilian, Petrank - 1998
63	Probably secure blind signature schemes - Pointcheval, Stern - 1996
49	GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks - Bellare, Palacio - 2002
45	Strong signature schemes - Goldwasser, Micali, et al. - 1983
39	The exact security of digital signatures—how to sign with RSA and Rabin - Bellare, Rogaway
33	Breaking RSA may not be equivalent to factoring - Boneh, Venkatesan
30	Security of Blind Digital Signatures - Juels, Luby, et al. - 1997
24	On computing the determinant and smith form of an integer matrix - Eberly, Giesbrecht, et al. - 2000
22	New public key cryptosystems based on the dependent — RSA problems - Pointcheval - 1999
20	Fast deterministic computation of determinants of dense matrices - Abbott, Bronstein, et al. - 1999
17	Transitive signatures based on factoring and RSA - Bellare, Neven - 2002
16	The power of RSA inversion oracles and the security of Chaum's RSA-based blind signature scheme - Bellare, Namprempre, et al. - 2001
14	The Security of Practical Two-Party RSA Signature Schemes 2001 [Online]. Available: http://www-cse.ucsd. edu/users/mihir/papers - Bellare, Sandhu
12	Strengthened security for blind signatures - Pointcheval - 1998
4	Algebra: An Approach Via Module Theory, volume 136 of Graduate Texts - Adkins, Weintraub - 1992
4	On the security of some variants of the RSA signature scheme - Michels, Stadler, et al. - 1998
1	Linear Algebra over Commutative Rings, volume 87 - McDonald - 1984