arXiv Machine Learning

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

The paper presents a practical private dense retrieval system that uses learned deep hashing as a private filter to generate a short candidate list for each query. Encrypted reranking and oblivious key transfer protect the exact query and final selection, allowing the system to match full‑corpus retrieval quality with only 200‑500 candidates. Experiments on five zero‑shot corpora and the 2.68M‑passage NQ corpus show minimal latency overhead and strong privacy guarantees.

arXiv Machine Learning
Sep 4

Spruce: Scalable Private Outsourced Retrieval Using Compact Embeddings

Spruce is a system that enables scalable private outsourced retrieval by learning compact binary embeddings and using efficient Hamming-distance computation under a two‑server multi‑party computation protocol. It replaces costly corpus‑wide embedding scoring with a fixed‑radius protocol that avoids multi‑round candidate selection, and introduces private cluster pruning and a one‑core dealer to reduce computation and eliminate OT preprocessing bottlenecks. Across corpora of 383K–5.42M documents, Spruce maintains original search quality while achieving up to 31.5× higher throughput and reducing query times to a few seconds.

By Peichun Hua, Yunming Xiao
Hugging Face Trending Papers
Sep 3

Spruce: Scalable Private Outsourced Retrieval Using Compact Embeddings

Spruce is a system that enables secure, private retrieval of large document collections outsourced to untrusted clouds by learning compact binary embeddings that preserve search quality while drastically reducing computation and communication. It replaces expensive corpus-wide embedding scoring with efficient Hamming-distance calculations under a two-server multi-party computation protocol, and introduces a fixed-radius protocol, private cluster pruning, and a one-core dealer to further cut latency and bandwidth usage. Across corpora ranging from 383K to 5.42M documents, Spruce maintains original search quality, achieving up to 6.7× faster full scans and 22.9× speedups with pruning, while retaining over 94% of the original NDCG.

arXiv AI
Sep 7

Shadow Queries for Private Retrieval in Vector Databases

The paper introduces SHAQ, a defense called Shadow Query Generation that protects document embeddings in vector databases from embedding inversion attacks. SHAQ replaces direct embeddings with diverse shadow queries generated by a language model, thereby decomposing document semantics and decoupling stored embeddings from the original text. Experiments on various IR datasets show that SHAQ significantly lowers recovery rates, defends more tokens than baseline methods, and even improves retrieval utility.

By Xinguo Feng, Zhongkui Ma, Zihan Wang, Chuan Yan, Guowei Yang, Alsharif Abuadbba, Guangdong Bai
arXiv AI
Jul 21

TurboVec: A Case Study in Cost-Efficient Private Retrieval for Enterprise RAG via Codebook-Oblivious Quantization

arXiv:2607. 16973v1 Announce Type: cross Abstract: Retrieval-Augmented Generation (RAG) systems increasingly power enterprise LLM applications, yet the vector retrieval layer introduces two underexplored challenges: (1) trained codebook quantizers may expose corpus statistics during index construction, creating a leakage channel in multi-tenant deployments, and (2) post-hoc filtering for tenant isolation degrades recall on selective queries.

By Navnit Shukla, Kamal Pandey, Omsankar Tiwari