Channel Leakage, Information-Theoretic Limitations of Obfuscation, and
Optimal Privacy Mask Design for Streaming Data
- URL: http://arxiv.org/abs/2008.04893v5
- Date: Tue, 29 Sep 2020 21:15:37 GMT
- Title: Channel Leakage, Information-Theoretic Limitations of Obfuscation, and
Optimal Privacy Mask Design for Streaming Data
- Authors: Song Fang and Quanyan Zhu
- Abstract summary: We first introduce the notion of channel leakage as the minimum mutual information between the channel input and channel output.
In a broad sense, it can be viewed as a dual concept of channel capacity, which characterizes the maximum information transmission to the targeted receiver.
We then utilize this notion to investigate the fundamental limitations of obfuscation in terms of privacy-distortion tradeoffs.
- Score: 23.249999313567624
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we first introduce the notion of channel leakage as the
minimum mutual information between the channel input and channel output. As its
name indicates, channel leakage quantifies the minimum information leakage to
the malicious receiver. In a broad sense, it can be viewed as a dual concept of
channel capacity, which characterizes the maximum information transmission to
the targeted receiver. We obtain explicit formulas of channel leakage for the
white Gaussian case, the colored Gaussian case, and the fading case. We then
utilize this notion to investigate the fundamental limitations of obfuscation
in terms of privacy-distortion tradeoffs (as well as privacy-power tradeoffs)
for streaming data; particularly, we derive analytical tradeoff equations for
the stationary case, the non-stationary case, and the finite-time case. Our
results also indicate explicitly how to design the privacy masks in an optimal
way.
Related papers
- Security for adversarial wiretap channels [4.383205675898942]
We analyze information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code.
We show that this also holds for certain channel types with memory.
arXiv Detail & Related papers (2024-04-02T09:22:40Z) - Optimal Private Discrete Distribution Estimation with One-bit Communication [63.413106413939836]
We consider a private discrete distribution estimation problem with one-bit communication constraint.
We characterize the first-orders of the worst-case trade-off under the one-bit communication constraint.
These results demonstrate the optimal dependence of the privacy-utility trade-off under the one-bit communication constraint.
arXiv Detail & Related papers (2023-10-17T05:21:19Z) - Simultaneous superadditivity of the direct and complementary channel
capacities [0.0]
We show that coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses.
For a varying number of channel uses, we show that these quantities can obey different interleaving sequences of inequalities.
arXiv Detail & Related papers (2023-01-12T16:58:12Z) - Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
This paper studies the study of fault-tolerant channel coding for quantum channels.
We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario.
We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
arXiv Detail & Related papers (2022-10-06T14:09:16Z) - Over-the-Air Federated Learning with Privacy Protection via Correlated
Additive Perturbations [57.20885629270732]
We consider privacy aspects of wireless federated learning with Over-the-Air (OtA) transmission of gradient updates from multiple users/agents to an edge server.
Traditional perturbation-based methods provide privacy protection while sacrificing the training accuracy.
In this work, we aim at minimizing privacy leakage to the adversary and the degradation of model accuracy at the edge server.
arXiv Detail & Related papers (2022-10-05T13:13:35Z) - Denoising Diffusion Error Correction Codes [92.10654749898927]
Recently, neural decoders have demonstrated their advantage over classical decoding techniques.
Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders.
We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
arXiv Detail & Related papers (2022-09-16T11:00:50Z) - Data-free Backdoor Removal based on Channel Lipschitzness [8.273169655380896]
Recent studies have shown that Deep Neural Networks (DNNs) are vulnerable to the backdoor attacks.
In this work, we introduce a novel concept called Channel Lipschitz Constant (CLC), which is defined as the Lipschitz constant of the mapping from the input images to the output of each channel.
Since UCLC can be directly calculated from the weight matrices, we can detect the potential backdoor channels in a data-free manner.
arXiv Detail & Related papers (2022-08-05T11:46:22Z) - Short Blocklength Wiretap Channel Codes via Deep Learning: Design and
Performance Evaluation [5.203329540700176]
We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees.
We handle the reliability constraint via an autoencoder, and handle the secrecy constraint with hash functions.
For blocklengths smaller than or equal to 16, we evaluate through simulations the probability of error at the legitimate receiver.
arXiv Detail & Related papers (2022-06-07T17:52:46Z) - Semantic Security with Infinite Dimensional Quantum Eavesdropping
Channel [19.275181096881454]
We propose a new proof method for direct coding theorems for wiretap channels.
The method yields errors that decay exponentially with increasing block lengths.
It provides a guarantee of a quantum version of semantic security.
arXiv Detail & Related papers (2022-05-16T13:25:56Z) - Classical State Masking over a Quantum Channel [78.7611537027573]
Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
Regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
arXiv Detail & Related papers (2021-09-26T16:29:27Z) - DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO
Detection [98.43451011898212]
In multiuser multiple-input multiple-output (MIMO) setups, where multiple symbols are simultaneously transmitted, accurate symbol detection is challenging.
We propose a data-driven implementation of the iterative soft interference cancellation (SIC) algorithm which we refer to as DeepSIC.
DeepSIC learns to carry out joint detection from a limited set of training samples without requiring the channel to be linear.
arXiv Detail & Related papers (2020-02-08T18:31:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.