CRHF ⇒ Weak OWF
Statement
Let with be a collision-resistant family. Then is weakly one-way: an inverter succeeding with probability yields a collision finder succeeding with probability at least , so every efficient inverter succeeds with probability at most — folklore. If , the same bound makes one-way.
Sketch
The collision finder samples , runs the inverter on , and outputs . The inverter’s view depends on only through , so given a successful answer, with probability , whose expectation over is the number of images divided by , at most .
Notes
- One bit of compression does not make one-way. For a collision-resistant , let for and otherwise. Then compresses by one bit, and every collision of is a collision of , because the first branch is injective and the two branches have disjoint ranges; yet is inverted on every input beginning with , a quarter of them — standard.
- One-way functions follow from any collision-resistant family, by amplification: Weak OWF ⇒ OWF — Yao82a. Alternatively, Merkle–Damgård iteration gives a collision-resistant family with — Dam89 — and then itself is one-way.
- Bounds relating preimage, second-preimage and collision resistance as functions of the compression are in RS04.
- The converse has no relativizing proof: No relativizing reduction from OWP to CRHF — Sim98.