Related papers: Random Linear Network Codes for Secrecy over Wirel…
We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'.…
This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded…
Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using…
This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…
The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…
In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the…
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…
This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…
We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…
In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…
This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
Network Coding is a packet encoding technique which has recently been shown to improve network performance (by reducing delays and increasing throughput) in broadcast and multicast communications. The cost for such an improvement comes in…
The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code…
Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version…
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…
Characterization of the delay profile of systems employing random linear network coding is important for the reliable provision of broadcast services. Previous studies focused on network coding over large finite fields or developed Markov…
In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more…
Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…
The 2-receiver broadcast channel is studied: a network with three parties where the transmitter and one of the receivers are the primarily involved parties and the other receiver considered as third party. The messages that are determined…