Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

Shai Halevi

Published Jan 1, 1995• 13 citations
Publisher
DOI
10.1007/3-540-44750-4_7

Related papers

Bounds on the Efficiency of “Black-Box” Commitment Schemes

Omer Horvitz, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2005•12 citations

Concurrent Nonmalleable Commitments

Rafael Pass, Alon Rosen

We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver, cannot make the values to which he commits depend on the values to which he receives commitments. Our result is achieved without assuming an a priori bound on the number of executions and without relying on any setup assumptions. Our construction relies on the existence of standard claw-free permutations and requires only a constant number of communication rounds.

SIAM Journal on Computing•Jan 1, 2008•32 citations

Concurrent Non-Malleable Commitments

Rafael Pass, Alon Rosen

We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver cannot make the values he commits to depend on the values he receives commitments to. Our result is achieved without assuming an a-priori bound on the number of executions and without relying on any set-up assumptions. Our construction relies on the existence of standard collision resistant hash functions and only requires a constant number of communication rounds.

Annual Symposium on Foundations of Computer Science•Nov 15, 2005•126 citations

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

Carlo Blundo, Barbara Masucci, Douglas R. Stinson +1 more

Designs Codes and Cryptography•Jun 1, 2002•31 citations

Constructions and Bounds for Unconditionally Secure Commitment Schemes.

Carlo Blundo, Barbara Masucci, Douglas R. Stinson +1 more

Commitment schemes have been extensively studied since they were introduced by Blum in 1982. Rivest recently showed how to construct unconditionally secure commitment schemes, assuming the existence of a trusted initializer. In this paper, we present a formal mathematical model for such schemes, and analyze their binding and concealing properties. In particular, we show that such schemes cannot be perfectly concealing: there is necessarily a small probability that Alice can cheat Bob by committing to one value but later revealing a dierent value. We prove several bounds on Alice's cheating probability, and present constructions of schemes that achieve optimal cheating probabilities. We also show a close link between commitment schemes and the classical \\ane resolvable designs". 1 Introduction Commitment schemes were rst introduced by Blum [2] in 1982. In a commitment scheme, there is a sender, Alice, and a receiver, Bob. The scheme consists of a commit protocol and a reveal protocol...

•Jan 1, 2000•0 citations

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•May 12, 2009•25 citations
We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver, cannot make the values to which he commits depend on the values to which he receives commitments. Our result is achieved without assuming an a priori bound on the number of executions and without relying on any setup assumptions. Our construction relies on the existence of standard claw-free permutations and requires only a constant number of communication rounds.
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver cannot make the values he commits to depend on the values he receives commitments to. Our result is achieved without assuming an a-priori bound on the number of executions and without relying on any set-up assumptions. Our construction relies on the existence of standard collision resistant hash functions and only requires a constant number of communication rounds.
Commitment schemes have been extensively studied since they were introduced by Blum in 1982. Rivest recently showed how to construct unconditionally secure commitment schemes, assuming the existence of a trusted initializer. In this paper, we present a formal mathematical model for such schemes, and analyze their binding and concealing properties. In particular, we show that such schemes cannot be perfectly concealing: there is necessarily a small probability that Alice can cheat Bob by committing to one value but later revealing a dierent value. We prove several bounds on Alice's cheating probability, and present constructions of schemes that achieve optimal cheating probabilities. We also show a close link between commitment schemes and the classical \\ane resolvable designs". 1 Introduction Commitment schemes were rst introduced by Blum [2] in 1982. In a commitment scheme, there is a sender, Alice, and a receiver, Bob. The scheme consists of a commit protocol and a reveal protocol...