Hugging Face Trending Papers

A Novel Semantic Manifold Alignment Attack against Embedding-to-Embedding Obfuscation in Privacy-Preserving LLMs

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
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
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
arXiv AI
Sep 1

Disappearing Ink: Obfuscation Breaks N-gram Code Watermarks in Theory and Practice

The paper demonstrates that N‑gram based code watermarking schemes, widely used to identify machine‑generated code, are ineffective when faced with realistic code obfuscation. By modeling semantics‑preserving transformations as a Markov random walk and introducing the assumption of distribution consistency, the authors prove that obfuscation can drive the failure rate of any detector to nearly 1 minus its false‑positive rate. Extensive experiments across multiple watermarking methods, LLMs, languages, benchmarks, and obfuscators confirm that detectors collapse to near‑random performance (AUROC ≈ 0.5) after obfuscation.

By Gehao Zhang, Mingzhe Li, Eugene Bagdasarian, Shiqing Ma, Juan Zhai
arXiv Computation and Language
Sep 7

Robust Text Watermarking for Large Language Models via Dual Semantic Embeddings

The paper introduces Dual-Embedding Watermarking (DEW), a semantic watermarking technique for large language models that combines contextual and token-level embeddings. DEW applies algebraic vector-space operations to generate a watermark signal that remains robust to paraphrasing and translation, while obfuscating the signal with pseudo-random matrices seeded by a secret key. Experiments demonstrate state‑of‑the‑art robustness, especially against translation, with minimal computational overhead and preserved text quality at lower watermark strengths.

By Jonas Sch\"afer, Cezary Pilaszewicz, Gerhard Wunder