English
Related papers

Related papers: On Secure Network Coding for Two Unicast Sessions

200 papers

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…

Information Theory · Computer Science 2015-03-19 Xiaolin Li , Ryutaroh Matsumoto

In secure network coding, there is a possibility that the eavesdropper can improve her performance when she changes (contaminates) the information on the attacked edges (active attack) and chooses the attacked edges adaptively (adaptive…

Information Theory · Computer Science 2024-09-10 Ning Cai , Masahito Hayashi

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the strong secrecy condition with respect to an outside observer of…

Information Theory · Computer Science 2020-09-04 Giulia Cervia , German Bassi , Mikael Skoglund

When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted…

Information Theory · Computer Science 2011-03-01 Bobak Nazer , Michael Gastpar

We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two…

Information Theory · Computer Science 2016-12-06 Remi A. Chou , Badri Vellambi , Matthieu Bloch , Joerg Kliewer

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

This paper studies the problem of transmitting multiple independent layered video streams over single-hop wireless networks using network coding (NC). We combine feedback-free random linear NC (RLNC) with unequal error protection (UEP) and…

Information Theory · Computer Science 2014-09-04 Mohammad Esmaeilzadeh , Neda Aboutorab

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

We consider the problem of secure communication over a noiseless 1-2-1 network, an abstract model introduced to capture the directivity characteristic of mmWave communications. We focus on structured networks, which we refer to as 1-2-1…

Information Theory · Computer Science 2024-05-10 Mohammad Milanian , Minoh Jeong , Martina Cardone

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

Information Theory · Computer Science 2008-12-02 Ersen Ekrem , Sennur Ulukus

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

This work considers the smart repeater network where a single source $s$ wants to send two independent packet streams to destinations $\{d_1,d_2\}$ with the help of relay $r$. The transmission from $s$ or $r$ is modeled by packet erasure…

Information Theory · Computer Science 2016-05-05 Jaemin Han , Chih-Chun Wang

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…

Information Theory · Computer Science 2016-07-18 Tulika Agrawal , Samar Agnihotri

We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…

Information Theory · Computer Science 2009-01-05 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

Recently, network coding technique has emerged as a promising approach that supports reliable transmission over wireless loss channels. In existing protocols where users have no interest in considering the encoded packets they had in coding…

Information Theory · Computer Science 2010-09-16 Zhiheng Zhou , Liang Zhou , Yuanquan Tan , Xing Wang

In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing,…

Information Theory · Computer Science 2017-07-20 Chao Qi , Yanling Chen , A. J. Han Vinck , Xiaohu Tang

In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at…

Information Theory · Computer Science 2014-09-15 Peter Babarczi , Janos Tapolcai , Lajos Ronyai , Muriel Medard

We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 from [1].

Information Theory · Computer Science 2008-11-04 Jasper Goseling , Jos. H. Weber