arXiv AI
PILLAR: Private Inverted-Index Lexical Lookup for Augmented Retrieval
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
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.
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 Machine Learning
Aug 27
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 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.
Hugging Face Trending Papers
Aug 26
Pointing the Way, Hiding the Destination: Practical Private Dense Retrieval at Scale
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 onl...
arXiv Machine Learning
Sep 16
Differentially Private Semantic Plans for Aggregate Insight Generation
The paper introduces ‘DP-SPIN’, a trusted‑curator framework that generates differentially private semantic plans for aggregate insight generation. ‘DP-SPIN’ maps each record to a bounded sparse nonnegative vector over pre‑defined semantic concepts, sums these vectors into a semantic sketch, and releases a noisy plan containing admitted concepts and their masses. The framework provides user‑level privacy by clipping each user’s contribution and ensures that the final summary is differentially private through post‑processing, with guarantees established under both add/drop and replacement adjacency.