Skip to content

Shadow Queries for Private Retrieval in Vector Databases

Sep 2026 · 0 citations · 57 references
Computer Science

TL;DR

SHAQ (shadow query generation), a semantic-decomposition and embedding-decoupling defense against EIAs, is proposed, which uses a generative language model to create diverse shadow queries that capture different semantic aspects of each document.

Abstract

Large language models (LLMs) increasingly rely on information retrieval (IR) systems, such as Retrieval-Augmented Generation (RAG), to incorporate domain-specific knowledge without costly re-training. These systems often store pre-computed document embeddings in cloud-based vector databases. However, such embeddings are vulnerable to embedding inversion attacks (EIAs), which can reconstruct their underlying text. Existing defenses, such as adding noise or scaling embeddings, often provide limited privacy or significantly reduce retrieval utility. We propose SHAQ (shadow query generation), a semantic-decomposition and embedding-decoupling defense against EIAs. SHAQ is based on the insight that EIAs rely on the strong coupling between an embedding and its original text. Instead of storing document embeddings directly, SHAQ uses a generative language model to create diverse shadow queries that capture different semantic aspects of each document. These queries are then encoded and stored in place of the original document embeddings, thereby decomposing document semantics and decoupling stored embeddings from the source text. Experiments across diverse IR datasets show that SHAQ substantially improves privacy while preserving retrieval utility, achieving a recovery rate as low as 0.2104, defending up to 19.50% more tokens than baseline defenses, and reaching up to 0.7967 MAP@10 with up to 5.53% utility improvement. These results demonstrate that semantic decomposition and embedding decoupling provide an effective alternative to directly modifying embeddings for defending against EIAs.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

PILLAR: Private Inverted-Index Lexical Lookup for Augmented Retrieval

PILLAR is a Privacy-Preserving RAG system based on Private Information Retrieval (PIR) in which a client utilizes the k documents most similar to their query from a server-held and publicly known corpus to respond to their query, while the server learns nothing about the query, either its terms or its access pattern.

Truong Son Nguyen, D. Blackley, Ni Trieu et al. · 0 citations
#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

DEPT: Document Embedding Preservation Tuning for Unified Query Expansion and Retrieval

Document Embedding Preservation Tuning (DEPT) is introduced, which keeps tuned document embeddings close to cached initial embeddings while allowing retrieval gradients to pass through straight-through decoding into the generator.

Jingyuan Wang, Richong Zhang, Zhijie Nie et al. · 0 citations
Aug 2026

DocuMind: An Offline Multilingual Retrieval-Augmented Generation System for Document Question Answering Using Local Large Language Models

DocuMind is a fully offline, privacy-preserving, multilingual Document Question Answering system built on the Retrieval-Augmented Generation (RAG) architecture, enabling true cross-lingual retrieval without any translation step.

S. S, Sripalreddy · 0 citations
#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
#artificial intelligence Preprint Sep 2026

ViSAR: Training-Free Adaptive-$k$ Retrieval for Visual Document Question Answering

ViSAR (Visual Semantic Activation Retrieval), a training-free adaptive-$k$ retrieval method for late-interaction visual document retrieval, is introduced and it is shown that the similarity matrix structure correlates with answer accuracy, suggesting future directions for retrieval quality-aware document understanding.

Adrien Mialland, Marc Plantevit, Julien Gallois et al. · 2 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.