Site Navigation
Categories:
Cryptography
Cryptographic primitives
Articles with Alice and Bob explanations

Summary Of: Commitment scheme

A useful way to visualize a commitment scheme is to think of the sender as putting the value in a locked box... so if the commitment scheme is a good one... The interactions in a commitment scheme take place in two phases... scheme is simply a commitment scheme where the value chosen is a bit... A commitment scheme can either be perfectly binding... A better example of a perfectly binding commitment scheme is one where the commitment is the encryption of...

Encyclodia Page On: Commitment scheme

These Are Links To Other Documents
cryptography | cryptographic protocols | zero-knowledge proofs | secure computation | Alice and Bob | coin flipping | Gilles Brassard | David Chaum | Claude Crepeau | Manuel Blum | zero-knowledge proofs | verifiable secret sharing | secure multiparty computation | secret sharing | secure computation | one-way function | Goldreich-Levin theorem | hard-core predicate | cryptographically secure pseudorandom number generator | exclusive-or | group | discrete logarithm problem | discrete logarithm problem | IND-CPA | semantically secure | quantum cryptography | Schmidt decomposition | CRYPTO | Categories | Cryptography | Cryptographic primitives | Articles with Alice and Bob explanations |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Commitment scheme".