Cryptology City

Cryptology City
Home

❯

Reductions

❯

NIZK proofs with a common random string ⇒ NIZK

Oct 20, 2026

NIZK proofs with a common random string ⇒ NIZK

Fully-black-box reduction · CRS model · folklore · security loss: none

Statement

A NIZK proof in the common random string model is a NIZK proof system whose reference string happens to be uniform, so it meets every requirement of the general notion — folklore.


Graph View

  • NIZK proofs with a common random string ⇒ NIZK
  • Statement

Backlinks

  • Non-interactive zero-knowledge

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky