2017/10/30 by Hua Sun, Sun, Hua, Syed A. Jafar +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Privacy-Preserving Technologies in Data
paper · pdf · doi:10.48550/arxiv.1710.11098
openalex publication_date 2017/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K independent datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute, to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, obtained by expanding the PIR message set (which consists of only independent messages) to also include functions of those messages. The capacity of private computation, C, is defined as the maximum number of bits of the desired function that can be retrieved per bit of total download from all servers. We characterize the capacity of private computation, for N servers and K independent datasets that are replicated at each server, when the functions to be computed are arbitrary linear combinations of the datasets. Surprisingly, the capacity, C=(1+1/N+⋯+1/NK-1)-1, matches the capacity of PIR with N servers and K messages. Thus, allowing arbitrary linear computations does not reduce the communication rate compared to pure dataset retrieval. The same insight is shown to hold even for arbitrary non-linear computations when the number of datasets K→∞.