# Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

@inproceedings{Jarecki2009EfficientOP,
title={Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection},
author={S. Jarecki and Xiaomin Liu},
booktitle={TCC},
year={2009}
}
• Published in TCC 2009
• Mathematics, Computer Science
An Oblivious Pseudorandom Function (OPRF) [15] is a two-party protocol between sender S and receiver R for securely computing a pseudorandom function f k (·) on key k contributed by S and input x contributed by R , in such a way that receiver R learns only the value f k (x ) while sender S learns nothing from the interaction. In other words, an OPRF protocol for PRF f k (·) is a secure computation for functionality $\mathcal F_{\mathsf{OPRF}}:(k,x)\rightarrow(\perp,f_k(x))$. We propose an… Expand
245 Citations

#### References

SHOWING 1-10 OF 42 REFERENCES
Number-theoretic constructions of efficient pseudo-random functions
• Mathematics, Computer Science
• Proceedings 38th Annual Symposium on Foundations of Computer Science
• 1997
Oblivious Polynomial Evaluation
• Mathematics, Computer Science
• SIAM J. Comput.
• 2006
• Computer Science
• EUROCRYPT
• 2007
Public Key Cryptography — PKC 2003
• Y. Desmedt
• Computer Science
• Lecture Notes in Computer Science
• 2002
Efficient Private Matching and Set Intersection
• Mathematics, Computer Science
• EUROCRYPT
• 2004
A Verifiable Random Function with Short Proofs and Keys
• Computer Science
• Public Key Cryptography
• 2005