Skip to content
Algorithm Atlas
CryptographyAll categories
CoreSource checked

Commit-Reveal Scheme

Commit-Reveal Scheme binds a value while hiding it until it is opened.

Explore relationshipsOpen constellationBrowse atlas

Quick Facts

Compact metadata for implementation and discovery.

Category
Cryptography
Difficulty
Intermediate
Family
Commitment Scheme
Tier
Core
Status
Verified
Review
Source Checked
Sources
1
Formulas
0
Relationships
1
Code example
Ready
Visualization
Ready

Overview

Commit-Reveal Scheme is a cryptographic method that protects confidentiality, authenticity, or integrity with a defined primitive or protocol step. It should be used only as part of a well-defined protocol with correct parameters and key handling.

Core Concepts

key materialsecurity parameterverification ruleverification

Quick facts

Complexity

Runtime and memory behavior at a glance.

Best

O(n)

Average

O(n)

Worst

O(n)

Space

O(1)

When to Use

  • Use Commit-Reveal Scheme only when the protocol calls for this specific primitive or construction.
  • Use it when a vetted implementation is available and parameter handling can be enforced.

When Not to Use

  • Avoid custom protocol combinations around this primitive.
  • Avoid when nonce, key, padding, or parameter requirements cannot be enforced.

What It Does

  • Computes commitment scheme within Commitment Scheme workloads (O(n) time, O(1) space).
  • Works by It should be used only as part of a well-defined protocol with correct parameters and key handling.
  • Maintains key invariants across key material, security parameter, verification rule.

Use Cases

  • Secure communication
  • Authentication
  • Key management

Inputs

  • Message or secret
  • Key material
  • Nonce, salt, or public parameters

Outputs

  • Ciphertext, tag, key, signature, or proof
  • Verification result

Pseudocode

  1. 1.Validate keys, nonces, and required parameters
  2. 2.Apply the primitive's block, group, hash, or verification operation
  3. 3.Combine intermediate values according to the construction
  4. 4.Return the ciphertext, tag, key, signature, proof, or verification result

Canonical Example

Input
message = 'pay 10', key material = provided, nonce or public parameters = provided
Output
protected value or verification result
Explanation
Commit-Reveal Scheme applies its defined cryptographic operation without inventing extra protocol steps.

Implementation Notes

  • Use vetted implementations for low-level primitives.
  • Validate parameter lengths, nonce handling, and authentication failure behavior explicitly.

Common Pitfalls

  • Reusing nonces, salts, or ephemeral values can break security assumptions.
  • Treating a primitive as a full protocol invites key-management and authentication mistakes.

Interactive Mechanism Walkthrough

Graph Frontier & Edge Relaxation

Show messages, keys, nonces, and verification values moving through the cryptographic construction.

Commit-Reveal Scheme mechanism walkthrough step 1 of 4suvwxt
Step 1 of 4: Validate keys, nonces, and required parameters
crypto

Notes

Commit-Reveal Scheme operates in O(n) time and O(1) space within the Commitment Scheme family. Often compared with SHA-256 and Pedersen Commitment.

Sources (1)

What each reference supports for this entry.

A Graduate Course in Applied Cryptography

Book

Cryptography reference for commitment schemes, hiding/binding behavior, and hash-based commit-reveal protocols.

Open source

Explore Next

Good next jumps from the relationship graph, ranked for useful discovery.

Open discoveryOpen map
Conceptual neighborSHA-256

Cryptography · Foundation

Commit-Reveal Scheme and SHA-256 address nearby cryptography problems but make different implementation tradeoffs.

Compare with this

Relationships

View full relationship page
Conceptual neighborSHA-256

Commit-Reveal Scheme and SHA-256 address nearby cryptography problems but make different implementation tradeoffs.

Related Algorithms

SHA-256Pedersen CommitmentZero-Knowledge ProofAESHMAC

Tags

CryptographySecurityHash FunctionProof