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.

Citations

601	A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
453	Theory and applications of trapdoor functions - Yao - 1982
350	How to play any mental game - Goldreich, Micali, et al. - 1987
264	Minimum Disclosure Proofs of Knowledge - Brassard, Chaum, et al. - 1988
147	A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract - Goldreich, Micali, et al. - 1986
65	Coin Flipping by Telephone - Blum - 1982
56	A class of constructive asymptotically good algebraic codes - JUSTESEN - 1972
49	Pseudorandom Generation under Uniform Assumptions - H˚astad - 1990
21	How to Prove Yourself - Fiat, Shamir - 1986
6	de Graaf, Multiparty Computations Ensuring Secrecy of each - Chaum, Damgard, et al. - 1987
4	One-way functions are essential to computational based cryptography - Impagliazzo, Luby - 1989
1	Simple non-interactive zero-knowledge proofs, Crypto 89 - Kilian, Micali, et al.