Publication
Journal of Cryptology
Paper

Bit commitment using pseudorandomness

Download paper

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.

Date

Publication

Journal of Cryptology

Authors

Topics

Resources

Share