Abstract
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously defined and satisfied, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the first complexity-based proof of security for blind signatures.
Part of this work was done while this author was at U.C. Berkeley under NSF Grant CCR-9505448.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.A. Brands. Untraceable Off-line Electronic Cash Based on Secret-key Certificates. Latin 95.
M. Bellare and S. Micali. “How to Sign Given Any Trapdoor Function”. STOC 88.
M. Bellare and S. Goldwasser. “New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs”. Crypto 89.
M. Bellare and P. Rogaway. “The Exact Security of Digital Signatures — How to Sign with RSA and Rabin”. Eurocrypt-96.
R. Canetti “De-mystifying Random Oracles” CRYPTO-97 (this proceedings).
D. Chaum. “Blind Signatures for Untraceable Payments”. Crypto-82.
D. Chaum, A. Fiat, and M. Naor. “Untraceable Electronic Cash”, Crypto-89.
C. Dwork and M. Naor. “An Efficient Existentially Unforgeable Signature Scheme and its Applications”. Crypto 94.
W. Diffie and M. Hellman. “New Directions in Cryptography”. IEEE Trans. on Inf. Theory, IT-22, pp. 644–654, 1976.
A. Fiat and A. Shamir. “How to Prove Yourself: Practical Solutions of Identification and Signature Problems, CRYPTO 86.
O. Goldreich. “Two Remarks Concerning the GMR Signature Scheme” MIT Tech. Report 715, 1986. CRYPTO 86.
O. Goldreich, S. Goldwasser, and S. Micali. “How to Construct Random Functions”. JASM V. 33 No 4. (October 1986) pp. 792–807.
S. Goldwasser, S. Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof-Systems”. SIAM J. Comput. 18 (1989), pp. 186–208; (also in STOC 85, pp. 291–304.)
O. Goldreich, S. Micali, and A. Wigderson. “How to Play Any Mental Game”. Proc. of 19th STOC, pp. 218–229, 1987.
S. Goldwasser, S. Micali, and R. Rivest. “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks”. SIAM Journal of Computing Vol. 17, No 2, (April 1988), pp. 281–308.
Goldwasser S., and R. Ostrovsky “Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent” CRYPTO 92.
L.C. Guillou and J.J. Quisquater. “A Practical Zero-Knowledge Protocol Fitter to Security Microprocessor Minimizing Both Transmission and Memory”. EUROCRYPT 88.
M. Naor. “Bit Commitment Using Pseudo-Randomness”. Crypto-89.
M. Naor and M. Yung. “Universal One-Way Hash Functions and their Cryptographic Applications”. STOC 89.
T. Okamoto. “Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes” CRYPTO 92.
D. Pointcheval and J. Stern. “Security Proofs for Signature Schemes”. Eurocrypt 96.
D. Pointcheval and J. Stern. “Provably Secure Blind Signature Schemes”. Asiacrypt 96.
R.L. Rivest, A. Shamir, and L. Adleman. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”. Comm. ACM, Vol 21, No 2, 1978.
J. Rompel. “One-way Functions are Necessary and Sufficient for Secure Signatures”. STOC 90.
C.P. Schnorr. “Efficient Identification and Signatures for Smart Cards”. CRYPTO 89.
A. C. Yao. “How to Generate and Exchange Secrets”. Proc. of 27th FOCS, 1986, pp. 162–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Juels, A., Luby, M., Ostrovsky, R. (1997). Security of blind digital signatures. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052233
Download citation
DOI: https://doi.org/10.1007/BFb0052233
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive