USENIX Security2026Top-tier venue
PICS: Private Intersection over Committed (and reusable) Sets
Aarushi Goel, Peihan Miao, Phuoc Van Long Pham, Satvinder Singh
Abstract
Private Set Intersection (PSI) enables two parties to compute the intersection of their private sets without revealing any additional information. While maliciously secure PSI protocols prevent many attacks, adversaries can still exploit them by using inconsistent inputs across multiple sessions. This limitation stems from the definition of malicious security in secure multiparty computation, but is particularly problematic in PSI because: (1) real-world applications-such as Apple's PSI protocol for CSAM detection and private contact discovery in messaging apps-often require multiple PSI executions over consistent inputs, and (2) the PSI functionality makes it relatively easy for adversaries to infer additional information. We propose Private Intersection over Committed Sets (PICS), a new framework that enforces input consistency across multiple sessions via committed sets. Building on the state-of-the-art maliciously secure PSI framework (i.e., VOLE-PSI [Rindal and Schoppmann, EUROCRYPT 2021]), we present an efficient instantiation of PICS using lightweight cryptographic tools. Our protocol achieves strong receiverside input consistency (i.e., the receiver uses the exact committed set) and weak sender-side input consistency (i.e., the sender cannot inject new elements into the committed set but can potentially use a subset of the committed set). We implement our protocol to demonstrate concrete efficiency. Compared to VOLE-PSI, our communication overhead is a small constant between 1.57 -2.04× for set sizes between 2 16 -2 24 , and the total end-to-end running time overhead is 1.22 -1.98× across various network settings.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 098288d9-39b7-4ac0-9ed5-1e157bcc69aeBuilds on20
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 446 citations
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 429 citations
- Labeled PSI from Fully Homomorphic Encryption with Malicious SecurityHao Chen, Zhicong Huang, Kim Laine, Peter RindalCCS 2018 · 242 citations
- Compressing Vector OLEElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval IshaiCCS 2018 · 220 citations
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 205 citations
Related papers
- PSI from Ring-OLEWutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail OstrovskyCCS 2022 · 18 citations
- Faster Than Ever: A New Lightweight Private Set Intersection and Its VariantsGuowei Ling, Peng Tang, Jinyong Shan, Liyao Xiang et al.NDSS 2026
- Actively Secure Private Set Intersection in the Client-Server SettingYunqing Sun, Jonathan Katz, Mariana Raykova, Phillipp Schoppmann et al.CCS 2024 · 7 citations
- Committed Vector Oblivious Linear Evaluation and Its ApplicationsYunqing Sun, Hanlin Liu, Kang Yang, Yu Yu et al.CCS 2025
- Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSINishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu et al.CCS 2021 · 50 citations
