IEEE International Symposium on Information Theory (ISIT)

The CEO problem with secrecy constraints

Farshad Naghibi, Somayeh Salimi, Mikael Skoglund

Published Jun 1, 2014• 7 citations

Abstract

A lossy source coding problem with secrecy constraints is considered where a remote information source should be transmitted to a single destination via multiple agents in the presence of an eavesdropper. The agents observe noisy versions of the source and independently encode and transmit their observations to the destination via noiseless rate-limited links. Unbeknownst to the agents, an eavesdropper intercepts one of the links from the agents to the destination to learn as much as possible about the source. The destination should estimate the remote source subject to a mean distortion threshold. This problem can be viewed as the CEO problem with addition of secrecy constraints. We establish inner and outer bounds on the rate-distortion-equivocation region. In addition, we provide the optimal rate-distortion-equivocation region for the quadratic Gaussian case when the eavesdropper has no side information.

DOI: 10.1109/isit.2014.6874934

Related papers

The CEO Problem With Secrecy Constraints

Farshad Naghibi, Somayeh Salimi, Mikael Skoglund

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy versions of the source and independently encode and transmit their observations to the destination via noiseless rate-limited links. The destination should estimate the remote source based on the information received from the agents within a certain mean distortion threshold. The eavesdropper, with access to side information correlated to the source, is able to listen in on one of the links from the agents to the destination in order to obtain as much information as possible about the source. This problem can be viewed as the so-called CEO problem with additional secrecy constraints. We establish inner and outer bounds on the rate-distortion-equivocation region of this problem. We also obtain the region in special cases where the bounds are tight. Furthermore, we study the quadratic Gaussian case and provide the optimal rate-distortion-equivocation region when the eavesdropper has no side information and an achievable region for a more general setup with side information at the eavesdropper.

arXiv:1502.03358IEEE Transactions on Information Forensics and SecurityFeb 13, 201514 citations

On transmission of a remote source with secrecy constraints over noisy channels

Farshad Naghibi, Somayeh Salimi, Mikael Skoglund

The problem of transmitting a remote source via multiple agents to a single destination is considered with secrecy constraints. In particular, noisy versions of a source are observed by multiple agents who then encode and transmit their observations to a decoder over dedicated noisy channel. The decoder should be able to reconstruct the remote source within a certain distortion limit. In addition, there exists an eavesdropper with correlated side information to the source who is capable of wiretapping the links from the agents to the decoder so as to extract as much information as possible about the source. Therefore, the agents should encode their observations in such a way that while as less information as possible is leaked to the eavesdropper the decoder can satisfy the distortion constraint. For this problem, we study the tradeoffs among agents' transmission rates, experienced distortion at the destination, and equivocation rates at the eavesdropper, and provide an achievable region.

IEEE Global Conference on Signal and Information ProcessingDec 1, 20140 citations

Secure Cooperative Source-Coding With Side Information at the Eavesdropper

Shraga I. Bross

In the secure cooperative source-coding problem that we consider, Encoder 1 and Decoder 1 observe, respectively, a pair of independent identically distributed (i.i.d.) correlated sources and wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a message to both the decoders over a public nonsecure channel, and then Decoder 1-the helper-sends a message just to Decoder 2 over a secure channel. An eavesdropper, which has access to memoryless side-information that is correlated with the first source, intercepts the message sent by Encoder 1 and based on both wishes to minimize its uncertainty about the first source. The secrecy measure of the system is the equivocation of the first source at the eavesdropper. We determine the rates equivocation region for this problem assuming that conditioned on the side-information of Decoder 1 the eavesdropper's side-information is independent of the first source. To that end, we derive an inner and an outer bound that depend explicitly on the proportional rate that Encoder 1 spends in the cooperation process. Subsequently, we evaluate this region for the case of a doubly symmetric binary source and Hamming distortion.

IEEE Transactions on Information TheoryMay 25, 20168 citations

Secure Multiterminal Source Coding With Side Information at the Eavesdropper

Joffrey Villard, Pablo Piantanida

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 rate-distortion-equivocation region are derived. The inner region turns to be tight for two cases: 1) uncoded side information at Bob and 2) 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 (respectively) 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 nonzero distortion at Bob can be fully exploited to guarantee secrecy.

arXiv:1105.1658IEEE Transactions on Information TheoryFeb 6, 201378 citations

Outer Bounds on the CEO Problem With Privacy Constraints

Vamoua Yachongka, Hideki Yagi, Hideki Ochiai

We investigate the rate-distortion-leakage region of the Chief Executive Officer (CEO) problem, considering the presence of a passive eavesdropper and privacy constraints. We start by examining the region where a general distortion measure quantifies the distortion. While the inner bound of the region is derived from previous work, this paper newly develops an outer bound. To derive the outer bound, we introduce a new lemma tailored for analyzing privacy constraints. Next, as a specific instance of the general distortion measure, we demonstrate that the tight bound for discrete and Gaussian sources is obtained when the eavesdropper has no side information, and the distortion is quantified by the log-loss distortion measure. We further investigate the rate-distortion-leakage region for a scenario where the eavesdropper has side information, and the distortion is quantified by the log-loss distortion measure and provide an outer bound for this case. The derived outer bound differs from the inner bound by only a minor quantity that appears in the constraints associated with the privacy-leakage rates, and these bounds match when the distortion is large.

arXiv:2301.12526IEEE Transactions on Information Forensics and SecurityDec 25, 20243 citations

Secure Lossy Transmission of Vector Gaussian Sources

Ersen Ekrem, Şennur Ulukuş

We study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. The aim of the transmitter is to describe the source to the legitimate user in a way that the legitimate user can reconstruct the source within a certain distortion level while the eavesdropper is kept ignorant of the source as much as possible as measured by the equivocation. We obtain an outer bound for the rate, equivocation and distortion region of this secure lossy transmission problem. This outer bound is tight when the transmission rate constraint is removed. In other words, we obtain the maximum equivocation at the eavesdropper when the legitimate user needs to reconstruct the source within a fixed distortion level while there is no constraint on the transmission rate. This characterization of the maximum equivocation involves two auxiliary random variables. We show that a nontrivial selection for both random variables may be necessary in general. The necessity of two auxiliary random variables also implies that, in general, Wyner-Ziv coding is suboptimal in the presence of an eavesdropper. In addition, we show that, even when there is no rate constraint on the legitimate link, uncoded transmission (deterministic or stochastic) is suboptimal; the presence of an eavesdropper necessitates the use of a coded scheme to attain the maximum equivocation.

IEEE Transactions on Information TheoryJun 3, 201315 citations