Privacy-Constrained Function Computation in Distributed Databases
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.
Related
- Communication and Privacy Trade-Offs in Distributed Storage With Shared Secret Keys
- Differentially Private Distributed Optimization via the Intrinsic Randomness of Zeroth-Order Estimators: Sampling Geometry, Convergence, and Privacy Guarantees
- Privacy-Preserving Distributed Online Dispatch of Low-Carbon Microgrids with TCN–BiLSTM Probabilistic Photovoltaic Forecasts
- Exact Privacy--Distortion Design of Support-Constrained Randomized Response
- Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes
BibTeX
@misc{yachongka2026privacyconstrained,
title = {{Privacy-Constrained Function Computation in Distributed Databases}},
author = {Vamoua Yachongka and Rémi A. Chou},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41034},
eprint = {2610.41034},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41034},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Privacy-Constrained Function Computation in Distributed Databases
AU - Vamoua Yachongka
AU - Rémi A. Chou
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.41034
UR - https://arxiv.org/abs/2610.41034
AB - 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.
ER -