Abstract
The standard definition of digital signatures allows a document to have many valid signatures. In this paper, we consider a subclass of digital signatures, called invariant signatures, in which all legal signatures of a document must be identical according to some polynomial-time computable function (of a signature) which is hard to predict given an unsigned document. We formalize this notion and show its equivalence to non-interactive zero-knowledge proofs.
This research was supported in part by NSF-FAW CCR-9023313, NSF-PYI CCR-865727, Darpa N0014-89-J-1988, BSF 89-00312.
Supported by NSF Postdoctoral Fellowship. Parts of this work were done at MIT, Bellcore and IBM T.J. Watson Research Center.
Chapter PDF
References
Blum M., and S. Micali “How to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits” SIAM J. on Computing, Vol 13, 1984, pp. 850–864, FOCS 1982.
Bellare, M., and S. Micali “How to Sign Given Any Trapdoor Function” STOC 88.
Blum M., P. Feldman, and S. Micali, “Non-interactive zero-knowledge proofs and their applications,” Proceedings of the 20th STOC, ACM, 1988.
Blum M., A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero-Knowledge” SIAM J. Comp. 91
M. Bellare, S. Goldwasser “New Paradigms for digital signatures and Message Authentication based on Non-Interactive Zero Knowledge Proofs” Crypto 89 proceedings, pp. 194–211
Bellare, Yung, “Certifying Cryptographic Tools: The Case of Trapdoor Permutations” CRYPTO-92 proceedings.
De Santis, A., S. Micali and G. Persiano, “Non-Interactive Zero Knowledge Proof Systems,” CRYPTO-87
De Santis, A., S. Micali and G. Persiano, “Bounded-Interaction Zero-Knowledge proofs,” CRYPTO-88.
W. Diffie, M. Hellman, “New directions in cryptography”, IEEE Trans. on Inf. Theory, IT-22, pp. 644–654, 1976.
Even S., O. Goldreich and S. Micali“On-line/Off-line Digital Signatures” CRYPTO 89.
Feige, U., D. Lapidot and A. Shamir, “Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String”, Proc. IEEE Symp. on Foundations of Computer Science, 1990.
Goldreich O., “Two remarks Concerning the GMR Signature Scheme” MIT Tech. Report 715, 1986.
Goldreich O., S. Goldwasser and S. Micali “How to Construct Random Functions” JASM V. 33 No 4. (October 1986) pp. 792–807.
Goldreich, O., and L. Levin “A Hard-Core Predicate for all One-Way Functions” Proc. 21st STOC, 1989, pp.25–32.
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.)
Goldwasser, S., 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., S. Micali and A. Yao, “Strong Signature Schemes” STOC 83, pp.431–439.
Hastad, J., “Pseudo-Random Generators under Uniform Assumptions”, STOC 90.
R. Impagliazzo and M. Luby, “One-way Functions are Essential for Complexity-Based Cryptography” FOCS 89.
R. Impagliazzo and S. Rudich, “On the Limitations of certain One-Way Permutations”, Proc. ACM Symp. on Theory of Computing, pp 44–61, 1989.
R. Impagliazzo, R., L. Levin, and M. Luby “Pseudo-Random Generation from One-Way Functions,” STOC 89.
J. Kilian, S. Micali, R. Ostrovsky “Minimum Resource Zero-Knowledge Proofs”, FOCS-89.
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.
R. Ostrovsky, A. Wigdeson, “One-Way Functions are Essential for Non-Trivial Zero-Knowledge”, preliminary draft.
Rivest, R.L., Shamir, A. and Adleman, L., “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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldwasser, S., Ostrovsky, R. (1993). Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive