Pseudorandom function family

Known as: Pseudo-random function, Pseudorandom function 
In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2017
0102019862017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for a random key k ∈ K, the function F (k, ·) is… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We put forth the problem of delegating the evaluation of a pseudorandom function (PRF) to an untrusted proxy and introduce a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper, we introduce two new cryptographic primitives: functional digital signatures and functional pseudorandom functions… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
An Oblivious Pseudorandom Function (OPRF) [15] is a two-party protocol between sender S and receiver R for securely computing a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
We give the first construction of a practical threshold pseudorandom function. The protocol for evaluating the function is… (More)
Is this relevant?
1999
1999
Many cryptographic solutions based on pseudorandom functions (for common problems like encryption, message-authentication or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Pseudorandom function families are a powerful cryptographic primitive, yielding, in particular, simple solutions for the main… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Luby and Rackoff [26] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We describe a new approach for authenticating a message using a finite pseudorandom function (PRF). Our "XOR MACs" have several… (More)
Is this relevant?