Abstract
Using non-interactive zero knowledge proofs we provide a simple new para- digm for diǵital signing and message authentication secure against adaptive chosen message attack.
For digital signatures we require that the non-interactive zero knowledge proofs be publicly verifiable: they should be checkable by anyone rather than directed at a particular verifier. We accordingly show how to implement non- interactive zero knowledge proofs in a network which have the property that anyone in the network can individually check correctness while the proof is zero knowledge to any sufficiently small coalition. This enables us to implement signatures which are history independent.
Supported in part by NSF grant CCR-87-19689 and DARPA Contract N00014-89-J-1988
Supported in part by NSF grant CCR-86-57527, DARPA Contract N00014-89-J-1988, and by a US Israel binationaj grant
Chapter PDF
References
Bellaxe, M., and S. Micali, “How to Sign Given Any Trapdoor Function,” STOC 88.
Bellare, M., and S. Micali, “Non-Interactive Oblivious Transfer and Applications,” CRYPTO 89.
Blum, M., P. Feldman and S. Micali, “Non-Interactive Zero Knowledge and its Applications,” STOC 88.
Chaum, D. and H. Van Antwerpen, “Undeniable Signatures,” CRYPTO 89.
De Santis, A., G. Persiano and S. Micali, “Non-Interactive Zero Knowledge Proof Systems,” CRYPTO 87.
Even, S., O. Goldreich and S. Micali, “On-line/Off-line Digital Signatures,” CRYPTO 89.
Feige, U., personal communication, September 1989.
Feige, U. and A. Shamir, “Zero Knowledge Proofs of Knowledge in two Rounds,” CRYPTO 89.
Goldreich, O., “Two Remarks Concerning the GMR Signature Scheme,” MIT Laboratory for Computer Science Technical Report 715, (September 1986).
Goldwasser, S., and S. Micali, “Probabalistic Encryption,” Journal of Computer and System Sciences 28 (April 1984), 270–299.
Goldreich, O., S. Goldwasser, and S. Micali, “How To Construct Random Functions,” Journal of the Association for Computing Machinery, Vol. 33, No. 4 (October 1986), 792–807.
Goldwasser, S., S. Micali and R. Rivest, “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,” SIAM Journal on Computing, vol. 17, No. 2, (April 1988), 281–308.
Impagliazzo, R., L. Levin, and M. Luby, “Pseudo-Random Generation from One-Way Functions,” STOC 89.
Kilian, J., “Founding Cryptography on Oblivious Transfer,” STOC 88.
Kilian, J., S. Micali and R. Ostrovsky, “Efficient Zero Knowledge Proofs with Bounded Interaction,” CRYPTO 89.
Micali, S., personal communication, April 1989.
Micali, S., personal communication, August 1989.
Naor, M., “Bit Committment using Pseudo-Randomness,” CRYPTO 89.
Naor, M., and M. Yung, “Universal One-Way Hash Functions and their Cryptographic Applications,” STOC 89.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Goldwasser, S. (1990). New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_19
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_19
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive