Function computed by two parties that emulates a random oracle
An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two parties cooperate to securely compute a pseudorandom function (PRF).[1]
An obliviouspseudorandomfunction (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two parties...
In cryptography, a pseudorandomfunction family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in...
confidentiality of the password. This can be done using an obliviouspseudorandomfunction to perform password-hardening. This can be done as alternative...
In cryptography, a verifiable random function (VRF) is a public-key pseudorandomfunction that provides proofs that its outputs were calculated correctly...
Management System (EKMS) Over-the-air rekeying Pseudorandomfunction family ObliviousPseudorandomFunction Public key infrastructure Turner, Dawn M. "What...
guarantees; for example, SHACAL, BEAR and LION. Pseudorandom number generators (PRNGs) can be built using hash functions. This is done by combining a (secret) random...
selection MAC; Intel, UNevada Reno, IBM, Technion, & UC Davis ObliviousPseudorandomFunction MD5 – one of a series of message digest algorithms by Prof...
High School, Chicago, Illinois, United States Obliviouspseudorandomfunction, a cryptographic function This disambiguation page lists articles associated...
An Oblivious RAM (ORAM) simulator is a compiler that transforms an algorithm in such a way that the resulting algorithm preserves the input-output behavior...
fundamental early work on public-key cryptosystems, pseudorandomfunctions, digital signatures, oblivious transfer, secure multiparty computation, and is...
conceptual similarities with a pseudorandom generator (PRG), but the two concepts are not identical. Both are functions that take as input a small, uniformly...
an unconditionally secure protocol for performing so-called oblivious transfer. Oblivious transfer, on the other hand, had been shown by Kilian to allow...
existence of a super-linear stretch pseudorandom generator in the function class NC0. (The existence of pseudorandom generators in NC0 (even with sub-linear...
functions, from which one function is chosen at random (and obliviously to the input). SWIFFT is not pseudorandom, due to linearity. For any function...
other hand, natural properties useful against P/poly would break strong pseudorandom generators. This is often interpreted as a "natural proofs" barrier for...
Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing, and other areas in...
Rakesh K. Sinha, T.S. Jayram (Washington) "Efficient Oblivious Branching Programs for Threshold Functions" Jeffrey C. Jackson (CMU) "An Efficient Membership-Query...
Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic...