Commitment scheme

Known as: Cryptographic precommitment, Cryptographic commitment, Committed identity 
In cryptography, a commitment scheme allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with the ability… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present a statistically-hiding commitment scheme allowing commitment to arbitrary size integers, based on any (Abelian) group… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We combine well-known techniques from the areas of error-correcting codes and cryptography to achieve a new type of cryptographic… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We show that the existence of a statistically hiding bit commitment scheme with noninteractive opening and public verifiability… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Since the beginning of quantum cryptography [1, 20] the claim has always been that it can provide protocols that are… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present a very practical string-commitment scheme which is provably secure based solely on collision-free hashing. Our scheme… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Work on quantum cryptography was started by S. J. Wiesner in a paper written in about 1970, but remained unpublished until 1983… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Assume that a party, Alice, has a bit x in mind, to which she would like to be committed toward another party, Bob . That is… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when… (More)
Is this relevant?