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
Abstract
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.
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 864029fb-3ff6-4a82-8cc3-532a4813ad94Cited by top-tier papers4
- Compass: Encrypted Semantic Search with High AccuracyJinhao Zhu, Liana Patel, Matei Zaharia, Raluca Ada PopaOSDI 2025 · 14 citations
- Hoss: Fast Oblivious Semantic Search with Heterogeneous GPU-CPU-TEE ArchitectureJianzhang Du, Weijie Huang, Chenghong Wang, Nicolas Tsagareli et al.CCS 2026
- Pisces: Cryptography-based Private Retrieval-Augmented Generation with Dual-Path RetrievalXiaojian Liang, Lushan Song, Shishuai Du, Weicheng Zhu et al.ICLR 2026
- Engorgio: An Arbitrary-Precision Unbounded-Size Hybrid Encrypted Database via Quantized Fully Homomorphic EncryptionSong Bian, Haowen Pan, Jiaqi Hu, Zhou Zhang et al.USENIX Security 2025
Builds on28
- Retrieval-Augmented Generation for Knowledge-Intensive NLP TasksPatrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni et al.NeurIPS 2020 · 19,162 citations
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 353 citations
- CrypTFlow2: Practical 2-Party Secure InferenceDeevashwer Rathee, Mayank Rathee, Nishant Kumar, Nishanth Chandran et al.CCS 2020 · 294 citations
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai et al.CCS 2019 · 238 citations
- Scaling ORAM for Secure ComputationJack Doerner, Abhi ShelatCCS 2017 · 221 citations
Related papers
- 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 citations
- SANNS: Scaling Up Secure Approximate k-Nearest Neighbors SearchHao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya et al.USENIX Security 2020
- Privacy-Preserving Approximate Nearest Neighbor Search on High-Dimensional DataYingfan Liu, Yandi Zhang, Jiadong Xie, Hui Li et al.ICDE 2025 · 2 citations
- ANNA: Specialized Architecture for Approximate Nearest Neighbor SearchYejin Lee, Hyunji Choi, Sunhong Min, Hyunseung Lee et al.HPCA 2022 · 37 citations
