PICS: Private Intersection over Committed (and reusable) Sets
Aarushi Goel, Peihan Miao, Phuoc Van Long Pham, Satvinder Singh
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper20
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 被引用 446 次
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 被引用 429 次
- Labeled PSI from Fully Homomorphic Encryption with Malicious SecurityHao Chen, Zhicong Huang, Kim Laine, Peter RindalCCS 2018 · 被引用 242 次
- Compressing Vector OLEElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval IshaiCCS 2018 · 被引用 220 次
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 被引用 205 次
相关 Paper
- PSI from Ring-OLEWutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail OstrovskyCCS 2022 · 被引用 18 次
- Faster Than Ever: A New Lightweight Private Set Intersection and Its VariantsGuowei Ling, Peng Tang, Jinyong Shan, Liyao Xiang 等NDSS 2026
- Actively Secure Private Set Intersection in the Client-Server SettingYunqing Sun, Jonathan Katz, Mariana Raykova, Phillipp Schoppmann 等CCS 2024 · 被引用 7 次
- Committed Vector Oblivious Linear Evaluation and Its ApplicationsYunqing Sun, Hanlin Liu, Kang Yang, Yu Yu 等CCS 2025
- Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSINishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu 等CCS 2021 · 被引用 50 次
