research-article

Can You Find The One for Me?

Authors:

Sherman S.M. ChowAuthors Info & Claims

WPES'18: Proceedings of the 2018 Workshop on Privacy in the Electronic Society

Pages 54 - 65

https://doi.org/10.1145/3267323.3268965

Published: 15 January 2018 Publication History

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.

References

[1]

Aydin Abadi, Sotirios Terzis, and Changyu Dong. 2015. O-PSI: Delegated Private Set Intersection on Outsourced Datasets. In SEC 2015 . 3--17.

[2]

Aydin Abadi, Sotirios Terzis, and Changyu Dong. 2016. VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets. In FC 2016 .

[3]

Vikas G. Ashok and Ravi Mukkamala. 2014. A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. In DBSec 2014 .

Digital Library

[4]

Giuseppe Ateniese, Emiliano De Cristofaro, and Gene Tsudik. 2011. (If) Size Matters: Size-Hiding Private Set Intersection. In PKC 2011 .

Digital Library

[5]

Burton H. Bloom. 1970. Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM, Vol. 13, 7 (1970), 422--426.

Digital Library

[6]

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.

Digital Library

[7]

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.

Digital Library

[8]

Tatiana Bradley, Sky Faber, and Gene Tsudik. 2016. Bounded Size-Hiding Private Set Intersection. In SCN 2016 .

Digital Library

[9]

Ran Canetti. 2000. Security and Composition of Multiparty Cryptographic Protocols. J. Cryptology, Vol. 13, 1 (2000), 143--202.

Digital Library

[10]

Xavier Carpent, Sky Faber, Tomas Sander, and Gene Tsudik. 2017. Private Set Projections & Variants. In WPES 2017 .

Digital Library

[11]

Michele Ciampi and Claudio Orlandi. 2018. Combining Private Set-Intersection with Secure Two-Party Computation. In SCN 2018 .

[12]

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, and Moti Yung. 2009. Efficient Robust Private Set Intersection. In ACNS 2009 .

Digital Library

[13]

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 .

Digital Library

[14]

Alex Davidson and Carlos Cid. 2017. An Efficient Toolkit for Computing Private Set Operations. In ACISP Part II 2017 .

[15]

Sumit Kumar Debnath and Ratna Dutta. 2015. Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter. In ISC 2015 .

[16]

Sumit Kumar Debnath and Ratna Dutta. 2016a. How to Meet Big Data When Private Set Intersection Realizes Constant Communication Complexity. In ICICS 2016 .

[17]

Sumit Kumar Debnath and Ratna Dutta. 2016b. Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter. In Inscrypt 2016 .

[18]

Changyu Dong and Liqun Chen. 2014. A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost. In ESORICS 2014 .

Digital Library

[19]

Changyu Dong, Liqun Chen, and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In CCS 2013 .

Digital Library

[20]

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.

[21]

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 .

[22]

Ellis Fenske, Akshaya Mani, Aaron Johnson, and Micah Sherr. 2017. Distributed Measurement with Private Set-Union Cardinality. In CCS 2017 .

Digital Library

[23]

Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004 .

[24]

Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2, Basic Applications .Cambridge University Press.

Digital Library

[25]

Per A. Hallgren, Claudio Orlandi, and Andrei Sabelfeld. 2017. PrivatePool: Privacy-Preserving Ridesharing. In CSF 2017 .

[26]

Carmit Hazay. 2015. Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. In TCC Part-II 2015 .

[27]

Carmit Hazay and Kobbi Nissim. 2010. Efficient Set Operations in the Presence of Malicious Adversaries. In PKC 2010 .

Digital Library

[28]

Susan Hohenberger and Stephen A. Weis. 2006. Honest-Verifier Private Disjointness Testing Without Random Oracles. In PET 2006 .

Digital Library

[29]

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-protocols

[30]

Roi Inbar, Eran Omri, and Benny Pinkas. 2018. Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. In SCN 2018 .

Digital Library

[31]

Ayman Jarrous and Benny Pinkas. 2009. Secure Hamming Distance Based Computation and Its Applications. In ACNS 2009 .

Digital Library

[32]

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.

[33]

Seny Kamara, Payman Mohassel, Mariana Raykova, and Seyed Saeed Sadeghian. 2014. Scaling Private Set Intersection to Billion-Element Sets. In FC 2014 .

[34]

Florian Kerschbaum. 2012a. Collusion-resistant outsourcing of private set intersection. In SAC 2012 .

Digital Library

[35]

Florian Kerschbaum. 2012b. Outsourced private set intersection using homomorphic encryption. In ASIACCS 2012 .

Digital Library

[36]

Á 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.

[37]

Lea Kissner and Dawn Xiaodong Song. 2005. Privacy-Preserving Set Operations. In CRYPTO 2005 .

Digital Library

[38]

Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS 2016 .

Digital Library

[39]

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 .

Digital Library

[40]

Yehuda Lindell, Kobbi Nissim, and Claudio Orlandi. 2013. Hiding the Input-Size in Secure Two-Party Computation. In ASIACRYPT 2013 .

[41]

Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT 1999 .

Digital Library

[42]

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

Digital Library

[43]

Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. 2018. Efficient Circuit-Based PSI via Cuckoo Hashing. In EUROCRYPT 2018. 125--157.

[44]

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

Digital Library

[45]

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.

[46]

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/184

Cited By

