arXiv 1111.35672011-11cs.ITcs.CRmath.IT

On the Measurement of Privacy as an Attacker's Estimation Error

David Rebollo-Monedero, Javier Parra-Arnau, Claudia Diaz, Jordi Forné

备注：: This paper has 18 pages and 17 figures

英文摘要：

A wide variety of privacy metrics have been proposed in the literature to evaluate the level of protection offered by privacy enhancing-technologies. Most of these metrics are specific to concrete systems and adversarial models, and are difficult to generalize or translate to other contexts. Furthermore, a better understanding of the relationships between the different privacy metrics is needed to enable more grounded and systematic approach to measuring privacy, as well as to assist systems designers in selecting the most appropriate metric for a given application. In this work we propose a theoretical framework for privacy-preserving systems, endowed with a general definition of privacy in terms of the estimation error incurred by an attacker who aims to disclose the private information that the system is designed to conceal. We show that our framework permits interpreting and comparing a number of well-known metrics under a common perspective. The arguments behind these interpretations are based on fundamental results related to the theories of information, probability and Bayes decision.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker

We treat secret key extraction when the eavesdropper has correlated quantum states. We propose quantum privacy amplification theorems different from Renner's, which are based on quantum conditional Rényi entropy of order 1+s. Using those theorems, we derive an exponential decreasing rate for leaked information and the asymptotic equivocation rate, which have not been derived hitherto in the quantum setting.

2012-10-11cs.CRcs.ITmath.IT

An Information Theoretic Study of Timing Side Channels in Two-user Schedulers

Timing side channels in two-user schedulers are studied. When two users share a scheduler, one user may learn the other user's behavior from patterns of service timings. We measure the information leakage of the resulting timing side channel in schedulers serving a legitimate user and a malicious attacker, using a privacy metric defined as the Shannon equivocation of the user's job density. We show that the commonly used first-come-first-serve (FCFS) scheduler provides no privacy as the attacker is able to to learn the user's job pattern completely. Furthermore, we introduce an scheduling poli…

2013-06-14cs.CRcs.ITmath.IT

Fundamental Privacy Limits in Bipartite Networks under Active Attacks

