Sankar Basu
Journal of the Franklin Institute
We show how a pseudorandom 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 pseudorandom generators suffices to assure amortized O(1) bits of communication per bit commitment. © 1991 International Association for Cryptologic Research.
Sankar Basu
Journal of the Franklin Institute
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology