research-article

Practical Over-Threshold Multi-Party Private Set Intersection

Authors:

Rasoul Akhavan Mahdavi,

Thomas Humphries,

Bailey Kacsmar,

Simeon Krastnikov,

John A. Premkumar,

Masoumeh Shafieinejad,

Florian Kerschbaum,

Erik-Oliver BlassAuthors Info & Claims

ACSAC '20: Proceedings of the 36th Annual Computer Security Applications Conference

Pages 772 - 783

https://doi.org/10.1145/3427228.3427267

Published: 08 December 2020 Publication History

Abstract

Over-Threshold Multi-Party Private Set Intersection (OT-MP-PSI) is the problem where several parties, each holding a set of elements, want to know which elements appear in at least t sets, for a certain threshold t, without revealing any information about elements that do not meet this threshold. This problem has many practical applications, but current solutions require a number of expensive operations exponential in t and thus are impractical.

In this work we introduce two new OT-MP-PSI constructions using more efficient techniques. Our more refined scheme, which we call, runs in three communication rounds. achieves communication complexity that is linear in the number of parties, the number of elements they hold, and the intersection threshold. The computational cost of is still exponential in t, but it relies on cheap linear operations and thus it is still practical. We implement our new constructions to validate their practicality for varying thresholds, number of parties, and dataset size.

References

[1]

Abdelrahaman Aly, Marcel Keller, Dragos Rotaru, Peter Scholl, Nigel P.Smart, and Tim Wood. 2020. SCALE–MAMBA software. https://homes.esat.kuleuven.be/~nsmart/SCALE/.

[2]

Saikrishna Badrinarayanan, Peihan Miao, and Peter Rindal. 2020. Multi-Party Threshold Private Set Intersection with Sublinear Communication. Cryptology ePrint Archive, Report 2020/600. https://eprint.iacr.org/2020/600.

[3]

Elaine Barker, William Barker, William Burr, William Polk, Miles Smid, 2006. Recommendation for key management: Part 1: General. National Institute of Standards and Technology, Technology Administration.

[4]

Eric W. Burger, Michael D. Goodman, Panos Kampanakis, and Kevin A. Zhu. 2014. Taxonomy Model for Cyber Threat Intelligence Information Exchange Technologies. In Proceedings of the 2014 ACM Workshop on Information Sharing & Collaborative Security. 51–60.

Digital Library

[5]

Jung Hee Cheon, Stanislaw Jarecki, and Jae Hong Seo. 2012. Multi-party privacy-preserving set intersection with quasi-linear complexity. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 95, 8 (2012), 1366–1378.

[6]

Ivan Damgård and Rune Thorbek. 2008. Efficient Conversion of Secret-shared Values Between Different Fields.IACR Cryptology ePrint Archive 2008 (01 2008), 221.

[7]

Emiliano De Cristofaro and Gene Tsudik. 2010. Practical private set intersection protocols with linear complexity. In International Conference on Financial Cryptography and Data Security. Springer, 143–159.

Digital Library

[8]

Michael J Freedman, Carmit Hazay, Kobbi Nissim, and Benny Pinkas. 2016. Efficient set intersection with simulation-based security. Journal of Cryptology 29, 1 (2016), 115–155.

Digital Library

[9]

Michael J Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In International conference on the theory and applications of cryptographic techniques. Springer, 1–19.

[10]

Carmit Hazay and Muthuramakrishnan Venkitasubramaniam. 2017. Scalable multi-party private set-intersection. In IACR International Workshop on Public Key Cryptography. Springer, 175–203.

[11]

Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In Proceedings of the 19th Annual Network and Distributed System Security Symposium.

[12]

Bernardo A Huberman, Matt Franklin, and Tad Hogg. 1999. Enhancing privacy and trust in electronic communities. In Proceedings of the 1st ACM conference on Electronic commerce. 78–86.

Digital Library

[13]

Christopher Johnson, Mark Badger, David Waltermire, Julie Snyder, and Clem Skorupka. 2016. Guide to cyber threat information sharing. Technical Report SP 800-150. National Institute of Standards and Technology.

