In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracleâ€¦Â (More)

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

- Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos, Thomas Zacharias
- ACM Conference on Computer and Communicationsâ€¦
- 2013

We put forth the problem of delegating the evaluation of a pseudorandom function (PRF) to an untrusted proxy and introduce aâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- Elette Boyle, Shafi Goldwasser, Ioana Ivan
- Public Key Cryptography
- 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

- Abhishek Banerjee, Chris Peikert, Alon Rosen
- EUROCRYPT
- 2011

We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learningâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Stanislaw Jarecki, Xiaomin Liu
- TCC
- 2009

An Oblivious Pseudorandom Function (OPRF) [15] is a two-party protocol between sender S and receiver R for securely computing aâ€¦Â (More)

Is this relevant?

2002

2002

- Jesper Buus Nielsen
- CRYPTO
- 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

- Mihir Bellare, Oded Goldreich, Hugo Krawczyk
- CRYPTO
- 1999

Many cryptographic solutions based on pseudorandom functions (for common problems like encryption, message-authentication orâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Mihir Bellare, Ran Canetti, Hugo Krawczyk
- FOCS
- 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

- Moni Naor, Omer Reingold
- Journal of Cryptology
- 1996

Luby and Rackoff [26] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method isâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Mihir Bellare, Roch GuÃ©rin, Phillip Rogaway
- CRYPTO
- 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?