arXiv AI

Hybrid privacy-aware semantic search: SVD-truncated document geometry and CKKS-encrypted query reranking under a restricted threat model

arXiv:2606. 26373v1 Announce Type: cross Abstract: Dense embeddings power semantic search and retrieval-augmented generation, but embedding-inversion attacks can reconstruct source text from a vector: when a vector database leaks, the documents behind it leak too.

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.

By Peichun Hua, Danyang Chen, Junan Zhang, Haifeng Sun, Jingyu Wang, Diwen Xue, Mingyu Li, Yunming Xiao
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 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 Computation and Language
Aug 31

CamoDocs: A Poisoning Attack Against Retrieval-Augmented Language Models Using Camouflaged Documents

arXiv:2608. 28389v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) augments LLMs with external documents, but public or user-editable sources expose RAG systems to data poisoning: attackers can inject malicious documents to steer outputs toward targeted answers.

By Jaewon Jung, Haizhong Zheng, Hongsun Jang, Jaeyong Song, Beidi Chen, Jinho Lee
arXiv AI
Aug 20

Denoising-Aware Inversion: Revealing Privacy Risks in Noise-Protected Text Embeddings

The paper investigates the vulnerability of Gaussian‑noised text embeddings to inversion attacks. It identifies a "Double Noise Trap" that hampers standard generative methods and introduces DAEI, a denoising‑aware pipeline that significantly outperforms existing baselines in reconstructing original text. Experiments show DAEI improves BLEU by 154% and token‑level metrics by 32–60%.

By Yubo Wang, Shujie Cui, James Bailey, Hongzhi Yin, Wenyu Liang, Min Tang, Shiyue Qin, Weiqing Wang
Hugging Face Trending Papers
Jun 20

$π$-RAG: Oblivious Retrieval via Semantic Quantization and Transcendental Addressing for Large Language Models

This paper introduces $π$-RAG, a novel architecture for oblivious retrieval that decouples Large Language Models (LLMs) from sensitive data storage without sacrificing semantic understanding. Traditional Retrieval-Augmented Generation (RAG) architectures expose raw vector embeddings to potential inversion attacks and nondeterministic retrieval failures.

arXiv Machine Learning
Jul 3

Embedding Inference Attack

arXiv:2607. 01276v1 Announce Type: cross Abstract: Embedding models are essential components of modern Information Retrieval (IR) systems, yet they are typically hidden behind APIs.

By Cedric Fitiavana Raelijohn, S\'ebastien Gambs, Jean-Francois Rajotte