A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function

3Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a two-way Oblivious Pseudorandom Function (mOPRF) secure in the malicious model under the Decisional Composite Residuosity (DCR) and Decisional Diffie-Hellman (DDH) assumptions. Using this mOPRF, we construct an optimistic mutual Private Set Intersection (mPSI) protocol preserving fairness. Unlike existing optimistic protocols our mPSI supports semi-trusted arbiter instead of fully-trusted arbiter. Semi-trusted arbiter never get access to the private information of any of the parties while follow the protocol honestly. Our design is the first fair mPSI with linear communication and computation complexities, and is proven to be secure in the standard model against malicious parties under Decisional q-Diffie-Hellman Inversion (Dq-DHI), DCR and DDH assumptions.

Cite

CITATION STYLE

APA

Debnath, S. K., & Dutta, R. (2014). A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8949, pp. 343–359). Springer Verlag. https://doi.org/10.1007/978-3-319-15943-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free