Shared flowchart

Software · L5 · The Cryptographic Primitive Hierarchy

Sign in to clone

How one-way functions ground pseudorandomness, semantic security, and zero-knowledge, all tied together by reduction-based provable security.

by @openstemUpdated Software
One-way function (OWF): easy to compute, hard to invertPseudorandom generator (PRG): Blum–Micali–YaoPseudorandom function (PRF): GGM tree constructionSemantically secure (IND-CPA) encryptionCommitment schemesZero-knowledge proofs: completeness + soundness + ZKEvery NP language has a ZK proof (GMW 1986)Assumed-hard problem (factoring, discrete log)Error (1 - 1/|E|)^k → negligiblesecurity reductionsecurity reductionsoundness via repetition

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy