English
Related papers

Related papers: Secure Multiterminal Source Coding with Side Infor…

200 papers

We introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under…

Information Theory · Computer Science 2007-07-16 Emin Martinian , Gregory W. Wornell , Ram Zamir

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers…

Information Theory · Computer Science 2020-04-16 Yucheng Liu , Parastoo Sadeghi , Neda Aboutorab , Arman Sharififar

We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Eve, to simulate a repeated action of a distributed quantum measurement using a pair of…

Information Theory · Computer Science 2020-08-17 Touheed Anwar Atif , Mohsen Heidari , S. Sandeep Pradhan

We present a new inner bound for the rate region of the $t$-stage successive-refinement problem with side-information. We also present a new upper bound for the rate-distortion function for lossy-source coding with multiple decoders and…

Information Theory · Computer Science 2016-11-17 Roy Timo , Terence Chan , Alexander Grant

The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…

Information Theory · Computer Science 2021-02-23 Lampros Gavalakis , Ioannis Kontoyiannis

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

Information Theory · Computer Science 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

Since the publication of Shannon's theory of one terminal source coding, a number of interesting extensions have been derived by researchers such as Slepian-Wolf, Wyner, Ahlswede-K\"{o}rner, Wyner-Ziv and Berger-Yeung. Specifically, the…

Information Theory · Computer Science 2007-07-13 Soumya Jana

The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message…

Information Theory · Computer Science 2021-08-10 Te Sun Han , Masahide Sasaki

Wireless communication provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Mojtaba Soltanalian , Sina Maleki , Symeon Chatzinotas , Björn Ottersten

We consider a two-user secure computation problem in which Alice and Bob communicate interactively in order to compute some deterministic functions of the inputs. The privacy requirement is that each user should not learn any additional…

Information Theory · Computer Science 2020-05-12 Gowtham R. Kurri , Vinod M. Prabhakaran

Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that…

Information Theory · Computer Science 2013-08-28 Ali Makhdoumi , Shao-Lun Huang , Muriel Medard , Yury Polyanskiy

Motivated by the problem of designing quantum repeaters, we study entanglement distillation between two parties, Alice and Bob, starting from a mixed state and with the help of "repeater" stations. To treat the case of a single repeater, we…

Quantum Physics · Physics 2015-03-17 Nicolas Dutil , Patrick Hayden

The problem of determining the best achievable performance of arbitrary lossless compression algorithms is examined, when correlated side information is available at both the encoder and decoder. For arbitrary source-side information pairs,…

Information Theory · Computer Science 2020-07-15 Lampros Gavalakis , Ioannis Kontoyiannis

In this paper, we investigate the robust outage constrained transmission design for an intelligent reflecting surface (IRS) aided secure communication system. We assume that a single-antenna legitimate receiver (Bob) served by a…

Signal Processing · Electrical Eng. & Systems 2024-10-30 Sheng Hong , Cunhua Pan , Gui Zhou , Hong Ren , Kezhi Wang

We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability between source symbols. The information leakage is measured by…

Information Theory · Computer Science 2021-02-04 Yucheng Liu , Lawrence Ong , Sarah Johnson , Joerg Kliewer , Parastoo Sadeghi , Phee Lep Yeoh

Consider a source that produces independent copies of a triplet of jointly distributed random variables, $\{X_{i},Y_{i},Z_{i}\}_{i=1}^{\infty}$. The process $\{X_{i}\}$ is observed at the encoder, and is supposed to be reproduced at two…

Information Theory · Computer Science 2008-12-18 Alina Maor , Neri Merhav

We consider distillation of secret bits from partially secret noisy correlations P_ABE, shared between two honest parties and an eavesdropper. The most studied distillation scenario consists of joint operations on a large number of copies…

Cryptography and Security · Computer Science 2008-05-12 Nick S. Jones , Lluis Masanes

In this work, we consider a scenario where two multiple-aperture legitimate nodes (Alice and Bob) communicate by means of Free-Space Optical (FSO) communication in the presence of a multiple-aperture eavesdropper (Eve), which is subject to…

Information Theory · Computer Science 2018-03-08 Marcos Eduardo Pivaro Monteiro , João Luiz Rebelatto , Glauber Brante , Richard Demo Souza

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to…

Information Theory · Computer Science 2019-09-12 Jaume del Olmo , Javier R. Fonollosa
‹ Prev 1 8 9 10 Next ›