Wikipedia Article of the Day
Randomly selected articles from my personal browsing history
A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with the ability to reveal the committed value later. Commitment schemes are designed so that a party cannot change the value or statement after they have committed to it: that is, commitment schemes are binding. Commitment schemes have important applications in a number of cryptographic protocols including secure coin flipping, zero-knowledge proofs, and secure computation. A way to visualize a commitment scheme is to think of a sender as putting a message in a locked box, and giving the box to a receiver. The message in the box is hidden from the receiver, who cannot open the lock themselves. Since the receiver has the box, the message inside cannot be changed—merely revealed if the sender chooses to give them the key at some later time. Interactions in a commitment scheme take place in two phases: the commit phase during which a value is chosen and committed to the reveal phase during which the value is revealed by the sender, then the receiver verifies its authenticity In the above metaphor, the commit phase is the sender putting the message in the box, and locking it. The reveal phase is the sender giving the key to the receiver, who uses it to open the box and verify its contents. The locked box is the commitment, and the key is the proof. In simple protocols, the commit phase consists of a single message from the sender to the receiver. This message is called the commitment. It is essential that the specific value chosen cannot be extracted from the message by the receiver at that time (this is called the hiding property). A simple reveal phase would consist of a single message, the opening, from the sender to the receiver, followed by a check performed by the receiver. The value chosen during the commit phase must be the only one that the sender can compute and that validates during the reveal phase (this is called the binding property). The concept of commitment schemes was perhaps first formalized by Gilles Brassard, David Chaum, and Claude Crépeau in 1988, as part of various zero-knowledge protocols for NP, based on various types of commitment schemes. But the concept was used prior to that without being treated formally. The notion of commitments appeared earliest in works by Manuel Blum, Shimon Even, and Adi Shamir et al. The terminology seems to have been originated by Blum, although commitment schemes can be interchangeably called bit commitment schemes—sometimes reserved for the special case where the committed value is a bit. Earlier to that, commitment via one-way hash functions was considered, e.g., as part of, say, Lamport signature, the original one-time one-bit signature scheme.
History
Jul 17
Bit error rate
Jul 16
Kullback–Leibler divergence
Jul 15
Mary Schmich
Jul 14
Regression testing
Jul 13
Wasserstein metric
Jul 12
Block cipher mode of operation
Jul 11
Wireless
Jul 10
Birds Aren't Real
Jul 9
Hyperacusis
Jul 8
Rip current
Jul 7
Primitive recursive function
Jul 6
Sudan function
Jul 5
Meow Mix
Jul 4
Tulsi Gabbard
Jul 3
AsciiDoc
Jul 2
Northwest Ordinance
Jul 1
Phylum
Jun 30
Taxonomic rank
Jun 29
Robbie (TV series)
Jun 28
Gödel's Loophole
Jun 27
Survival function
Jun 26
Commitment scheme
Jun 25
Lighthouse of Alexandria
Jun 24
Limonene
Jun 23
United States Department of Energy
Jun 22
PETSCII
Jun 21
The Game (mind game)
Jun 20
Audie Murphy
Jun 19
Base64
Jun 18
Isaac Saul