Cryptology City

Cryptology City
Home

❯

Reductions

❯

Extractable PCS ⇒ PCS

Nov 21, 2026

Extractable PCS ⇒ PCS

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

Statement

Every extractable polynomial commitment scheme is a polynomial commitment scheme: an extractable PCS is a succinct, perfectly correct and evaluation-binding scheme that also meets the extractability, verification-time and field-size requirements, so the same algorithms meet the base notion with the same evaluation-binding advantage — folklore.


Graph View

  • Extractable PCS ⇒ PCS
  • Statement

Backlinks

  • Polynomial commitment scheme

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky