1990 | OriginalPaper | Chapter
Bit Commitment Using Pseudo-Randomness
Extended Abstract
Author : Moni Naor
Published in: Advances in Cryptology — CRYPTO’ 89 Proceedings
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.