Injective OWF ⇒ Statistically binding COM

Fully-black-box reduction · standard model · folklore · security loss: polynomial: a hiding distinguisher with advantage gives an inverter with success probability polynomial in and , through the Goldreich–Levin inverter

Statement

For an injective one-way function , the non-interactive bit commitment with , opened by revealing , which always verifies, is perfectly binding and computationally hiding — folklore.

Sketch

Binding: determines , so the commitment determines . Hiding: is a hardcore predicate of — GL89 — so it is pseudorandom given .