Yongjun Zhao
ABSTRACT
Private set-intersection (PSI) allows a client to only learn the intersection between his/her set C and the set S of another party, while this latter party learns nothing. We aim to enhance PSI in different dimensions, motivated by the use cases of increasingly popular online matchmaking --- Meeting "the one'' who possesses all desired qualities and free from any undesirable attributes may be a bit idealistic. In this paper, we realize over- (resp. below-) threshold PSI, such that the client learns the intersection (or other auxiliary private data) only when $|C \cap S| > t$ (resp. $łeq t$). The threshold corresponds to tunable criteria for (mis)matching, without marking all possible attributes as desired or not. In other words, the matching criteria are in a succinct form and the matching computation does not exhaust the whole universe of attributes. To the best of our knowledge, our constructions are the very first solution for these two open problems posed by Bradley etal. (SCN '16) and Zhao and Chow (PoPETS '17), without resorting to the asymptotically less efficient generic approach from garbled circuits. Moreover, we consider an "outsourced'' setting with a service provider coordinating the PSI execution, instead of having two strangers to be online simultaneously for running a highly-interactive PSI directly with each other. Outsourcing our protocols are arguably optimal --- the two users perform O(|C|) and O(1) decryptions, for unlocking the private set C and the outcome of matching.
- Aydin Abadi, Sotirios Terzis, and Changyu Dong. 2015. O-PSI: Delegated Private Set Intersection on Outsourced Datasets. In SEC 2015 . 3--17.Google Scholar
- Aydin Abadi, Sotirios Terzis, and Changyu Dong. 2016. VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets. In FC 2016 .Google Scholar
- Vikas G. Ashok and Ravi Mukkamala. 2014. A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. In DBSec 2014 . Google ScholarDigital Library
- Giuseppe Ateniese, Emiliano De Cristofaro, and Gene Tsudik. 2011. (If) Size Matters: Size-Hiding Private Set Intersection. In PKC 2011 . Google ScholarDigital Library
- Burton H. Bloom. 1970. Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM , Vol. 13, 7 (1970), 422--426. Google ScholarDigital Library
- Carlo Blundo, Emiliano De Cristofaro, and Paolo Gasti. 2014. EsPRESSO: Efficient privacy-preserving evaluation of sample set similarity. Journal of Computer Security , Vol. 22, 3 (2014), 355--381. Google ScholarDigital Library
- Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, and Yihui Tang. 2008. On the false-positive rate of Bloom filters. Inf. Process. Lett. , Vol. 108, 4 (2008), 210--213. Google ScholarDigital Library
- Tatiana Bradley, Sky Faber, and Gene Tsudik. 2016. Bounded Size-Hiding Private Set Intersection. In SCN 2016 . Google ScholarDigital Library
- Ran Canetti. 2000. Security and Composition of Multiparty Cryptographic Protocols. J. Cryptology , Vol. 13, 1 (2000), 143--202. Google ScholarDigital Library
- Xavier Carpent, Sky Faber, Tomas Sander, and Gene Tsudik. 2017. Private Set Projections & Variants. In WPES 2017 . Google ScholarDigital Library
- Michele Ciampi and Claudio Orlandi. 2018. Combining Private Set-Intersection with Secure Two-Party Computation. In SCN 2018 .Google Scholar
- Dana Dachman-Soled, Tal Malkin, Mariana Raykova, and Moti Yung. 2009. Efficient Robust Private Set Intersection. In ACNS 2009 . Google ScholarDigital Library
- Paolo D'Arco, Maria Isabel Gonzalez Vasco, Angel L. Pé rez del Pozo, and Claudio Soriente. 2012. Size-Hiding in Private Set Intersection: Existential Results and Constructions. In AFRICACRYPT 2012 . Google ScholarDigital Library
- Alex Davidson and Carlos Cid. 2017. An Efficient Toolkit for Computing Private Set Operations. In ACISP Part II 2017 .Google Scholar
- Sumit Kumar Debnath and Ratna Dutta. 2015. Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter. In ISC 2015 .Google Scholar
- Sumit Kumar Debnath and Ratna Dutta. 2016a. How to Meet Big Data When Private Set Intersection Realizes Constant Communication Complexity. In ICICS 2016 .Google ScholarCross Ref
- Sumit Kumar Debnath and Ratna Dutta. 2016b. Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter. In Inscrypt 2016 .Google Scholar
- Changyu Dong and Liqun Chen. 2014. A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost. In ESORICS 2014 .Google ScholarCross Ref
- Changyu Dong, Liqun Chen, and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In CCS 2013 . Google ScholarDigital Library
- Changyu Dong and Grigorios Loukides. 2017. Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity. IEEE Trans. Information Forensics and Security , Vol. 12, 11 (2017), 2792--2806.Google ScholarCross Ref
- Rolf Egert, Marc Fischlin, David Gens, Sven Jacob, Matthias Senker, and Jö rn Tillmanns. 2015. Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters. In ACISP 2015 .Google ScholarCross Ref
- Ellis Fenske, Akshaya Mani, Aaron Johnson, and Micah Sherr. 2017. Distributed Measurement with Private Set-Union Cardinality. In CCS 2017 . Google ScholarDigital Library
- Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004 .Google Scholar
- Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2, Basic Applications .Cambridge University Press. Google ScholarDigital Library
- Per A. Hallgren, Claudio Orlandi, and Andrei Sabelfeld. 2017. PrivatePool: Privacy-Preserving Ridesharing. In CSF 2017 .Google Scholar
- Carmit Hazay. 2015. Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. In TCC Part-II 2015 .Google Scholar
- Carmit Hazay and Kobbi Nissim. 2010. Efficient Set Operations in the Presence of Malicious Adversaries. In PKC 2010 . Google ScholarDigital Library
- Susan Hohenberger and Stephen A. Weis. 2006. Honest-Verifier Private Disjointness Testing Without Random Oracles. In PET 2006 . Google ScholarDigital Library
- Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS 2012 . http://www.internetsociety.org/private-set-intersection-are-garbled-circuits-better-custom-protocolsGoogle Scholar
- Roi Inbar, Eran Omri, and Benny Pinkas. 2018. Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. In SCN 2018 .Google ScholarDigital Library
- Ayman Jarrous and Benny Pinkas. 2009. Secure Hamming Distance Based Computation and Its Applications. In ACNS 2009 . Google ScholarDigital Library
- Christine Jost, Ha Lam, Alexander Maximov, and Ben J. M. Smeets. 2015. Encryption Performance Improvements of the Paillier Cryptosystem. IACR Cryptology ePrint Archive, Report 2015/864.Google Scholar
- Seny Kamara, Payman Mohassel, Mariana Raykova, and Seyed Saeed Sadeghian. 2014. Scaling Private Set Intersection to Billion-Element Sets. In FC 2014 .Google ScholarCross Ref
- Florian Kerschbaum. 2012a. Collusion-resistant outsourcing of private set intersection. In SAC 2012 . Google ScholarDigital Library
- Florian Kerschbaum. 2012b. Outsourced private set intersection using homomorphic encryption. In ASIACCS 2012 . Google ScholarDigital Library
- Á gnes Kiss, Jian Liu, Thomas Schneider, N. Asokan, and Benny Pinkas. 2017. Private Set Intersection for Unequal Set Sizes with Mobile Applications. PoPETs , Vol. 2017, 4 (2017), 177--197.Google Scholar
- Lea Kissner and Dawn Xiaodong Song. 2005. Privacy-Preserving Set Operations. In CRYPTO 2005 . Google ScholarDigital Library
- Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS 2016 . Google ScholarDigital Library
- Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. In CCS 2017 . Google ScholarDigital Library
- Yehuda Lindell, Kobbi Nissim, and Claudio Orlandi. 2013. Hiding the Input-Size in Secure Two-Party Computation. In ASIACRYPT 2013 .Google Scholar
- Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT 1999 . Google ScholarDigital Library
- Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security 2015 . https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/pinkas Google ScholarDigital Library
- Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. 2018. Efficient Circuit-Based PSI via Cuckoo Hashing. In EUROCRYPT 2018. 125--157.Google ScholarCross Ref
- Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX Security 2014 . https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/pinkas Google ScholarDigital Library
- Yongjun Zhao and Sherman S. M. Chow. 2017. Are you The One to Share? Secret Transfer with Access Structure. PoPETs , Vol. 2017, 1 (2017), 149--169.Google Scholar
- Yongjun Zhao and Sherman S. M. Chow. 2018. Can you find the one for me? Privacy-Preserving Matchmaking via Threshold PSI . IACR Cryptology ePrint Archive 2018/184. http://eprint.iacr.org/2018/184Google Scholar
Index Terms
- Can You Find The One for Me?
Recommendations
Linear Complexity Private Set Intersection for Secure Two-Party Protocols
Cryptology and Network SecurityAbstractIn this paper, we propose a new private set intersection (PSI) protocol with bi-oblivious data transfer that computes the following functionality. The two parties ( and ) input two sets of items (X and Y, respectively) and one of the parties (
Practical Threshold One-Time Proxy Signature Scheme
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications WorkshopsIn a (t, n) threshold proxy signature scheme, the original signer can delegate his power of signature to n proxy signers in a proxy group, and only at least t proxy signers can sign any message on behalf of the original signer; One-time proxy signature ...
Communication-Efficient Inner Product Private Join and Compute with Cardinality
ASIA CCS '23: Proceedings of the 2023 ACM Asia Conference on Computer and Communications SecurityPrivate join and compute (PJC) is a paradigm where two parties owing their private database securely join their databases and compute a function over the combined database. Inner product PJC, introduced by Lepoint et al. (Asiacrypt’21), is a class of ...
Comments