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.
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
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.
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.
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.· arXiv.org· 2 citations· ⚡1
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.· Concurrency and Computation· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.