Chow SZhao Y(2025)Secure Data Deduplication SchemesEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1562(2229-2231)Online publication date: 8-Jan-2025
https://doi.org/10.1007/978-3-030-71522-9_1562
Shi JHu CZhang SZhou QMei ZYao SDeng A(2024)An Efficient and Expressive Fully Policy-Hidden Ciphertext-Policy Attribute-Based Encryption Scheme for Satellite Service SystemsISPRS International Journal of Geo-Information10.3390/ijgi1309032113:9(321)Online publication date: 5-Sep-2024
https://doi.org/10.3390/ijgi13090321
Zhao SZhao CHuang YSong XXu Q(2024)Two-Party Threshold Private Set Intersection Protocols from Lightweight Cryptographic PrimitivesCryptography10.3390/cryptography80400588:4(58)Online publication date: 22-Dec-2024
https://doi.org/10.3390/cryptography8040058
Show More Cited By

Index Terms

Can You Find The One for Me?
1. Security and privacy
  1. Cryptography
  2. Security services

Recommendations

Linear Complexity Private Set Intersection for Secure Two-Party Protocols
Cryptology and Network Security
Abstract
In this paper, we propose a new private set intersection (PSI) protocol with bi-oblivious data transfer that computes the following functionality. The two parties ( $P_{1}$ and $P_{2}$ ) input two sets of items (X and Y, respectively) and one of the parties ( ${...}_{}$ $_{}_{}$ $_{}$ $_{}$ $_{} \overset{}{}$ $_{}$ $_{}$ $_{}$
Practical Threshold One-Time Proxy Signature Scheme
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops

In 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 ...
Covert two-party computation
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

We introduce covert two-party computation, a stronger notion of security than standard secure two-party computation. Like standard secure two-party computation, covert two-party computation allows Alice and Bob, with secret inputs x_A and x_B respectively,...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WPES'18: Proceedings of the 2018 Workshop on Privacy in the Electronic Society

October 2018

190 pages

ISBN:9781450359894

DOI:10.1145/3267323

General Chairs:
David Lie
University of Toronto, Canada
,
Mohammad Mannan
Concordia University, Canada
,
Program Chair:
Aaron Johnson
U.S. Naval Research Laboratory, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Research Grants Council, University Grant Committee of Hong Kong

Conference

CCS '18

Sponsor:

SIGSAC

CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security

October 15, 2018

Toronto, Canada

Acceptance Rates

WPES'18 Paper Acceptance Rate 11 of 25 submissions, 44%;

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
287
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)7

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chow SZhao Y(2025)Secure Data Deduplication SchemesEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1562(2229-2231)Online publication date: 8-Jan-2025
https://doi.org/10.1007/978-3-030-71522-9_1562
Shi JHu CZhang SZhou QMei ZYao SDeng A(2024)An Efficient and Expressive Fully Policy-Hidden Ciphertext-Policy Attribute-Based Encryption Scheme for Satellite Service SystemsISPRS International Journal of Geo-Information10.3390/ijgi1309032113:9(321)Online publication date: 5-Sep-2024
https://doi.org/10.3390/ijgi13090321
Zhao SZhao CHuang YSong XXu Q(2024)Two-Party Threshold Private Set Intersection Protocols from Lightweight Cryptographic PrimitivesCryptography10.3390/cryptography80400588:4(58)Online publication date: 22-Dec-2024
https://doi.org/10.3390/cryptography8040058
Bay A(2024)NEW THRESHOLD PRIVATE SET INTERSECTION PROTOCOLSMugla Journal of Science and Technology10.22531/muglajsci.1387499Online publication date: 4-Apr-2024
https://doi.org/10.22531/muglajsci.1387499
Hu JZhao YHong Meng Tan BAung KWang H(2024)Enabling Threshold Functionality for Private Set Intersection Protocols in Cloud ComputingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340235519(6184-6196)Online publication date: 17-May-2024
https://dl.acm.org/doi/10.1109/TIFS.2024.3402355
Hwang SJarecki SKarl Zvan Kempen ETsudik G(2024)$$\mathcal {P}\textsf{IVA}$$: Privacy-Preserving Identity Verification Methods for Accountless Users via Private List Intersection and VariantsComputer Security – ESORICS 202410.1007/978-3-031-70896-1_18(362-382)Online publication date: 6-Sep-2024
https://doi.org/10.1007/978-3-031-70896-1_18
Carpent XHwang STsudik G(2024)Element Distinctness and Bounded Input Size in Private Set Intersection and Related ProtocolsApplied Cryptography and Network Security10.1007/978-3-031-54770-6_2(26-57)Online publication date: 1-Mar-2024
https://doi.org/10.1007/978-3-031-54770-6_2
Morales DAgudo ILopez J(2023)Private set intersectionComputer Science Review10.1016/j.cosrev.2023.10056749:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.cosrev.2023.100567
Yang YDong XCao ZShen JLi RYang YDou S(2023)EMPSI: Efficient multiparty private set intersection (with cardinality)Frontiers of Computer Science10.1007/s11704-022-2269-018:1Online publication date: 6-Sep-2023
https://doi.org/10.1007/s11704-022-2269-0
Chow SZhao Y(2022)Secure Data Deduplication SchemesEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-642-27739-9_1562-1(1-4)Online publication date: 3-Aug-2022
https://doi.org/10.1007/978-3-642-27739-9_1562-1
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten