A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Paper
Bit commitment using pseudorandomness
Abstract
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.
Related
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008