Random Oracle Model
The random oracle model (ROM) idealizes hash functions as truly random functions with public query access, and proves protocol security under this idealization.
Purpose
It provides provable-security evidence for protocols that resist standard-model proofs, a common analysis tool for signatures, encryption, and zero-knowledge proofs.
Mechanism
H is modeled as a random function: each new query returns a uniformly random value, repeated queries return the same value. After proving security in the ROM, H is instantiated with a concrete hash (e.g., SHA-256), and security heuristically relies on H’s randomness.
Use cases
- Signature security proofs
- Zero-knowledge proof analysis
- Encryption scheme design