
Private Function Retrieval
The widespread use of cloud computing services raises the question of ho...
read it

The Capacity of Private Information Retrieval with Eavesdroppers
We consider the problem of private information retrieval (PIR) with coll...
read it

Private Computation of Systematically Encoded Data with Colluding Servers
Private Computation (PC), recently introduced by Sun and Jafar, is a gen...
read it

Private Edge Computing for Linear Inference Based on Secret Sharing
We consider an edge computing scenario where users want to perform a lin...
read it

Anonymous Information Delivery
We introduce the problem of anonymous information delivery (AID), compri...
read it

TwoServer Delegation of Computation on LabelEncrypted Data
Catalano and Fiore propose a scheme to transform a linearlyhomomorphic ...
read it

PrivacyPreserving Distributed Learning in the Analog Domain
We consider the critical problem of distributed learning over data while...
read it
Private Sequential Function Computation
In this paper, we introduce the problem of private sequential function computation, where a user wishes to compute a composition of a sequence of K linear functions, in a specific order, for an arbitrary input. The user does not run these computations locally, rather it exploits the existence of N noncolluding servers, each can compute any of the K functions on any given input. However, the user does not want to reveal any information about the desired order of computations to the servers. For this problem, we study the capacity C, defined as the supremum of the number of desired computations, normalized by the number of computations done at the servers, subject to the privacy constraint. In particular, we prove that (11/N)/ (11/(K,N)) < C < 1. For the achievability, we show that the user can retrieve the desired order of computations, by choosing a proper order of inquiries among different servers, while keeping the order of computations for each server fixed, irrespective of the desired order of computations. In the end, we develop an informationtheoretic converse which results an upper bound on the capacity.
READ FULL TEXT
Comments
There are no comments yet.