Paper 2024/1774 Original: eprint.iacr.org/2024/1774 ↗
PANTHER: Private Approximate Nearest Neighbor Search in the Single Server Setting
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\times$ faster and $20\times$ more compact than Chen et al..
Metadata
- Available format(s)
PDF
- Category
- Applications
- Publication info
- Preprint.
- History
- 2025-10-23: last updated
- 2024-10-31: published
- Short URL
- https://ia.cr/2024/1774
- License
- https://creativecommons.org/licenses/by-nc/4.0/
BibTeX
@misc{cryptoeprint:2024/1774,
author = {Jingyu Li and Zhicong Huang and Min Zhang and Cheng Hong and Jian Liu and Tao Wei and Wenguang Chen},
title = {PANTHER: Private Approximate Nearest Neighbor Search in the Single Server Setting},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1774},
year = {2024},
url = {https://eprint.iacr.org/2024/1774}
}