Abstract
It has been proved earlier that the existence of bit commitment schemes (blobs) implies the existence of zero-knowledge proofs of information possession, which are MA-protocols (i.e. the verifier sends only independent random bits) [BrChCr], [GoMiWi].
In this paper we prove the converse result in a slightly modified form: We define a concept called weakly zero-knowledge, which is like ordinary zero-knowledge, except that we only require that an honest verifier learns nothing from the protocol. We then show that if, using an MA-protocol, P can prove to V in weakly zero-knowledge that he possesses a solution to some hard problem, then this implies the existence of a bit commitment scheme. If the original protocol is (almost) perfect zero-knowledge, then the resulting commitments are secure against an infinitely powerful receiver.
Finally, we also show a similar result for a restricted class of non-MA protocols.
Chapter PDF
Similar content being viewed by others
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
Abadi, Allender, Broder, Feigenbaum and Hemachandra: “On Generating Solved Instances of Computational Problems”, Proc. of CRYPTO 88, Springer.
Alexi, Chor, Goldreich, Schnorr: “RSA and Rabin Functions: Certain Parts are as Hard as the Whole”, Siam J. Compt., vol.17, no.2, 1988, pp.194–209.
Boyar, Krentel and Kurtz: “A Discrete Logarithm Implementation of Zero-knowledge Blobs”, Tech. Report, Dept. of Computer Science, University of Chicago, 1987.
Brassard: Modern Cryptology, Lecture Notes in Computer Science, vol.325, Springer-Verlag, 1988.
Brassard, Chaum, Crépeau: “Minimum Disclosure Proofs of Knowledge”, JCSS, vol.37, no.2, Oct. 1988, pp.156–189.
Chaum, Damgåd, van de Grad “Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result”, Proc. of Crypto 87.
Chaum, van de Graaf: “An Improved Protocol for Demonstrating possession of a Discrete Log”, Proc. of EuroCrypt 87.
Damgård: “The Application of Claw Free Functions in Cryptography”, PhD-Thesis, Aarhus University, Denmark, May 1988.
Fiege and Shamir: “Zero-Knowledge Proofs of Knowledge in Two Rounds”, these proceedings.
Fiat, Fiege, Shamir: “Zero-Knowledge Proof of Identity”, Proc. of STOC 87.
Feigenbaum, Lipton and Mahaney: “A Completeness Theorem for Almost-Everywhere Invulnerable Generators”, manuscript, AT& T Bell Labs. Tech. Memo, Febr. 89.
Goldreich and Levin: “A Hard-Core Predicate for all One-Way Functions”, Proc. of STOC 89, pp.25–32.
Goldwasser, Micali: “Probabilistic Encryption”, JCSS, vol 28, no 2, 1984, pp 270–299.
Goldwasser, Micali, Rackoff: “The Knowledge Complexity of Interactive Proof Systems”, Proc. of STOC 85, pp.291–304.
Goldreich, Micali, Wigderson: “Proof that Yield Nothing but the Validity of the Assertion, and the Methodology of Cryptographic Protocol Design”, Proc. of FOCS 86.
Goldreich, Micali and Wigderson: “How to Play any Mental Game”, Proc. of FOCS 87.
Kranakis: Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.
Naor: “Bit Commitment using Pseudo-Randomness”, these proceedings.
Tompa, Woll: “Random Self-Reducibility and Zero-Knowledge Proofs of Information Possession”, Proc. of FOCS 87.
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
Damgård, I.B. (1990). On the Existence of Bit Commitment Schemes and 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_3
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_3
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