One-way permutations
A one-way permutation is an efficiently computable, length-preserving permutation of each that no efficient adversary inverts on a uniform input, except with negligible probability.
Syntax
A one-way permutation is a deterministic polynomial-time algorithm computing such that for every , the restriction is a permutation.
Properties
One-wayness
\begin{algorithm}
\algname{Game}
\caption{$\Game^{\mathrm{owp}}_{\pi,\calA}(\secpar)$}
\begin{algorithmic}
\State $x \getsr \bits^\secpar$
\State $\hat{x} \gets \calA(1^\secpar, \pi_\secpar(x))$
\Return $[\hat{x} = x]$
\end{algorithmic}
\end{algorithm}
A permutation is one-way if for all efficient ,
is negligible — Gol01. Hardness is on a uniform input over all of : for a one-way , the permutation of mapping to and fixing every other input is hard to invert on , yet it is the identity on a fraction of its domain, so it is not one-way — standard.
Other results
- OWP ⇒ OWF — folklore
- No fully black-box construction of OWP from length-increasing injective OWF — MM11a
Participates in
Builds on One-way permutations
- iO + OWP ⇒ CLS hardness
- iO + OWP ⇒ PPAD hardness
- OWP inversion ∈ NP ∩ coNP
- OWP ⇒ OWF
- OWP ⇒ PRG (Blum–Micali–Yao)
- OWP ⇒ Size-verifiable OWF
- OWP ⇒ Statistically hiding COM (NOVY)
- OWP ⇒ UOWHF (Naor–Yung)
Barriers
- No fully-black-box reduction from length-increasing injective OWF to OWP
- No fully-black-box reduction from iO + OWF to domain-invariant OWP
- No fully-black-box reduction from iO + OWP to CRHF
- No fully-black-box reduction from iO + OWP to average-case-hard SZK
- No deterministic reduction from NP to OWP
- No fully-black-box reduction from OWF to OWP
- No relativizing reduction from OWP to CRHF
- No relativizing reduction from OWP to KE