Pseudorandom function family

A PRF is an efficient (i.e. computable in polynomial time), deterministic function that maps two distinct sets (domain and range) and looks like a truly random function.

Essentially, a truly random function would just be composed of a lookup table filled with uniformly distributed random entries. However, in practice, a PRF is given an input string in the domain and a hidden random seed and runs multiple times with the same input string and seed, always returning the same value. Nonetheless, given an arbitrary input string, the output looks random if the seed is taken from a uniform distribution.

A PRF is considered to be good if its behavior is indistinguishable from a truly random function. Therefore, given an output from either the truly random function or a PRF, there should be no efficient method to correctly determine whether the output was produced by the truly random function or the PRF.

Pseudorandom functions take inputs ${\displaystyle x\in \{0,1\}^{*}}$. Both the input sixe ${\displaystyle I=|x|}$ and output size ${\displaystyle \lambda }$ depend only on the index size ${\displaystyle n:=|s|}$.

A family of functions,

${\displaystyle f_{s}:\left\{0,1\right\}^{I(n)}\rightarrow \left\{0,1\right\}^{\lambda (n)}}$

is pseudorandom if the following conditions are satisfied:

• There exists a polynomial-time algorithm that computes ${\displaystyle f_{s}(x)}$ given any ${\displaystyle s}$ and ${\displaystyle x}$.
• Let ${\displaystyle F_{n}}$ be the distribution of functions ${\displaystyle f_{s}}$ where ${\displaystyle s}$ is uniformly distributed over ${\displaystyle \{0,1\}^{n}}$, and let ${\displaystyle RF_{n}}$ denote the uniform distribution over the set of all functions from ${\displaystyle \{0,1\}^{I(n)}}$ to ${\displaystyle \{0,1\}^{\lambda (n)}}$. Then we require ${\displaystyle F_{n}}$ and ${\displaystyle RF_{n}}$ are computationally indistinguishable, where n is the security parameter. That is, for any adversary that can query the oracle of a function sampled from either ${\displaystyle F_{n}}$ or ${\displaystyle RF_{n}}$, the advantage that she can tell apart which kind of oracle is given to her is negligible in ${\displaystyle n}$.[3]

In an oblivious pseudorandom function, abbreviated OPRF, information is concealed from two parties that are involved in a PRF.[4] That is, if Alice cryptographically hashes her secret value, cryptographically blinds the hash to produce the message she sends to Bob, and Bob mixes in his secret value and gives the result back to Alice, who unblinds it to get the final output, Bob is not able to see either Alice's secret value or the final output, and Alice is not able to see Bob's secret input, but Alice sees the final output which is a PRF of the two inputs -- a PRF of Alice's secret and Bob's secret.[5] This enables transactions of sensitive cryptographic information to be secure even between untrusted parties.

An OPRF is used in some implementations of password-authenticated key agreement.[5]

An OPRF is used in the Password Monitor functionality in Microsoft Edge.[6]

PRFs can be used for:[7]

1. dynamic perfect hashing; even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the previous keys, the adversary can not force collisions.
2. Constructing deterministic, memoryless authentication schemes (message authentication code based) which are provably secure against chosen message attack.
3. Distributing unforgeable ID numbers, which can be locally verified by stations that contain only a small amount of storage.
4. Constructing identification friend or foe systems.

• Pseudorandom permutation

• Goldreich, Oded (2001). Foundations of Cryptography: Basic Tools. Cambridge: Cambridge University Press. ISBN 978-0-511-54689-1.
• Pass, Rafael, A Course in Cryptography (PDF), retrieved 22 December 2015