arXiv:2609.36376v1 Announce Type: cross
Abstract: Dense retrieval, the key component of Retrieval Augmented Generation (RAG), retrieves the most relevant documents by comparing dense vector represent...
By Louis Tremblay Thibault, Sofiane Azogagh, Marc-Olivier Killijian, Ulrich A\"ivodji
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
With the widespread applications of large language models (LLMs), privacy-preserving inference has become increasingly essential for sensitive queries. To balance privacy and utility, a series of ligh...
arXiv:2606. 18782v1 Announce Type: cross Abstract: Large Language Models are increasingly applied to sensitive domains that require redaction of personally identifiable information (PII).
By Sean Brynj\'olfsson, Shashvat Jayakrishnan, Esha Sali, Diptanshu Purwar, Madhav Aggarwal
The paper introduces Veil-then-Reveal (VtR), a user-side framework that pseudo‑anonymizes personally identifiable information (PII) in prompts sent to large language models (LLMs) under a zero‑trust model. VtR replaces detected PII with realistic, same‑type surrogates using format‑preserving encryption for structured data and a keyed‑hash dictionary for semantic data, while preserving linguistic and structural cues. The system achieves high detection recall (97.9%), strong protection of detected values (95.2%), and near‑perfect round‑trip restoration (99.9%) across three datasets.
By Mohamed Shaaban, Mohamed Elmahallawy, Thomas E. Carroll
The paper presents a method for extracting key information from OCR‑digitized clinical reports, addressing challenges posed by heterogeneous documents and noisy OCR output. It introduces an open key space that is iteratively mined, normalized, clustered, and verified to build a canonical key inventory, and defines key coverage as a metric for inventory completeness. Experiments on reports from over 20 hospitals using a 0.2B BERT model show that performance improves steadily with key coverage, achieving high F1 scores when the top 90 keys are covered and outperforming a fine‑tuned Qwen3‑0.6B baseline.
By Yu Wang, Yingyun Li, Ying Qin, Haiyang Qian