Estimating Incidental Collection in Foreign Intelligence Surveillance: Large-Scale Multiparty Private Set Intersection with Union and Sum
Anunay Kulshrestha, Jonathan R. Mayer
摘要
Section 702 of the Foreign Intelligence Surveillance Act authorizes U.S. intelligence agencies to intercept communications content without obtaining a warrant. While Section 702 requires targeting foreigners abroad for intelligence purposes, agencies "incidentally" collect communications to or from Americans and can search that data for purposes beyond intelligence gathering. For over a decade, members of Congress and civil society organizations have called on the U.S. Intelligence Community (IC) to estimate the scale of incidental collection. Senior intelligence officials have acknowledged the value of quantitative transparency for incidental collection, but the IC has not identified a satisfactory estimation method that respects individual privacy, protects intelligence sources and methods, and imposes minimal burden on IC resources. In this work, we propose a novel approach to estimating incidental collection using secure multiparty computation (MPC). The IC possesses records about the parties to intercepted communications, and communications services possess country-level location for users. By combining these datasets with MPC, it is possible to generate an automated aggregate estimate of incidental collection that maintains confidentiality for intercepted communications and user locations. We formalize our proposal as a new variant of private set intersection, which we term multiparty private set intersection with union and sum (MPSIU-Sum). We then design and evaluate an efficient MPSIU-Sum protocol, based on elliptic curve cryptography and partially homomorphic encryption. Our protocol performs well at the large scale necessary for estimating incidental collection in Section 702 surveillance. FISA, incidental collection, and the estimation challenge. In this work, we propose a novel path forward for estimating incidental collection using secure multiparty computation (MPC). The IC possesses records of the parties to intercepted communications, but may know little about non-target parties. Communications services possess country-level user location for business purposes, but may know little about intercepted communications. By combining these datasets with MPC, it 1 We use the term "U.S. person," which is defined in FISA, for brevity. Courts have interpreted the Fourth Amendment to have similar extraterritorial applicability based on a person's U.S. citizenship or permanent residency.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper4
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone 等CCS 2017 · 被引用 3,936 次
- Practical Multi-party Private Set Intersection from Symmetric-Key TechniquesVladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek 等CCS 2017 · 被引用 247 次
- Fast Database Joins and PSI for Secret Shared DataPayman Mohassel, Peter Rindal, Mike RosulekCCS 2020 · 被引用 42 次
- Labeled PSI from Homomorphic Encryption with Reduced Computation and CommunicationKelong Cong, Radames Cruz Moreno, Mariana Botelho da Gama, Wei Dai 等CCS 2021 · 被引用 3 次
相关 Paper
- Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-SharingYing Gao, Yuanchao Luo, Longxin Wang, Xiang Liu 等CCS 2024 · 被引用 4 次
- MCMix: Anonymous Messaging via Secure Multiparty ComputationNikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, Thomas ZachariasUSENIX Security 2017 · 被引用 85 次
- SoK: Collusion-resistant Multi-party Private Set Intersections in the Semi-honest ModelJelle Vos, Mauro Conti, Zekeriya ErkinS&P 2024 · 被引用 15 次
- Efficient Private Filtering and Aggregation for Weighted Set Intersection via Oblivious Encrypted Weight TransferXiaodong Wang, Shengzhe Meng, Zijie Lu, Bei LiangCCS 2026
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 被引用 446 次
