Metraipolis › archive › dc_cb1ffb239bfa

Privacy-Constrained Function Computation in Distributed Databases — arXiv:2610.41034

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.41034
License (as archived): CC0-1.0
Archived: 2026-11-03T08:19:45.818Z
SHA-256 of the archived text: 0961c7d7579a398260e5d691aab13cf89d55003b62c15cd5c12431ed87e9c1f3
Stable URL of this page: https://metraipolis.com/documento/dc_cb1ffb239bfa

How to cite

Privacy-Constrained Function Computation in Distributed Databases — arXiv:2610.41034 — arXiv (en), https://arxiv.org/abs/2610.41034 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb1ffb239bfa (Metraipolis archive dc_cb1ffb239bfa, sha256 0961c7d7579a398260e5d691aab13cf89d55003b62c15cd5c12431ed87e9c1f3)

BibTeX

@misc{dccb1ffb239bfa,
  title = {Privacy-Constrained Function Computation in Distributed Databases — arXiv:2610.41034},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41034},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb1ffb239bfa; sha256 0961c7d7579a398260e5d691aab13cf89d55003b62c15cd5c12431ed87e9c1f3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41034. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.41034 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:38.776Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).