Technical Program

Paper Detail

Paper Title Predicate Privacy and List Privacy for a rho-Recoverable Function
Paper IdentifierTH3.R4.1
Authors Ajaykrishnan Nageswaran, Prakash Narayan, University of Maryland, College Park, United States
Session Information Theoretic Privacy
Location Odéon, Level 3
Session Time Thursday, 11 July, 14:30 - 16:10
Presentation Time Thursday, 11 July, 14:30 - 14:50
Manuscript  Click here to download the manuscript
Abstract For a given function of user data, a querier must recover with at least a prescribed probability, the value of the function based on a user-provided query response. Subject to this requirement, the user forms its query response so as to maximize probability of error-based predicate privacy or list privacy of the data from the querier. Achievability schemes with explicit randomization mechanisms for query responses are given and their privacies compared with converse upper bounds.