Mobile Private Contact Discovery at Scale
Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, Christian Weinert
摘要
Mobile messengers like WhatsApp perform contact discovery by uploading the user's entire address book to the service provider. This allows the service provider to determine which of the user's contacts are registered to the messaging service. However, such a procedure poses significant privacy risks and legal challenges. As we find, even messengers with privacy in mind currently do not deploy proper mechanisms to perform contact discovery privately. The most promising approaches addressing this problem revolve around private set intersection (PSI) protocols. Unfortunately, even in a weak security model where clients are assumed to follow the protocol honestly, previous protocols and implementations turned out to be far from practical when used at scale. This is due to their high computation and/or communication complexity as well as lacking optimization for mobile devices. In our work, we remove most obstacles for large-scale global deployment by significantly improving two promising protocols by Kiss et al. (PoPETS'17) while also allowing for malicious clients. Concretely, we present novel precomputation techniques for correlated oblivious transfers (reducing the online communication by factor 2x), Cuckoo filter compression (with a compression ratio of ⇡ 70 %), as well as 4.3x smaller Cuckoo filter updates. In a protocol performing oblivious PRF evaluations via garbled circuits, we replace AES as the evaluated PRF with a variant of LowMC (Albrecht et al., EUROCRYPT'15) for which we determine optimal parameters, thereby reducing the communication by factor 8.2x. Furthermore, we implement both protocols with security against malicious clients in C/C++ and utilize the ARM Cryptography Extensions available in most recent smartphones. Compared to previous smartphone implementations, this yields a performance improvement of factor 1,000x for circuit evaluations. The online phase of our fastest protocol takes only 2.92 s measured on a real WiFi connection (6.53 s on LTE) to check 1,024 client contacts against a large-scale database with 2 28 entries. As a proof-of-concept, we integrate our protocols in the client application of the open-source messenger Signal.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper34
- ABY2.0: Improved Mixed-Protocol Secure Two-Party ComputationArpita Patra, Thomas Schneider, Ajith Suresh, Hossein YalameUSENIX Security 2021 · 被引用 307 次
- Structure-Aware Private Set Intersection, with Applications to Fuzzy MatchingGayathri Garimella, Mike Rosulek, Jaspal SinghCRYPTO 2022 · 被引用 34 次
- PrivateDrop: Practical Privacy-Preserving Authentication for Apple AirDropAlexander Heinrich, Matthias Hollick, Thomas Schneider, Milan Stute 等USENIX Security 2021 · 被引用 32 次
- Laconic Private Set-Intersection From PairingsDiego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark SimkinCCS 2022 · 被引用 24 次
- PEPSI: Practically Efficient Private Set Intersection in the Unbalanced SettingRasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani, Thomas Humphries 等USENIX Security 2024 · 被引用 20 次
它引用的顶会 Paper6
- Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order ExecutionJo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin 等USENIX Security 2018 · 被引用 1,175 次
- 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 次
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 被引用 404 次
- Labeled PSI from Fully Homomorphic Encryption with Malicious SecurityHao Chen, Zhicong Huang, Kim Laine, Peter RindalCCS 2018 · 被引用 242 次
相关 Paper
- All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile MessengersChristoph Hagen, Christian Weinert, Christoph Sendner, Alexandra Dmitrienko 等NDSS 2021
- Recurrent Private Set Intersection for Unbalanced Databases with Cuckoo Hashing and Leveled FHEEduardo Chielle, Michail ManiatakosNDSS 2025
- Malicious-Secure Private Set Intersection via Dual ExecutionPeter Rindal, Mike RosulekCCS 2017 · 被引用 135 次
- PSI from PaXoS: Fast, Malicious Private Set IntersectionBenny Pinkas, Mike Rosulek, Ni Trieu, Avishay YanaiEUROCRYPT 2020 · 被引用 198 次
- Private Set Intersection in the Internet Setting from Lightweight Oblivious PRFMelissa Chase, Peihan MiaoCRYPTO 2020 · 被引用 158 次
