We study privacy-utility trade-offs where users share privacy-correlated useful information with a service provider to obtain some utility. The service provider is adversarial in the sense that it can infer the users' private information based on the shared useful information. To minimize the privacy leakage while maintaining a desired level of utility, the users carefully perturb the useful information via a probabilistic privacy mapping before sharing it. We focus on the setting in which the adversary attempting an inference attack on the users' privacy has potentially biased information about the statistical correlation between the private and useful variables. This information asymmetry between the users and the limited adversary leads to better privacy guarantees than the case of the omniscient adversary under the same utility requirement. We first identify assumptions on the adversary's information so that the inference costs are well-defined and finite. Then, we characterize the impact of the information asymmetry and show that it increases the inference costs for the adversary. We further formulate the design of the privacy mapping against a limited adversary using a difference of convex functions program and solve it via the concave-convex procedure. When the adversary's information is not precisely available, we adopt a Bayesian view and represent the adversary's information by a probability distribution. In this case, the expected cost for the adversary does not admit a closed-form expression, and we establish and maximize a lower bound of the expected cost. We provide a numerical example regarding a census data set to illustrate the theoretical results.
翻译:在用户与服务提供商共享与隐私有关的有用信息以获得某种实用性时,我们研究隐私-使用权权衡,即用户与服务提供商共享与隐私有关的有用信息,从而获得某种实用性。服务提供商持敌对态度,因为根据共享有用信息可以推断用户的私人信息。为了尽可能减少隐私泄漏,同时保持理想的效用水平,用户在共享之前通过概率隐私映射对有用信息进行仔细扰动。我们侧重于对手试图对用户隐私进行推断攻击时,对私人和有用变量之间的统计相关性信息可能存在偏差。用户和有限对手之间的这种信息不对称导致的隐私保障比根据相同的实用性要求对万无所不觉的对手的情况进行更好的。我们首先确定对敌人信息的假设,以便准确界定和限定推断成本成本。然后我们确定信息不对称的影响,并表明它增加了对手的推断成本成本。我们进一步制定针对有限对手的隐私映射设计,使用连接功能程序的差异,并通过 convex 程序解决它。当敌人的超常识匹配对手的案例中,我们使用一种预期的数值列表,我们使用一种预估的数值,我们使用一种预估值数据,我们使用一种预估的预估值数据。