Function Computation Without Secure Links: Information and Leakage Rates
share
Consider L users, who each holds 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 can make a single use of a public and noiseless broadcast channel. 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.
READ FULL TEXT
