Panther: Private Approximate Nearest Neighbor Search in the Single Server Setting
Jingyu Li, Zhicong Huang, Min Zhang, Cheng Hong, Jian Liu, Tao Wei, Wenguang Chen
摘要
Approximate nearest neighbor search (ANNS), also known as vector search, is an important building block for various applications, such as recommendation systems, biometric authentication, and machine learning. In this work, we are interested in the private ANNS problem, where the client wants to learn (and can only learn) the ANNS results without revealing the query to the server. Previous private ANNS works either suffer from high communication cost (Chen et al., USENIX Security 2020) or work under a stronger security assumption of two non-colluding servers (Servan-Schreiber et al., SP 2022). We present Panther, an efficient private ANNS framework under the single server setting. Panther achieves its high performance via several novel co-designs of private information retrieval, secret-sharing, garbled circuits, and homomorphic encryption. We made extensive experiments using Panther on four public datasets, showing that Panther could answer an ANNS query on 10 million points in 18 seconds with 284 MB of communication. This is more than 7.8× faster and 20× more compact than Chen et al.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Compass: Encrypted Semantic Search with High AccuracyJinhao Zhu, Liana Patel, Matei Zaharia, Raluca Ada PopaOSDI 2025 · 被引用 14 次
- Hoss: Fast Oblivious Semantic Search with Heterogeneous GPU-CPU-TEE ArchitectureJianzhang Du, Weijie Huang, Chenghong Wang, Nicolas Tsagareli 等CCS 2026
- Pisces: Cryptography-based Private Retrieval-Augmented Generation with Dual-Path RetrievalXiaojian Liang, Lushan Song, Shishuai Du, Weicheng Zhu 等ICLR 2026
- Engorgio: An Arbitrary-Precision Unbounded-Size Hybrid Encrypted Database via Quantized Fully Homomorphic EncryptionSong Bian, Haowen Pan, Jiaqi Hu, Zhou Zhang 等USENIX Security 2025
它引用的顶会 Paper28
- Retrieval-Augmented Generation for Knowledge-Intensive NLP TasksPatrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni 等NeurIPS 2020 · 被引用 19,162 次
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 被引用 353 次
- CrypTFlow2: Practical 2-Party Secure InferenceDeevashwer Rathee, Mayank Rathee, Nishant Kumar, Nishanth Chandran 等CCS 2020 · 被引用 294 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
- Scaling ORAM for Secure ComputationJack Doerner, Abhi ShelatCCS 2017 · 被引用 221 次
相关 Paper
- Pacmann: Efficient Private Approximate Nearest Neighbor SearchMingxun Zhou, Elaine Shi, Giulia FantiICLR 2025
- Private Approximate Nearest Neighbor Search with Sublinear CommunicationSacha Servan-Schreiber, Simon Langowski, Srinivas DevadasS&P 2022 · 被引用 37 次
- SANNS: Scaling Up Secure Approximate k-Nearest Neighbors SearchHao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya 等USENIX Security 2020
- Privacy-Preserving Approximate Nearest Neighbor Search on High-Dimensional DataYingfan Liu, Yandi Zhang, Jiadong Xie, Hui Li 等ICDE 2025 · 被引用 2 次
- ANNA: Specialized Architecture for Approximate Nearest Neighbor SearchYejin Lee, Hyunji Choi, Sunhong Min, Hyunseung Lee 等HPCA 2022 · 被引用 37 次
