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}
}
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
Oblivious Pseudorandom Functions from Isogenies
Fast Secure Computation of Set Intersection
Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices
A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
  • Carmit Hazay
  • Computer Science, Mathematics
  • Journal of Cryptology
  • 2017
Adaptive Oblivious Transfer and Generalization
Password-Protected Cryptosystems
Oblivious Transfer Based on NTRUEncrypt
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
Number-theoretic constructions of efficient pseudo-random functions
  • M. Naor, O. Reingold
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
Oblivious Polynomial Evaluation
Simulatable Adaptive Oblivious Transfer
Oblivious transfer and polynomial evaluation
Public Key Cryptography — PKC 2003
  • Y. Desmedt
  • Computer Science
  • Lecture Notes in Computer Science
  • 2002
Oblivious Transfer with Adaptive Queries
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Efficient Private Matching and Set Intersection
A Verifiable Random Function with Short Proofs and Keys
...
1
2
3
4
5
...