IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Private broadcasting with probing constraint

Y. Ozan Basciftci, C. Emre Koksal

Published Jun 1, 2014• 1 citation

Abstract

We consider a three-receiver wiretap channel in which the transmitter aims to send a common message to legitimate receivers 1 and 2 while keeping it secret from the receiver 3 (eavesdropper). The transmitter takes cost constrained actions to probe the transmitter-to-receiver 1 and transmitter-to-receiver 2 channels. Under the probing cost constraint, we provide a lower bound to the secrecy capacity of this setting. The achievability strategy employs a block Markov coding strategy in which the channel state sequence of the previous block is mapped to a key which secures the part of the confidential message to be transmitted in the current block. The challenge in using the state sequence as a source of the key is the fact that the legitimate receivers are not aware of each other's channel state. To that end, we employ a novel strategy in which the transmitter takes XOR of individual keys generated from the state sequences of transmitter-to receiver 1 and transmitter-to-receiver 2 channels and send the XOR-ed key along with the confidential message. We furthermore analyze the trade-off between the achievable secrecy rate and the probing cost constraint. We conclude that there is a linear dependency between the key rate and probing cost constraint.

DOI: 10.1109/spawc.2014.6941819

Related papers

On the secrecy capacity of 3-receiver Broadcast Channel with causal states and conferencing

Sadaf Salehkalaibar, Mohammad Reza Aref

We investigate the secrecy capacity region of 2-receiver, 1-eavesdropper Broadcast Channel (BC) with two causal states and conferencing decoders. The encoder sends two messages, one of them for both legitimate receivers and the other one for the first legitimate receiver. It keeps these messages secret from the eavesdropper. Each state is causally available at the corresponding receiver, while both states are known causally at the encoder. Each receiver wishes to send the state which is not available at the other receiver, through a noiseless link with limited capacity. We find an inner bound on the secrecy capacity region of this channel. The achievability scheme employs block Markov coding and Shannon strategy for channels with state. In each block, we make use of the states to generate two keys which will be used in the next block. The idea is to utilize the cooperation of both receivers to recover both keys at each receiver while ensuring secrecy. We also establish an outer bound on the secrecy capacity region of the 2-rec, 1-eav. BC with Causal Channel State Information (CCSI) and conferencing. We prove that the proposed bounds coincide for a special case.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20120 citations

Wiretap channel with causal state information

Yeow-Khiang Chia, Abbas El Gamal

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 and Chen. Achievability is proved using block Markov coding, Shannon strategy, and key generation from common state information. The state sequence available at the end of each block is used to generate a key, which is used to enhance the transmission rate of the confidential message in the following block. An upper bound on the secrecy capacity when the state is available noncausally at the encoder and decoder is established and is shown to coincide with the lower bound for several classes of wiretap channels with state.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201010 citations

Wiretap Channel With Causal State Information

Yeow-Khiang Chia, Abbas El Gamal

A lower bound on the secrecy capacity of the wiretap channel with state information available causally at both the encoder and the decoder is established. The lower bound is shown to be strictly larger than that for the noncausal case by Liu and Chen. Achievability is proved using block Markov coding, Shannon strategy, and key generation from common state information. The state sequence available at the end of each block is used to generate a key to enhance the transmission rate of the confidential message in the following block. An upper bound on the secrecy capacity when the state is available noncausally at the encoder and the decoder is established and is shown to coincide with the aforementioned lower bound for several classes of wiretap channels with state.

IEEE Transactions on Information TheoryJan 31, 201278 citations

Wiretap Channel with Causal State Information

Yeow-Khiang Chia, Abbas El Gamal

arXiv:1001.2327Jan 13, 20105 citations

Secure Broadcasting Using Independent Secret Keys

Rafael F. Schaefer, Ashish J. Khisti, H. Vincent Poor

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of it. The transmitter shares independent secret keys of sufficiently high rates with both legitimate receivers, which can be used in different ways: they can be used as one-time pads to encrypt the common message, as fictitious messages for wiretap coding, or as a hybrid of these. In this paper, capacity results are established when the broadcast channels involving the three receivers are degraded. If both legitimate channels are degraded versions of the eavesdropper's channel, it is shown that the one-time pad approach is optimal for several cases, yielding corresponding capacity expressions. Alternatively, the wiretap coding approach is shown to be optimal if the eavesdropper's channel is degraded with respect to both legitimate channels, establishing capacity in this case as well. If the eavesdropper's channel is neither the strongest nor the weakest, an intricate scheme that carefully combines both concepts of one-time pad and wiretap coding with fictitious messages turns out to be capacity-achieving. Finally we also obtain some results for the general non-degraded broadcast channel.

arXiv:1706.05861IEEE Transactions on CommunicationsOct 20, 201734 citations

On the secrecy capacity of the broadcast wiretap channel with limited CSI feedback

Amal Hyadi, Zouheir Rezki, Mohamed‐Slim Alouini

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. First, we partially characterize the ergodic secrecy capacity of the system when the source broadcasts the same information to all the receivers, i.e., common message transmission. Then, we look at the independent messages case, where the transmitter broadcasts multiple independent messages to the legitimate receivers. For this case, we present lower and upper bounds on the ergodic secrecy sum-capacity. In both scenarios, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback links becomes large, hence, fully characterizing the secrecy capacity in this case.

arXiv:1603.06877IEEE Information Theory Workshop (ITW)Sep 1, 20163 citations