CCSP Seminar: Ajaykrishnan Nageswaran, "Data Privacy for a $\rho$-Recoverable Function"
Communication, Control and Signal Processing Seminar
Data Privacy for a $\rho$-Recoverable Function
A user's data is represented by a finite-valued random variable. A querier seeks to compute a given function of the data based on a query response provided by the user. Under the requirement that the querier must recover the function value from the query response with at least a prescribed probability, we analyze single and multiple independent query responses that provide maximum data privacy to the user by inflicting a maximum probability of data-estimation error on the querier. Explicit achievability schemes for randomization in query responses are given and their privacy compared with converse upper bounds.
This is joint work with Prof. Prakash Narayan.