Panther: Private Approximate Nearest Neighbor Search in the Single Server Setting

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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..

Cite

CITATION STYLE

APA

Li, J., Huang, Z., Zhang, M., Hong, C., Liu, J., Wei, T., & Chen, W. (2025). Panther: Private Approximate Nearest Neighbor Search in the Single Server Setting. In CCS 2025 - Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security (pp. 365–379). Association for Computing Machinery, Inc. https://doi.org/10.1145/3719027.3765190

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free