Abstract
We show how a pseudo-random generator can provide a bit commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that the assumption of the existence of pseudo-random generators suffices to assure amortized O(1) bits of communication per bit commitment.
Part of this work done while author was at UC Berkeley. Research supported by NSF grant CCR 88 - 13632
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
M. Blum, Coin Flipping by Telephone, Proc. 24th IEEE Compcon, 1982, pp. 133–137.
M. Blum, S. Micali How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, Siam J. on Computing, vol 13, 1984, pp 850–864.
G. Brassard, D. Chaum, C. Crépeau, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences 37 (1988), pp. 156–189.
D. Chaum, I. Damgård and J. van de Graaf, Multiparty Computations Ensuring Secrecy of each Party’s Input and Correctness of the Output, Proc. of Crypto 87.
A. Fiat and A. Shamir, How to prove yourself, Proc. of Crypto 86, pp. 641–654.
O. Goldreich, S. Goldwasser and M. Micali, How to construct random functions, Journal of the ACM, vol 33, 1986, pp. 792–807.
O. Goldreich, M. Micali, A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. 27th Symposium on Foundations of Computer Science, 1986, pp 174–187.
O. Goldreich, M. Micali, A. Wigderson, How to play any mental game, Proc. 19th Symposium on Theory of Computing, 1987, pp. 218–229.
I. Impagliazzo and M. Luby, One-way functions are essential to computational based cryptography, Proc. 21st Symposium on Theory of Computing, 1989.
I. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989.
R. Impagliazzo and M. Yung, Direct Zero-Knowledge Protocols, Crypto 87.
J. Justesen, A class of constructive asymptotically good algebraic codes, IEEE trans. on Information theory 18 (1972) 652–656.
J. Kilian, S. Micali and R. Ostrovsky, Simple non-interactive zero-knowledge proofs, Crypto 89.
A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd Symposium on Foundations of Computer Science, 1982, pp 80–91.
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
Naor, M. (1990). Bit Commitment Using Pseudo-Randomness. 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_13
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_13
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