Standard Model
The standard model refers to cryptographic security proofs that introduce no idealized assumptions (such as random oracles or ideal groups), relying only on computational-complexity assumptions (e.g., DDH, LWE).
Purpose
It provides stronger security guarantees than the random oracle model, avoiding the security degradation when idealized assumptions are instantiated.
Mechanism
Proofs in the standard model must rest on falsifiable assumptions such as DDH, CDH, and LWE, without idealizing hashes. The proofs are harder, but the security is stronger.
Use cases
- Strong security proofs
- Post-quantum scheme analysis
- Cryptographic theory