Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter

The availability of electronic information is necessary in our everyday life. Progressively, often, data needs to be shared among the unreliable entities. In this field, one interesting and common problem occurs when two parties want to secretly determine the intersection or cardinality of intersection of their respective private sets. PSI or its variants are ideal to solve the aforementioned problems. Existing solutions of \(\mathsf{mPSI}\) and \(\mathsf{mPSI}\)-CA mainly use trusted third party to achieve fairness. However, in real life, the unconditional trust is fraught with security risks as the trusted third party may be unfaithful or corrupted. As a consequence, construction of an efficient \(\mathsf{mPSI}\)-CA preserving fairness remains a challenging problem. In this paper, we address this issue by employing an off-line third party, called arbiter, who is assumed to be semi-trusted in the sense that he does not have access to the private information of the entities while he will follow the protocol honestly. In this work, we design a construction of fair and efficient \(\mathsf{mPSI}\)-CA utilizing Bloom filter. Our \(\mathsf{mPSI}\)-CA is proven to be secure in the random oracle model (ROM) and achieves linear communication and computation overheads. A concrete security analysis is provided in malicious environments under the Decisional Diffie-Hellman (DDH) assumption.

[1]  Jan Camenisch,et al.  Efficient group signature schemes for large groups , 1997 .

[2]  Jung Hee Cheon,et al.  Mutual Private Set Intersection with Linear Complexity , 2011, WISA.

[3]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[4]  Ratna Dutta,et al.  Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries , 2015, ProvSec.

[5]  Felix Brandt,et al.  Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption , 2005, ICISC.

[6]  J. Camenisch,et al.  Proof systems for general statements about discrete logarithms , 1997 .

[7]  Mihir Bellare,et al.  On Defining Proofs of Knowledge , 1992, CRYPTO.

[8]  Jan Camenisch,et al.  Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.

[9]  Jan Camenisch,et al.  Private Intersection of Certified Sets , 2009, Financial Cryptography.

[10]  Jonathan Katz,et al.  Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? , 2012, NDSS.

[11]  Ronald Cramer,et al.  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[12]  Ratna Dutta,et al.  A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function , 2014, ICISC.

[13]  Dan Boneh,et al.  The Decision Diffie-Hellman Problem , 1998, ANTS.

[14]  Changyu Dong,et al.  When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.

[15]  Jun Furukawa.  Efficient and Verifiable Shuffling and Shuffle-Decryption , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[16]  Ratna Dutta,et al.  Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary , 2016, IACR Cryptol. ePrint Arch..

[17]  Benny Pinkas,et al.  Phasing: Private Set Intersection Using Permutation-based Hashing , 2015, USENIX Security Symposium.

[18]  Benny Pinkas,et al.  Faster Private Set Intersection Based on OT Extension , 2014, USENIX Security Symposium.

[19]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[20]  Alexandre V. Evfimievski,et al.  Information sharing across private databases , 2003, SIGMOD '03.

[21]  Ratna Dutta,et al.  Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter , 2015, ISC.

[22]  Jan Camenisch,et al.  Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.

[23]  Benny Pinkas,et al.  Efficient Set Intersection with Simulation-Based Security , 2014, Journal of Cryptology.

[24]  Emiliano De Cristofaro,et al.  Fast and Private Computation of Cardinality of Set Intersection and Union , 2012, CANS.

[25]  Ratna Dutta,et al.  Towards fair mutual private set intersection with linear complexity , 2016, Secur. Commun. Networks.

[26]  Jan Camenisch,et al.  Fair Private Set Intersection with a Semi-trusted Arbiter , 2013, IACR Cryptol. ePrint Arch..

[27]  Carmit Hazay.  Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs , 2015, TCC.

[28]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.