ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2605.04833v1· 20 results

cs.LGcs.CRmath.STRecentApr 1, 2026

Differentially Private Manifold Denoising

Jiaqi Wu, Yiqing Sun, Zhigang Yao

The paper introduces a differentially private manifold denoising framework that allows noisy, non-private query points to be corrected using sensitive reference data while providing formal $(\varepsil…

View →
cs.CRcs.LGRecentMar 24, 2026

Privacy-Preserving EHR Data Transformation via Geometric Operators: A Human-AI Co-Design Technical Report

Maolin Wang, Beining Bao, Gan Yuan, Hongyu Chen +8 more

The paper proposes a novel data transformation framework that creates semantically rich, privacy-preserving numeric views of EHR data, enabling large-scale research while provably breaking patient lin…

View →
cs.CRcs.LGRecentMay 19, 2026

Latent Geometry as a Structural Monitor: Eigenspace Alignment for Anomaly Detection in Anonymity Networks

Vaibhav Chhabra

The paper proposes using geometric metrics, specifically eigenspace alignment, to monitor the structural integrity of large behavioral populations, demonstrating its effectiveness in detecting network…

View →
cs.CRRecentMay 4, 2026

Dependency-Aware Privacy for Multi-turn Agents

Divyam Anshumaan, Sarthak Choudhary, Nils Palumbo, Somesh Jha

RootGuard introduces a dependency-aware privacy mechanism that sanitizes private data roots once, ensuring consistent privacy guarantees across multiple multi-turn agent interactions, significantly ou…

View →
cs.CRcs.LGeess.SPRecentMar 27, 2026

On the Optimal Number of Grids for Differentially Private Non-Interactive $K$-Means Clustering

Gokularam Muthukrishnan, Anshoo Tandon

This paper proposes a principled, theoretically derived rule for selecting the optimal grid size in differentially private non-interactive K-Means clustering, improving accuracy over existing empirica…

View →
cs.CRcs.DBcs.LGRecentApr 14, 2026

VeriX-Anon: A Multi-Layered Framework for Mathematically Verifiable Outsourced Target-Driven Data Anonymization

Miit Daga, Swarna Priya Ramu

VeriX-Anon is a multi-layered framework that provides mathematically verifiable assurance that outsourced data anonymization (k-anonymization) was executed correctly, achieving high detection rates ag…

View →
cs.CRcs.CLRecentApr 17, 2026

A Case Study on the Impact of Anonymization Along the RAG Pipeline

Andreea-Elena Bodea, Stephen Meisenbacher, Florian Matthes

This case study systematically measures how placing anonymization at different points (dataset vs. generated answer) within the RAG pipeline affects the privacy-utility trade-off, demonstrating that p…

View →
stat.MLcs.LGRecentJun 2, 2026

Privacy-Robust Incrementality Measurement for Advertising Systems under Signal Loss

Prashant Shekhar, Caroline Howard

The paper proposes a robust causal decision framework to measure advertising incrementality despite multiple sources of privacy-induced signal degradation, providing certified decisions on the strengt…

View →
cs.CRRecentMay 14, 2026

Privacy Auditing with Zero (0) Training Run

Tudor Cebere, Mathieu Even, Linus Bleistein, Aurélien Bellet

The paper introduces Zero-Run privacy auditing, a post-hoc framework that allows for practical differential privacy evaluation of large, deployed models without requiring retraining or controlled data…

View →
cs.CRcs.ITRecentJun 2, 2026

Channel Chart Location Privacy Based on Geo-Indistinguishability

Atsu Kokuvi Angélo Passah, Rodrigo C. de Lamare, Arsenia Chorti

This paper introduces a novel privacy mechanism, the geometry-aware Mahalanobis norm planar Laplace (MNPL) mechanism, to provide formal location privacy guarantees for channel charting used in locatio…

View →
cs.LGcs.AIcs.CRRecentApr 6, 2026

Feature-Aware Anisotropic Local Differential Privacy for Utility-Preserving Graph Representation Learning in Metal Additive Manufacturing

MD Shafikul Islam, Mahathir Mohammad Bappy, Saifur Rahman Tushar, Md Arifuzzaman

The paper proposes FI-LDP-HGAT, a novel framework that combines a hierarchical graph attention network with feature-importance-aware anisotropic differential privacy to enable high-utility, privacy-pr…

View →
cs.LGcs.CRcs.DBRecentMay 29, 2026

PE-means: Improved Differentially Private $k$-means Clustering through Private Evolution

Thomas Humphries, Zinan Lin, Sergey Yekhanin

The paper introduces PE-means, an improved differentially private $k$-means clustering method that uses the Private Evolution (PE) algorithm to achieve better clustering loss compared to existing stat…

View →
cs.CRcs.CLRecentApr 13, 2026

Geometry-Aware Localized Watermarking for Copyright Protection in Embedding-as-a-Service

Zhimin Chen, Xiaojie Liang, Wenbo Xu, Yuxuan Liu +1 more

The paper proposes GeoMark, a geometry-aware localized watermarking framework that robustly protects Embedding-as-a-Service (EaaS) against model stealing and copyright infringement while preserving ut…

View →
cs.CRRecentMay 26, 2026

Privacy-Preserving Screening for Record Linkage

Chenyu Huang, Fan Zhang, Huangxun Chen, Yongjun Zhao +3 more

The paper introduces Appraisal, a novel Screening-then-Linkage framework (PPRS) that significantly improves the scalability and efficiency of Privacy-Preserving Record Linkage by incorporating a light…

View →
cs.LGcs.CRRecentMay 16, 2026

Jacobian-Guided Anisotropic Noise Reshaping for Enhancing Representation Utility under Local Differential Privacy

Youngmok Ha, Viktor Schlegel, Yidan Sun, Anil Anthony Bharath

The paper proposes a Jacobian-guided anisotropic noise reshaping technique to selectively attenuate noise in task-relevant subspaces, significantly enhancing data utility while maintaining Local Diffe…

View →
cs.CRcs.AIRecentApr 16, 2026

CAMP: Cumulative Agentic Masking and Pruning for Privacy Protection in Multi-Turn LLM Conversations

Aman Panjwani

The paper proposes CAMP, a cross-turn privacy framework that mitigates Cumulative PII Exposure (CPE) in multi-turn LLM conversations by tracking and masking accumulated personal data across the entire…

View →
cs.CRRecentMay 3, 2026

Contrastive Privacy: A Semantic Approach to Measuring Privacy of AI-based Sanitization

George Bissias, Eugene Bagdasarian, Brian Neil Levine

The paper introduces 'contrastive privacy,' a formal, model-agnostic, and quantitative method for evaluating the semantic success of AI-based sanitization across multiple media modalities.

View →
cs.DCcs.AIcs.CRRecentMay 21, 2026

Secure and Parallel Determinant Computation for Large-Scale Matrices in Edge Environments

Prajwal Panth

The paper proposes a Secure Parallel Determinant Computation (SPDC) framework that enables efficient, privacy-preserving, and scalable matrix determinant calculation across multiple untrusted edge ser…

View →
cs.LGcs.CRRecentMay 19, 2026

An exponential mechanism based on quadratic approximations for fine-tuning machine learning models with privacy guarantees

Hoang Tran, Jorge Ramirez, Jiayi Wang, Alberto Bocchinfuso +2 more

The paper proposes a novel exponential mechanism using quadratic approximations to fine-tune machine learning models on sensitive data while providing strong differential privacy guarantees.

View →
cs.CRcs.LGRecentMay 6, 2026

Privacy Without Losing Place: A Paradigm for Private Retrieval in Spatial RAGs

Kennedy Edemacu, Mohammad Mahdi Shokri, Vinay M. Shashidhar, Jong Wook Kim

The paper introduces PAS, a structured privacy mechanism that encodes user location using relative anchors, enabling location privacy in spatial RAG systems while maintaining high retrieval performanc…

View →