This work considers active deanonymization of bipartite networks. The scenario arises naturally in evaluating privacy in various applications such as social networks, mobility networks, and medical databases. For instance, in active deanonymization of social networks, an anonymous victim is targeted by an attacker (e.g. the victim visits the attacker's website), and the attacker queries her group memberships (e.g. by querying the browser history) to deanonymize her. In this work, the fundamental limits of privacy, in terms of the minimum number of queries necessary for deanonymization, is inve…

2021-06-09cs.ITcs.SImath.IT

Real-Time Privacy-Preserving Data Release for Smart Meters

McGill University（麦吉尔大学）；CentraleSupélec（中央理工-高等电力学院）；CNRS（法国国家科学研究中心）；Université Paris Sud（巴黎第十一大学）；Montreal Institute for Learning Algorithms (Mila)（蒙特利尔学习算法研究所）；Université de Montréal（蒙特利尔大学）

Smart Meters (SMs) are able to share the power consumption of users with utility providers almost in real-time. These fine-grained signals carry sensitive information about users, which has raised serious concerns from the privacy viewpoint. In this paper, we focus on real-time privacy threats, i.e., potential attackers that try to infer sensitive information from SMs data in an online fashion. We adopt an information-theoretic privacy measure and show that it effectively limits the performance of any attacker. Then, we propose a general formulation to design a privatization mechanism that can…

2021-11-25cs.CRcs.ITcs.LG

$α$-互信息：一种用于数据共享隐私保护的可调隐私度量

$α$-Mutual Information: A Tunable Privacy Measure for Privacy Protection in Data Sharing

McGill University（麦吉尔大学）

本文提出以$α$-互信息作为可调隐私度量，通过对抗深度学习框架优化数据发布，在图像和时间序列数据上验证其优于互信息基线，并增强对侧信息攻击的鲁棒性。

2023-10-27cs.CRcs.ITcs.LG

Preserving Data-Privacy with Added Noises: Optimal Estimation and Privacy Analysis

Networked system often relies on distributed algorithms to achieve a global computation goal with iterative local information exchanges between neighbor nodes. To preserve data privacy, a node may add a random noise to its original data for information exchange at each iteration. Nevertheless, a neighbor node can estimate other's original data based on the information it received. The estimation accuracy and data privacy can be measured in terms of $(ε, δ)$-data-privacy, defined as the probability of $ε$-accurate estimation (the difference of an estimation and the original data is within $ε$) …

2017-03-17cs.ITmath.IT

更多相关论文收起更多论文

High-performance Estimation of Jamming Covariance Matrix for IRS-aided Directional Modulation Network with a Malicious Attacker

In this paper, we investigate the anti-jamming problem of a directional modulation (DM) system with the aid of intelligent reflecting surface (IRS). As an efficient tool to combat malicious jamming, receive beamforming (RBF) is usually designed to be on null-space of jamming channel or covariance matrix from Mallory to Bob. Thus, it is very necessary to estimate the receive jamming covariance matrix (JCM) at Bob. To achieve a precise JCM estimate, three JCM estimation methods, including eigenvalue decomposition (EVD), parametric estimation method by gradient descend (PEM-GD) and parametric est…

2021-10-22cs.ITeess.SPmath.IT

Estimation of Covariance Matrix of Interference for Secure Spatial Modulation against a Malicious Full-duplex Attacker

In a secure spatial modulation with a malicious full-duplex attacker, how to obtain the interference space or channel state information (CSI) is very important for Bob to cancel or reduce the interference from Mallory. In this paper, different from existing work with a perfect CSI, the covariance matrix of malicious interference (CMMI) from Mallory is estimated and is used to construct the null-space of interference (NSI). Finally, the receive beamformer at Bob is designed to remove the malicious interference using the NSI. To improve the estimation accuracy, a rank detector relying on Akaike …

2021-10-21cs.ITeess.SPmath.IT

Quantifying the Information Leakage in Timing Side Channels in Deterministic Work-Conserving Schedulers

When multiple job processes are served by a single scheduler, the queueing delays of one process are often affected by the others, resulting in a timing side channel that leaks the arrival pattern of one process to the others. In this work, we study such a timing side channel between a regular user and a malicious attacker. Utilizing Shannon's mutual information as a measure of information leakage between the user and attacker, we analyze privacy-preserving behaviors of common work-conserving schedulers. We find that the attacker can always learn perfectly the user's arrival process in a longe…

2014-05-15cs.ITmath.IT

Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation

We provide a detailed study of the estimation of probability distributions---discrete and continuous---in a stringent setting in which data is kept private even from the statistician. We give sharp minimax rates of convergence for estimation in these locally private settings, exhibiting fundamental tradeoffs between privacy and convergence rate, as well as providing tools to allow movement along the privacy-statistical efficiency continuum. One of the consequences of our results is that Warner's classical work on randomized response is an optimal way to perform survey sampling while maintainin…

2013-05-26cs.CRcs.ITmath.IT

Breaking the Communication-Privacy-Accuracy Trilemma

Stanford University（斯坦福大学）；Google（谷歌）

Two major challenges in distributed learning and estimation are 1) preserving the privacy of the local samples; and 2) communicating them efficiently to a central server, while achieving high accuracy for the end-to-end task. While there has been significant interest in addressing each of these challenges separately in the recent literature, treatments that simultaneously address both challenges are still largely missing. In this paper, we develop novel encoding and decoding mechanisms that simultaneously achieve optimal privacy and communication efficiency in various canonical settings. In pa…

2021-04-20cs.CRcs.ITcs.LG

Privacy-preserving Channel Estimation in Cell-free Hybrid Massive MIMO Systems

We consider a cell-free hybrid massive multiple-input multiple-output (MIMO) system with $K$ users and $M$ access points (APs), each with $N_a$ antennas and $N_r< N_a$ radio frequency (RF) chains. When $K\ll M{N_a}$, efficient uplink channel estimation and data detection with reduced number of pilots can be performed based on low-rank matrix completion. However, such a scheme requires the central processing unit (CPU) to collect received signals from all APs, which may enable the CPU to infer the private information of user locations. We therefore develop and analyze privacy-preserving channel…

2021-01-26cs.ITeess.SPmath.IT

Strong Privacy and Utility Guarantee: Over-the-Air Statistical Estimation

We consider the privacy problem of statistical estimation from distributed data, where users communicate to a central processor over a Gaussian multiple-access channel(MAC). To avoid the inevitable sacrifice of data utility for privacy in digital transmission schemes, we devise an over-the-air estimation strategy which utilizes the additive nature of MAC channel. Using the mutual information between the channel outputs and users' data as the metric, we obtain the privacy bounds for our scheme and validate that it can guarantee strong privacy without incurring larger estimation error. Further, …

2020-11-02cs.ITmath.ITmath.ST

Privacy and Statistical Risk: Formalisms and Minimax Bounds

We explore and compare a variety of definitions for privacy and disclosure limitation in statistical estimation and data analysis, including (approximate) differential privacy, testing-based definitions of privacy, and posterior guarantees on disclosure risk. We give equivalence results between the definitions, shedding light on the relationships between different formalisms for privacy. We also take an inferential perspective, where---building off of these definitions---we provide minimax risk bounds for several estimation problems, including mean estimation, estimation of the support of a di…

2014-12-15cs.ITmath.ITmath.ST