Pseudorandom Function

cryptography

Definition

Pseudorandom Function

A pseudorandom function (PRF) is a deterministic function $F:\{0,1{\}}^k\times \{0,1{\}}^n\to \{0,1{\}}^m$ that, for a uniformly random key $K\in \{0,1{\}}^k$, is computationally indistinguishable from a truly random function $f:\{0,1{\}}^n\to \{0,1{\}}^m$.

Formally, no probabilistic polynomial-time adversary can distinguish oracle access to $F_K(\cdot )$ from oracle access to $f(\cdot )$ with non-negligible advantage.