Database
Privacy-Constrained Function Computation in Distributed Databases
arXiv math.IT0 views
arXiv:2610.41034v1 Announce Type: new Abstract: Consider distributed databases that contain both sensitive (private) and non-sensitive (public) attributes. A user seeks to compute a function of public attributes and side information by interacting with the databases and downloading their responses. In this paper, we study the trade-offs among download cost, information leakage about the private attributes, and distortion between the computed function and its reconstruction, referred to as the capacity region. Our main contributions are as follows. For a single database, we provide a complete characterization of the capacity region for general discrete sources and characterize the capacity region of two different setups for Gaussian sources when the computed function is defined as the sum of the public attribute and side information. For distributed databases, we establish inner and outer bounds on the capacity region of discrete sources and we characterize the capacity region when the databases and the side information are mutually independent. As a special instance, we study lossless function computation, and results analogous to the lossy case are obtained.
Source:https://arxiv.org/abs/2610.41034PreviousLearning Finite-Memory Binary SourcesNextOn the Communication-Sensing Tradeoff in DMT-Optimal Space-time-Coded ISAC Systems
Related posts
Building an AI Chatbot with Spring Boot and the OpenAI API (2026 Guide)
0dev.to Machine Learning
Automate Telegram Webhook Deployments and Log Purges via Yii2 Console Commands
0dev.to PHP
Parsing WhatsApp chat exports: what real files taught me
0dev.to Programming
A Brighter Flashlight Makes the Release Look Late
0dev.to Programming
Building a Minimal Model Context Protocol (MCP) Server in 30 Lines of TypeScript
0dev.to TypeScript

AWS contributes a large-transaction binary log optimization to MySQL
0AWS Database Blog