Results 1  10
of
13
Securing Broadcast Against Dishonest Receivers
"... Abstract—Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure ca ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other’s message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions. I.
Exploiting Common Randomness: a Resource for Network Secrecy
 in IEEE Information Theory Workshop (ITW
, 2013
"... Abstract—We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they bo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases. I.
Secure Network Coding with Erasures and Feedback
"... Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.
Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding
, 2013
"... ..."
1Private Broadcasting over Independent Parallel Channels
"... Abstract—We study broadcasting of two confidential messages to two groups of receivers over independent parallel subchannels. One group consists of an arbitrary number of receivers, interested in a common message, whereas the other group has only one receiver. Each message must be confidential from ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—We study broadcasting of two confidential messages to two groups of receivers over independent parallel subchannels. One group consists of an arbitrary number of receivers, interested in a common message, whereas the other group has only one receiver. Each message must be confidential from the receiver(s) in the other group. Each of the subchannels is assumed to be degraded in a certain fashion. While corner points of the capacity region of this setup were characterized in earlier works, we establish the complete capacity region, and show the optimality of a superposition coding technique. For Gaussian channels we establish the optimality of a Gaussian input distribution by applying an extremal information inequality. By extending our coding scheme to blockfading channels we demonstrate significant performance gains over a baseline timesharing scheme. I.
Linear Network Coding Capacity for Broadcast Erasure Channels With Feedback, Receiver Coordination, and Arbitrary Security Requirement
"... Abstract—This work considers a commonly encountered wireless transmission scenario. The base station s would like to send two independent packet streams to clients d1 and d2, respectively. For each time slot, only one of the three nodes {s, d1, d2} can transmit a packet and the packet will be heard ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—This work considers a commonly encountered wireless transmission scenario. The base station s would like to send two independent packet streams to clients d1 and d2, respectively. For each time slot, only one of the three nodes {s, d1, d2} can transmit a packet and the packet will be heard by a random subset of the other two nodes. We are interested in the corresponding capacity region (R∗1, R∗2). Such a setting can also be viewed as allowing receiver coordination for the sto{d1, d2} broadcast erasure channel with a critical feature that any coordination/transmission between d1 and d2 also takes away the precious time resources from s. With the exclusive focus on linear network coding (LNC) with causal packet acknowledgement feedback, this work characterizes the exact LNC capacity region with arbitrary security requirement, i.e, the system designer can decide for each di, respectively, whether the corresponding (s, di)flow needs to be secure or not. The results show that for any channel parameters and any security requirement, the LNC capacity can always be achieved either by the XORintheair LNC scheme, or by random LNC, or by timesharing between the two. I.
1 Multiuser Broadcast Erasure Channel with Feedback — Capacity and Algorithms
, 2012
"... ar ..."
(Show Context)
1Multiuser Broadcast Erasure Channel with Feedback and Side Information, and Related Index Coding Results
"... We consider the Nuser broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally in wireless and in particular cognitive networks where a no ..."
Abstract
 Add to MetaCart
We consider the Nuser broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally in wireless and in particular cognitive networks where a node may overhear transmitted messages destined to other nodes before transmission over a given broadcast channel begins. We provide an upper bound to the capacity region of this system. Furthermore, when the side information is linear, we show that the bound is tight for the case of twouser broadcast channels. The special case where each user knows the whole or nothing of the message of each other node, constitutes a generalization of the index coding problem. For this instance, and when there are no channel errors, we show that the bound reduces to the known Maximum Weighted Acyclic Induced Subgraph bound. We also show how to convert the capacity upper bound to transmission completion rate (broadcast rate) lower bound and provide examples of codes for certain information graphs for which the bound is either achieved of closely approximated. Index Terms
1 Stable XORbased Policies for the Broadcast Erasure Channel with Feedback
"... ar ..."
(Show Context)