Data Privacy for a \rho -Recoverable Function
From MaRDI portal
Publication:5224009
DOI10.1109/TIT.2019.2894147zbMATH Open1432.94154arXiv1802.07851OpenAlexW2911507935MaRDI QIDQ5224009FDOQ5224009
Authors: Ajaykrishnan Nageswaran, Prakash Narayan 
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A user's data is represented by a finite-valued random variable. Given a function of the data, a querier is required to recover, with at least a prescribed probability, the value of the function based on a query response provided by the user. The user devises the query response, subject to the recoverability requirement, so as to maximize privacy of the data from the querier. Privacy is measured by the probability of error incurred by the querier in estimating the data from the query response. We analyze single and multiple independent query responses, with each response satisfying the recoverability requirement, that provide maximum privacy to the user. In the former setting, we also consider privacy for a predicate of the user's data. Achievability schemes with explicit randomization mechanisms for query responses are given and their privacy compared with converse upper bounds.
Full work available at URL: https://arxiv.org/abs/1802.07851
Cited In (1)
This page was built for publication: Data Privacy for a $\rho$ -Recoverable Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224009)
