English
Related papers

Related papers: Secure Lossy Source Coding with Side Information a…

200 papers

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…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund

A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the…

Information Theory · Computer Science 2014-10-07 Eva C. Song , Paul Cuff , H. Vincent Poor

We consider a secure source coding problem with side information (S.I.) at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate limited link to a legitimate decoder.…

Information Theory · Computer Science 2013-07-04 Yeow-Khiang Chia , Kittipong Kittichokechai

The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem…

Information Theory · Computer Science 2022-11-10 Onur Günlü , Rafael F. Schaefer , Holger Boche , H. Vincent Poor

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

We consider a secure source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X and wishes to transmit this source losslessly to Bob over a rate-limited link.…

Information Theory · Computer Science 2012-12-10 Ravi Tandon , Sennur Ulukus , Kannan Ramchandran

The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the…

Information Theory · Computer Science 2007-08-01 Chao Tian , Suhas N. Diggavi

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external…

Information Theory · Computer Science 2013-07-05 Kittipong Kittichokechai , Yeow-Khiang Chia , Tobias J. Oechtering , Mikael Skoglund , Tsachy Weissman

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv…

Information Theory · Computer Science 2013-02-11 Behzad Ahmadi , Osvaldo Simeone

We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…

Information Theory · Computer Science 2014-06-25 Kittipong Kittichokechai , Tobias J. Oechtering , Mikael Skoglund

In this work, we investigate two source coding models, a \emph{Helper} problem and a \emph{Gray-Wyner} problem, under equivocation constraints. Specifically, in the Helper problem, an encoder communicates with a legitimate receiver through…

Information Theory · Computer Science 2017-01-16 Meryem Benammar , Abdellatif Zaidi

We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such distortion side information can model reliabilities for noisy measurements,…

Information Theory · Computer Science 2014-11-17 Emin Martinian , Gregory W. Wornell , Ram Zamir

Advancing over up-to-date information theoretic results that assume symmetric correlation models, in this work we consider the problem of lossy binary source coding with side information, where the correlation is expressed by a generic…

Information Theory · Computer Science 2016-11-17 Andrei Sechelea , Samuel Cheng , Adrian Munteanu , Nikos Deligiannis

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and…

Information Theory · Computer Science 2010-04-07 Somayeh Salimi , Mahmoud Salmasizadeh , Mohammad Reza Aref

We investigate two source coding problems with secrecy constraints. In the first problem we consider real--time fully secure transmission of a memoryless source. We show that although classical variable--rate coding is not an option since…

Information Theory · Computer Science 2012-05-16 Yonatan Kaspi , Neri Merhav
‹ Prev 1 2 3 10 Next ›