Bit commitment using pseudo-randomness (extended abstract)

Authors:
Moni Naor
Affiliations:
-
Venue:
CRYPTO '89 Proceedings on Advances in cryptology
Year:
1989

Citing 8
Cited 7

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
How to construct random functions

Journal of the ACM (JACM)
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
How to simultaneously exchange secrets by general assumptions

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
On relationships between statistical zero-knowledge proofs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Using smartcards to secure a personalized gambling device

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

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 pseudorandom generators suffices to assure amortized O(1) bits of communication per bit commitment.