Skip to content

Pointing the Way, Hiding the Destination: Practical Private Dense Retrieval at Scale

Aug 2026 · 2 citations · 108 references
Computer Science

TL;DR

This shortlist short-circuits full-corpus cryptographic search without sacrificing retrieval quality: with 200-500 candidates, it closely matches full-corpus retrieval across five zero-shot corpora spanning 25K to 5.4M documents.

Abstract

Hosted retrieval-augmented generation (RAG) and semantic search allow users to query valuable provider-held corpora, raising two competing demands: to hide each query and chosen result, yet reveal only the documents that the user is authorized to receive. Existing cryptographic approaches either make this costly by processing the entire corpus for every query, or sacrifice quality for efficiency by scanning a few clusters. We repurpose learned deep hashing as a private filter: a randomized binary code points the provider to a short candidate list, while encrypted reranking and oblivious key transfer protect the precise query and final selection. This shortlist short-circuits full-corpus cryptographic search without sacrificing retrieval quality: with 200-500 candidates, it closely matches full-corpus retrieval across five zero-shot corpora spanning 25K to 5.4M documents. On the full 2.68M-passage NQ corpus over a 10-Gbps link, our protocol only adds 0.73 seconds, or 10 percent, to a 128-token Qwen3-32B RAG pipeline. The released code satisfies directional metric differential privacy (DP) and substantially reduces embedding-inversion and property-inference leakage, demonstrating that a carefully learned shortlist can make private dense retrieval both accurate and practical.

View source

Similar papers

#machine learning Preprint Sep 2026

Spruce: Scalable Private Outsourced Retrieval Using Compact Embeddings

Spruce learns compact binary codes that preserve candidates for full-precision reranking, replacing corpus-wide embedding scoring with efficient Hamming-distance computation under two-server multi-party computation under two-server multi-party computation (MPC).

Pei-Chun Hua, Yun-Ming Xiao · 4 citations
Preprint Aug 2026

A Unified Benchmark for Privacy-preserving Vector Search

A uniform experimental comparison of vector search schemes finds that the performance of SAP matches Plaintext, EMVP delivers cryptographic indistinguishability at a 4x throughput cost on CPU, BNTM adds malicious-server verifiability at a further 22x median-latency cost, and Tiptoe hides the cluster choice itself, but...

Anne-Marie Kermarrec, Rafael Pires, Mathis Randl et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Matryoshka Hash Representations for Model-Aware Compact Semantic Retrieval

This work introduces Matryoshka Hash Representations (MHR), a two-stage procedure that separates full-width training from prefix organization and strengthens two common pipelines: shortlisting candidates for full-precision reranking, and pruning a low-storage graph index such as LEANN.

Peichun Hua, Yun-Ming Xiao · 1 citation
Conference Open access 2026

Authenticated Private Information Retrieval for Range Queries

This work presents an Authenticated Private Information Retrieval protocol for range queries with guarantees of soundness and completeness, and introduces the APIR-tree, a novel authenticated data structure that embeds values at every node, enabling nodes to serve as VOs for their ancestors and eliminating redundancy.

Hesham Youssef, Ying Cai, Soamar Homsi · 0 citations
Jul 2026

MESS: Fast and Private Semantic Search on Multi-Graph HNSW

This paper presents MESS, a system that ensures data, query, and access pattern privacy, and constructs a multi-graph Hierarchical Navigable Small World (HNSW) index over the perturbed codes, and gives formal analysis of the system's privacy and extensive evaluation of its performance.

Haoyu Cui, Zengpeng Li, Tien Tuan Anh Dinh et al. · 2 citations · ⚡1
Aug 2026

GPIR: Efficient Single‐Server Private Information Retrieval With Garbled Bloom Filters

GPIR protects the queried index, target row, and GBF positions, while wGPIR provides intra‐row query privacy under the IND‐CPA security of BFV, demonstrating its practicality for efficient private retrieval.

Zixuan Di, Wen-Qi Zhang, Shuai Shang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.