Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

Authors:
Shai Halevi
Affiliations:
-
Venue:
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Year:
1995

Citing 12
Cited 2

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The (true) complexity of statistical zero knowledge

STOC '90 Proceedings of the twenty-second 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)
On the existence of statistically hiding bit commitment schemes and fail-stop signatures

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment and Coin Tossing Protocols

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Language Dependent Secure Bit Commitment

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collision free hash functions and public key signature schemes

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

Designs, Codes and Cryptography
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of commitment schemes where the sender is bounded to polynomial time and the receiver may be all powerful. We present a scheme for committing to a (possibly long) string. Our scheme is efficient in the following three ways:ROUND EFFICIENCY: Each part of the scheme consists of a single round.Low COMMUNICATION: The number of bits required for the commitment equals the security parameter of the system, regardless of the length of the string which is being committed to.FAST IMPLEMENTATION: The time taken to commit to a string is linear in the length of the string and almost linear in the security parameter of the system.