English
Related papers

Related papers: A Numerical Study on the Wiretap Network with a Si…

200 papers

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener

Consider a communication network represented by a directed graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of nodes and $\mathcal{E}$ is the set of point-to-point channels in the network. On the network a…

Information Theory · Computer Science 2014-10-14 Fan Cheng , Raymond W. Yeung

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…

Information Theory · Computer Science 2015-03-20 Fan Cheng , Raymond W. Yeung , Kenneth W. Shum

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side…

Information Theory · Computer Science 2007-07-13 Neri Merhav

We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume that the network implements network coding techniques to…

Information Theory · Computer Science 2008-07-08 Salim El Rouayheb , Emina Soljanin

We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network edges of its choice. We assume that the network employs the network coding technique to…

Information Theory · Computer Science 2009-07-22 Salim El Rouayheb , Emina Soljanin , Alex Sprintson

The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver $n$ packets from source to each receiver, and the wiretapper can eavesdrop…

Information Theory · Computer Science 2016-11-17 Danilo Silva , Frank R. Kschischang

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The…

Information Theory · Computer Science 2018-02-07 Mohamed Nafea , Aylin Yener

Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

A lower bound on the secrecy capacity of the wiretap channel with state information available causally at both the encoder and decoder is established. The lower bound is shown to be strictly larger than that for the noncausal case by Liu…

Information Theory · Computer Science 2010-06-03 Yeow-Khiang Chia , Abbas El Gamal

The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is "noisier" than the channel from sender to receiver. It…

Information Theory · Computer Science 2015-03-20 Mihir Bellare , Stefano Tessaro , Alexander Vardy

We consider the problem of encoding a deterministic source sequence (a.k.a.\ individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite--state machines. Our first main…

Information Theory · Computer Science 2022-01-05 Neri Merhav

In this paper we consider the problem of secure network coding where an adversary has access to an unknown subset of links chosen from a known collection of links subsets. We study the capacity region of such networks, commonly called…

Information Theory · Computer Science 2013-11-26 Shirin Jalali , Tracey Ho

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

A new generalised approach for multiple correlated sources over a wiretap network is investigated. A basic model consisting of two correlated sources where each produce a component of the common information is initially investigated. There…

Information Theory · Computer Science 2014-10-06 Reevana Balmahoon , Ling Cheng

In this paper, we explore the connection between secret key agreement and secure omniscience within the setting of the multiterminal source model with a wiretapper who has side information. While the secret key agreement problem considers…

Information Theory · Computer Science 2023-07-28 Praneeth Kumar Vippathalla , Chung Chan , Navin Kashyap , Qiaoqiao Zhou

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…

Information Theory · Computer Science 2016-11-15 Ashish Khisti , Gregory Wornell

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of…

Information Theory · Computer Science 2012-11-20 Theodoros K. Dikaliotis , Hongyi Yao , Tracey Ho , Michelle Effros , Joerg Kliewer
‹ Prev 1 2 3 10 Next ›