[14]

Panos Kampanakis. 2014. Security automation and threat information-sharing options. IEEE Security & Privacy 12, 5 (2014), 42–51.

[15]

Lea Kissner and Dawn Song. 2004. Private and threshold set-intersection. Technical Report. Carnegie-Mellon University.

[16]

Lea Kissner and Dawn Song. 2005. Privacy-Preserving Set Operations. In Advances in Cryptology – CRYPTO, Victor Shoup (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 241–257.

[17]

Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. 2016. Efficient batched oblivious PRF with applications to private set intersection. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 818–829.

Digital Library

[18]

Frederick Lah. 2008. Are IP Addresses “Personally Identifiable Information”?I/S: A Journal of Law and Policy for the Information Society 4 (2008), 681–707. Issue 3.

[19]

Yehuda Lindell, Benny Pinkas, Nigal P. Smart, and Avishay Yanai. 2019. Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. Journal of Cryptology 32, 3 (2019), 1026–1069.

Digital Library

[20]

Yehuda Lindell, Nigel P. Smart, and Eduardo Soria-Vazquez. 2016. More Efficient Constant-Round Multi-party Computation from BMR and SHE. In Proceedings of the 14th International Conference on Theory of Cryptography. 554–581.

Digital Library

[21]

Catherine Meadows. 1986. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In 1986 IEEE Symposium on Security and Privacy. IEEE, 134–134.

[22]

Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology — EUROCRYPT ’99, Jacques Stern (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 223–238.

[23]

Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2019. Spot-light: Lightweight private set intersection from sparse OT extension. In Annual International Cryptology Conference. Springer, 401–431.

Digital Library

[24]

Benny Pinkas, Thomas Schneider, and Michael Zohner. 2018. Scalable private set intersection based on OT extension. ACM Transactions on Privacy and Security (TOPS) 21, 2 (2018), 1–35.

Digital Library

[25]

Michael O Rabin. 2005. How To Exchange Secrets with Oblivious Transfer.IACR Cryptology ePrint Archive 2005 (2005), 187.

[26]

David Ross, Jason Shiffer, Tony Dell, William Gibb, and Doug Wilson. 2020. OpenIOC. https://www.openioc.org/.

[27]

Adi Shamir. 1979. How to Share a Secret. Commun. ACM 22, 11 (Nov. 1979), 612–613. https://doi.org/10.1145/359168.359176

Digital Library

[28]

Cynthia Wagner, Alexandre Dulaunoy, Gérard Wagener, and Andras Iklody. 2016. MISP: The Design and Implementation of a Collaborative Threat Intelligence Sharing Platform. In Proceedings of the ACM on Workshop on Information Sharing and Collaborative Security. 49–56.

Digital Library

[29]

Moti Yung. 2015. From Mental Poker to Core Business: Why and How to Deploy Secure Computation Protocols?. In Proceedings of the 22nd ACM Conference on Computer and Communications Security. 1–2.

Digital Library

Cited By

Guan Cvan Assen JErkin Z(2024)Collective Threshold Multiparty Private Set Intersection Protocols for Cyber Threat Intelligence2024 IEEE International Workshop on Information Forensics and Security (WIFS)10.1109/WIFS61860.2024.10810671(1-6)Online publication date: 2-Dec-2024
https://doi.org/10.1109/WIFS61860.2024.10810671
Wu AXin XZhu JLiu WSong CLi G(2024)Cloud-Assisted Laconic Private Set Intersection CardinalityIEEE Transactions on Cloud Computing10.1109/TCC.2024.336188212:1(295-305)Online publication date: Jan-2024
https://doi.org/10.1109/TCC.2024.3361882
Mohanty TSrivastava VDebnath SDas ASikdar B(2024)Quantum Secure Threshold Private Set Intersection Protocol for IoT-Enabled Privacy-Preserving Ride-Sharing ApplicationIEEE Internet of Things Journal10.1109/JIOT.2023.329113211:1(1761-1772)Online publication date: 1-Jan-2024
https://doi.org/10.1109/JIOT.2023.3291132
Show More Cited By

Index Terms

Practical Over-Threshold Multi-Party Private Set Intersection
1. Security and privacy
  1. Cryptography
2. Theory of computation
  1. Computational complexity and cryptography

Index terms have been assigned to the content through auto-classification.

Recommendations

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

We present a new paradigm for multi-party private set intersection (PSI) that allows $n$ parties to compute the intersection of their datasets without revealing any additional information. We explore a variety of instantiations of this paradigm. Our ...
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

We describe a lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an input r; the sender gets output s and the receiver gets output F(s; r), where ...
Efficient Multi-Party Private Set Intersection Against Malicious Adversaries
CCSW'19: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop

Private set intersection (PSI) enables parties to compute the intersection of their inputs without leaking any additional information. Recently, there have been significant advances in the two-party settings with malicious security, making two-party PSI ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ACSAC '20: Proceedings of the 36th Annual Computer Security Applications Conference

December 2020

962 pages

ISBN:9781450388580

DOI:10.1145/3427228

Copyright © 2020 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 the author(s) 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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 December 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ACSAC '20

ACSAC '20: Annual Computer Security Applications Conference

December 7 - 11, 2020

Austin, USA

Acceptance Rates

Overall Acceptance Rate 104 of 497 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
447
Total Downloads

Downloads (Last 12 months)116
Downloads (Last 6 weeks)13

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Guan Cvan Assen JErkin Z(2024)Collective Threshold Multiparty Private Set Intersection Protocols for Cyber Threat Intelligence2024 IEEE International Workshop on Information Forensics and Security (WIFS)10.1109/WIFS61860.2024.10810671(1-6)Online publication date: 2-Dec-2024
https://doi.org/10.1109/WIFS61860.2024.10810671
Wu AXin XZhu JLiu WSong CLi G(2024)Cloud-Assisted Laconic Private Set Intersection CardinalityIEEE Transactions on Cloud Computing10.1109/TCC.2024.336188212:1(295-305)Online publication date: Jan-2024
https://doi.org/10.1109/TCC.2024.3361882
Mohanty TSrivastava VDebnath SDas ASikdar B(2024)Quantum Secure Threshold Private Set Intersection Protocol for IoT-Enabled Privacy-Preserving Ride-Sharing ApplicationIEEE Internet of Things Journal10.1109/JIOT.2023.329113211:1(1761-1772)Online publication date: 1-Jan-2024
https://doi.org/10.1109/JIOT.2023.3291132
Huang XZhang WZhang S(2024)Quantum multi-party private set intersection using single photonsPhysica A: Statistical Mechanics and its Applications10.1016/j.physa.2024.129974649(129974)Online publication date: Sep-2024
https://doi.org/10.1016/j.physa.2024.129974
Ma LWang HNiu ZLi ZWu LWei XSu Y(2024)Over-threshold multi-party private set operation protocols for lightweight clientsComputer Standards & Interfaces10.1016/j.csi.2023.10378188:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.csi.2023.103781
Chen YHuang K(2023)JEDI: Joint and Effective Privacy Preserving Outsourced Set Intersection and Data Integration ProtocolsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.329594118(4504-4514)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1109/TIFS.2023.3295941
Mohanty TDebnath S(2023)An information-theoretically secure quantum multiparty private set intersectionJournal of Information Security and Applications10.1016/j.jisa.2023.10362378(103623)Online publication date: Nov-2023
https://doi.org/10.1016/j.jisa.2023.103623
Blass EKerschbaum F(2022)Mixed-Technique Multi-Party Computations Composed of Two-Party ComputationsComputer Security – ESORICS 202210.1007/978-3-031-17143-7_15(295-319)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17143-7_15
Zhang JWu M(2021)Efficient Cloud-Based Private Set Intersection Protocol with Hidden Access Attribute and Integrity VerificationSecurity and Communication Networks10.1155/2021/39630372021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/3963037

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.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Table of Conten