English
Related papers

Related papers: On Wiretap Networks II

200 papers

Providing security guarantees for wireless communication is critically important for today's applications. While previous work in this area has concentrated on radio frequency (RF) channels, providing security guarantees for RF channels is…

Information Theory · Computer Science 2015-03-13 Amine Laourine , Aaron B. Wagner

This paper addresses network code design for robust transmission of sources over an orthogonal two-hop wireless network with a broadcasting relay. The network consists of multiple sources and destinations in which each destination,…

Information Theory · Computer Science 2016-11-15 Roghayeh Joda , Farshad Lahouti

Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by…

Information Theory · Computer Science 2013-07-24 Maximilien Gadouleau

We consider the problem of private information retrieval through wiretap channel II (PIR-WTC-II). In PIR-WTC-II, a user wants to retrieve a single message (file) privately out of $M$ messages, which are stored in $N$ replicated and…

Information Theory · Computer Science 2018-01-19 Karim Banawan , Sennur Ulukus

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy…

Information Theory · Computer Science 2007-07-16 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

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

Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some…

Information Theory · Computer Science 2019-09-16 Han Cai , Johan Chrisnata , Tuvi Etzion , Moshe Schwartz , Antonia Wachter-Zeh

In this paper we show that the Index Coding problem captures several important properties of the more general Network Coding problem. An instance of the Index Coding problem includes a server that holds a set of information messages…

Information Theory · Computer Science 2008-05-12 Salim El Rouayheb , Alex Sprintson , Costas Georghiades

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2016-11-17 Igor Bjelakovic , Holger Boche , Jochen Sommerfeld

The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve…

Information Theory · Computer Science 2016-10-31 Anatoly Khina , Yuval Kochman , Ashish Khisti

Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the…

Information Theory · Computer Science 2011-12-15 Oliver Kosut , Lang Tong , David Tse

In this paper, we study the problem of securely computing a function over a network, where both the target function and the security function are vector linear. The network is modeled as a directed acyclic graph. A sink node wishes to…

Information Theory · Computer Science 2026-02-10 Min Xu , Qian Chen , Gennian Ge

We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources…

Information Theory · Computer Science 2008-05-28 R. Timo , A. Grant , T. Chan , G. Kramer

In [13] we proposed a ({\rho}_r , {\rho}_w )-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction {\rho}_r of the codeword sent over the channel, and modify a fraction {\rho}_w of the…

Information Theory · Computer Science 2014-01-21 Pengwei Wang , Reihaneh Safavi-Naini

We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of…

Information Theory · Computer Science 2009-01-16 Mohammad Hossein Yassaee , Mohammad Reza Aref

The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and…

Information Theory · Computer Science 2017-12-06 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can significantly increase the overall throughput of wireless networks by…

Information Theory · Computer Science 2007-07-13 Salim Y. El Rouayheb , Mohammad Asad R. Chaudhry , Alex Sprintson

This paper proposes a generic approach for providing enhanced security to communication systems which encode their data for reliability before encrypting it through a stream cipher for security. We call this counter-intuitive technique the…

Cryptography and Security · Computer Science 2010-08-06 Frederique Oggier , Miodrag J. Mihaljevic

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…

Information Theory · Computer Science 2020-03-10 Manos Athanasakos , Nicholas Kalouptsidis
‹ Prev 1 3 4 5 6 7 10 Next ›