Random function: Difference between revisions

Revision as of 18:08, 15 January 2014

Revision as of 16:03, 14 October 2016

Line 20:

==Applications==

Thus, a random function can be considered to map each input independently at random to any one of the possible outputs.{{clarify|date=February 2012}} Viewed this way it is an idealization of a [[cryptographic hash function]].

A random function is a useful building block in enabling [[cryptographic protocol]]s. However, there are scenarios where it is not possible for mutually distrustful parties to agree on a random function (i.e., [[coin flipping]] is impossible).<ref>{{Citationcite neededbook|last1=(ed.)|first1=Mihir Bellare|title=Advances in cryptology-CRYPTO 2000 : 20th annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000 : proceedings|date=December2000|publisher=Springer|___location=New York|isbn=978-3-540-67907-3|page=112-130|edition=[Elektronische 2011Ressource]}}</ref> Therefore, cryptographers study models which explicitly allow for the use of a random function or a related object. See [[random oracle model]], [[common reference string model]].

==Notes==