All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD7-S6-T4.1
Paper Title Distribution Privacy Under Function rho-Recoverability
Authors Ajaykrishnan Nageswaran, Prakash Narayan, University of Maryland, College Park, United States
Session D7-S6-T4: Information-Theoretic Privacy
Chaired Session: Tuesday, 20 July, 23:40 - 00:00
Engagement Session: Wednesday, 21 July, 00:00 - 00:20
Abstract A user generates $n$ independent and identically distributed data rvs with a pmf that must be guarded from a querier. The querier must recover, with a prescribed accuracy, a given function of the data from each of $n$ independent and identically distributed user-devised query responses. The user chooses the data pmf and the random query responses to maximize distribution privacy as gauged by the divergence between the pmf and the querier's best estimate of it based on the $n$ query responses. Considering an arbitrary function, a basic achievable lower bound, that does not depend on $n$, is provided for distribution privacy. Next, upper (converse) and lower (achievable) bounds, dependent on $n$, are developed that converge to said basic bound as $n$ grows. Explicit strategies for the user and the querier are identified.