Secure Multiterminal Source Coding with Side Information at the Eavesdropper

Abstract

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously satisfying the desired requirements on the distortion level at a legitimate receiver (referred to as Bob) and the equivocation rate --average uncertainty-- at an eavesdropper (referred to as Eve). It is further assumed the presence of a (public) rate-limited link between Alice and Bob. In this setting, Eve perfectly observes the information bits sent by Alice to Bob and has also access to a correlated source which can be used as side information. A second encoder (referred to as Charlie) helps Bob in estimating Alice's source by sending a compressed version of its own correlated observation via a (private) rate-limited link, which is only observed by Bob. For instance, the problem at hands can be seen as the unification between the Berger-Tung and the secure source coding setups. Inner and outer bounds on the so called rates-distortion-equivocation region are derived. The inner region turns to be tight for two cases: (i) uncoded side information at Bob and (ii) lossless reconstruction of both sources at Bob --secure distributed lossless compression. Application examples to secure lossy source coding of Gaussian and binary sources in the presence of Gaussian and binary/ternary (resp.) side informations are also considered. Optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a non-zero distortion at Bob can be fully exploited to guarantee secrecy.

26 pages, 16 figures, 2 tables

References in corpus (3)

• Lecture Notes on Network Information Theory
• Construction of wiretap codes from ordinary channel codes
• Secure Lossy Source Coding with Side Information at the Decoders

Cited by in corpus (18)

• Learning Anonymized Representations with Adversarial Neural Networks
• Secure Transmission of Sources over Noisy Channels with Side Information at the Receivers
• The CEO Problem with Secrecy Constraints
• Secret Key Generation over Noisy Channels with Correlated Sources
• Interactive Secure Function Computation
• Source Coding Problems with Conditionally Less Noisy Side Information
• Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder
• Analysis of Remaining Uncertainties and Exponents under Various Conditional Rényi Entropies
• New Proofs of Extremal Inequalities With Applications
• Outer Bounds on the CEO Problem with Privacy Constraints
• Secure Block Source Coding with Sequential Encoding
• On Real-Time and Causal Secure Source Coding
• The Multi-layer Information Bottleneck Problem
• Wiretap Secret Key Agreement Via Secure Omniscience
• Zero-Delay and Causal Secure Source Coding
• Information Leakage of Correlated Source Coded Sequences over Channel with an Eavesdropper
• Correlated Source Coded Sequences with Compromised Channel and Source Symbols using Shannon's Cipher System
• Information Leakage of Heterogeneous Encoded Correlated Sequences over Eavesdropped Channel