skip to main content
research-article

Practical and malicious private set intersection with improved efficiency

Published: 12 April 2024 Publication History

Abstract

We propose a novel two-party private set intersection (PSI) protocol, which achieves ideal and constant receiver-to-sender and linear sender-to-receiver communication overhead, linear computational complexity, along with receiver size-hiding and lightweight computation cost. In comparison with other PSI protocols, the proposed protocol is more practical as it does not require any fully homomorphic computation. We propose three variants to demonstrate efficiency optimization, size-hiding feature extension, and online/offline settings for real-world applications, respectively, to offer a practical control between security and efficiency. Finally, we prove that our proposed protocols are secure against malicious participants under our security model.

References

[1]
M.J. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set intersection, in: Advances in Cryptology-EUROCRYPT 2004, in: Proceedings 23, Springer, 2004, pp. 1–19.
[2]
D. Kales, C. Rechberger, T. Schneider, M. Senker, C. Weinert, Mobile private contact discovery at scale, in: USENIX Security Symposium, 2019, pp. 1447–1464.
[3]
D.R. George, S. Sciancalepore, Prm-private interference discovery for ieee 802.15. 4 networks, in: 2022 IEEE Conference on Communications and Network Security (CNS), IEEE, 2022, pp. 136–144.
[4]
M. Ion, B. Kreuter, A.E. Nergiz, S. Patel, S. Saxena, K. Seth, M. Raykova, D. Shanahan, M. Yung, On deploying secure computing: private intersection-sum-with-cardinality, in: 2020 IEEE European Symposium on Security and Privacy (EuroS&P), IEEE, 2020, pp. 370–389.
[5]
P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti, G. Tsudik, Countering gattaca: efficient and secure testing of fully-sequenced human genomes, in: Proceedings of the 18th ACM Conference on Computer and Communications Security, ACM, 2011, pp. 691–702.
[6]
Y. Wang, Q. Huang, H. Li, M. Xiao, S. Ma, W. Susilo, Private set intersection with authorization over outsourced encrypted datasets, IEEE Trans. Inf. Forensics Secur. 16 (2021) 4050–4062.
[7]
C. Dong, L. Chen, Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in: ACM Conference on Computer and Communications Security, ACM, 2013, pp. 789–800.
[8]
J.H. Cheon, J. Jeong, J. Lee, K. Lee, Privacy-preserving computations of predictive medical models with minimax approximation and non-adjacent form, in: International Conference on Financial Cryptography and Data Security, Springer, 2018, pp. 3–20.
[9]
B. Pinkas, T. Schneider, G. Segev, M. Zohner, Phasing: private set intersection using permutation-based hashing, in: USENIX Security Symposium, 2015, pp. 515–530.
[10]
V. Kolesnikov, R. Kumaresan, M. Rosulek, N. Trieu, Efficient batched oblivious prf with applications to private set intersection, in: ACM CCS, 2016, pp. 818–829.
[11]
P. Rindal, M. Rosulek, Improved private set intersection against malicious adversaries, in: CRYPTO, 2017, pp. 235–259.
[12]
J. Nan, H. Zhu, S. Liu, H. Hu, Adaptively code-correlation robustness functions and its applications to private set intersection, Theor. Comput. Sci. 945 (2023).
[13]
B. Pinkas, T. Schneider, M. Zohner, Scalable private set intersection based on ot extension, ACM Trans. Privacy Secur. 21 (2) (2018) 7:1–7:35.
[14]
B. Pinkas, M. Rosulek, N. Trieu, A. Yanai, Spot-light: lightweight private set intersection from sparse ot extension, in: Advances in Cryptology–CRYPTO 2019, Proceedings, Part III 39, Springer, 2019, pp. 401–431.
[15]
Y. Huang, D. Evans, J. Katz, Private set intersection: are garbled circuits better than custom protocols?, in: NDSS, 2012, pp. 1–15.
[16]
M. Rosulek, N. Trieu, Compact and malicious private set intersection for small sets, in: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, 2021, pp. 1166–1181.
[17]
L. Kissner, D.X. Song, Privacy-preserving set operations, in: Advances in Cryptology - CRYPTO 2005, Springer, 2005, pp. 241–257.
[18]
S. Jarecki, X. Liu, Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection, in: Theory of Cryptography Conference, Springer, 2009, pp. 577–594.
[19]
J. Camenisch, G.M. Zaverucha, Private intersection of certified sets, in: Financial Cryptography and Data Security, Springer, 2010, pp. 108–127.
[20]
H. Chen, K. Laine, P. Rindal, Fast private set intersection from homomorphic encryption, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, pp. 1243–1255.
[21]
K. Cong, R.C. Moreno, M.B. da Gama, W. Dai, I. Iliashenko, K. Laine, M. Rosenberg, Labeled psi from homomorphic encryption with reduced computation and communication, in: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, 2021, pp. 1135–1150.
[22]
E. De Cristofaro, J. Kim, G. Tsudik, Linear-complexity private set intersection protocols secure in malicious model, in: Advances in Cryptology - ASIACRYPT 2010, Springer, 2010, pp. 213–231.
[23]
P. Rindal, P. Schoppmann, Vole-psi: fast oprf and circuit-psi from vector-ole, in: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2021, pp. 901–930.
[24]
W. Chongchitmate, Y. Ishai, S. Lu, R. Ostrovsky, Psi from ring-ole, in: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 531–545.
[25]
S. Dittmer, Y. Ishai, S. Lu, R. Ostrovsky, M. Elsabagh, N. Kiourtis, B. Schulte, A. Stavrou, Streaming and unbalanced psi from function secret sharing, in: 13th International Conference on Security and Cryptography for Networks, Springer, 2022, pp. 564–587.
[26]
E. De Cristofaro, G. Tsudik, Practical private set intersection protocols with linear complexity, in: Financial Cryptography and Data Security, Springer, 2010, pp. 143–159.
[27]
J.H. Cheon, M. Kim, K. Lauter, Homomorphic computation of edit distance, in: Financial Cryptography and Data Security, Revised Selected Papers, Springer, 2015, pp. 194–212.
[28]
C. Hazay, Y. Lindell, Constructions of truly practical secure protocols using standard smartcards, in: ACM Conference on Computer and Communications Security, ACM, 2008, pp. 491–500.
[29]
B. Pinkas, M. Rosulek, N. Trieu, A. Yanai, Psi from paxos: fast, malicious private set intersection, in: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2020, pp. 739–767.
[30]
D.F. Aranha, C. Lin, C. Orlandi, M. Simkin, Laconic private set-intersection from pairings, in: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 111–124.
[31]
B.A. Huberman, M. Franklin, T. Hogg, Enhancing privacy and trust in electronic communities, in: Proceedings of the 1st ACM Conference on Electronic Commerce, 1999, pp. 78–86.
[32]
C. Hazay, K. Nissim, Efficient set operations in the presence of malicious adversaries, in: Public Key Cryptography - PKC 2010, Springer, 2010, pp. 312–331.
[33]
H. Chen, Z. Huang, K. Laine, P. Rindal, Labeled psi from fully homomorphic encryption with malicious security, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, pp. 1223–1237.
[34]
G. Ateniese, E. De Cristofaro, G. Tsudik, (if) size matters: size-hiding private set intersection, in: 14th International Conference on Practice and Theory in Public Key Cryptography, Springer, 2011, pp. 156–173.
[35]
E. Zhang, F. Li, B. Niu, Y. Wang, Server-aided private set intersection based on reputation, Inf. Sci. 387 (2017) 180–194.
[36]
X.A. Wang, F. Xhafa, X. Luo, S. Zhang, Y. Ding, A privacy-preserving fuzzy interest matching protocol for friends finding in social networks, Soft Comput. 22 (2018) 2517–2526.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science
Theoretical Computer Science  Volume 991, Issue C
Apr 2024
179 pages

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 12 April 2024

Author Tags

  1. Private set intersection
  2. Ideal communication
  3. Size-hiding
  4. Privacy-preserving

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media