Function Computation Without Secure Links: Information and Leakage Rates

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chou, Remi A., Kliewer, Joerg
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916947802718208
author Chou, Remi A.
Kliewer, Joerg
author_facet Chou, Remi A.
Kliewer, Joerg
contents Consider $L$ users, who each hold private data, and one fusion center who must compute a function of the private data of the $L$ users. To accomplish this task, each user may utilize a public and noiseless broadcast channel in a non-interactive manner. In this setting, and in the absence of any additional resources such as secure links, we study the optimal communication rates and minimum information leakages on the private user data that are achievable. Specifically, we study the information leakage of the user data at the fusion center (beyond the knowledge of the function output), as well as at predefined groups of colluding users who eavesdrop one another. We derive the capacity region when the user data is independent, and inner and outer regions for the capacity region when the user data is correlated.
format Preprint
id arxiv_https___arxiv_org_abs_2201_11891
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Function Computation Without Secure Links: Information and Leakage Rates
Chou, Remi A.
Kliewer, Joerg
Information Theory
Consider $L$ users, who each hold private data, and one fusion center who must compute a function of the private data of the $L$ users. To accomplish this task, each user may utilize a public and noiseless broadcast channel in a non-interactive manner. In this setting, and in the absence of any additional resources such as secure links, we study the optimal communication rates and minimum information leakages on the private user data that are achievable. Specifically, we study the information leakage of the user data at the fusion center (beyond the knowledge of the function output), as well as at predefined groups of colluding users who eavesdrop one another. We derive the capacity region when the user data is independent, and inner and outer regions for the capacity region when the user data is correlated.
title Function Computation Without Secure Links: Information and Leakage Rates
topic Information Theory
url https://arxiv.org/abs/2201.11891