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. ==Formal definition==

Pseudorandom functions take inputs x\in\{0,1\}^*, where {}^* is the Kleene star. Both the input size I=|x| and output size \lambda depend only on the index size n:=|s|. A family of functions,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 f_s(x) given any s and x. • Let F_n be the distribution of functions f_s where s is uniformly distributed over \{0, 1\}^n, and let RF_n denote the uniform distribution over the set of all functions from \{0, 1\}^{I(n)} to \{0, 1\}^{\lambda(n)}. Then we require F_n and 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 F_n or RF_n, the advantage that she can tell apart which kind of oracle is given to her is negligible in n. ==Oblivious pseudorandom functions==

In an oblivious pseudorandom function, abbreviated OPRF, information is concealed from two parties that are involved in a PRF. 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. An OPRF is used in the Password Monitor functionality in Microsoft Edge. == Application ==

PRFs can be used for: • 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. • Constructing deterministic, memoryless authentication schemes (message authentication code based) which are provably secure against chosen message attack. • Distributing unforgeable ID numbers, which can be locally verified by stations that contain only a small amount of storage. • Constructing identification friend or foe systems. ==See also==