Entropy

Secrecy Capacity of the Extended Wiretap Channel II with Noise

Dan Nong He, Wangmei Guo, Yuan Luo

Published Oct 31, 2016• 1 citation

Abstract

The secrecy capacity of an extended communication model of wiretap channelII is determined. In this channel model, the source message is encoded into a digital sequence of length N and transmitted to the legitimate receiver through a discrete memoryless channel (DMC). There exists an eavesdropper who is able to observe arbitrary μ = N α digital symbols from the transmitter through a second DMC, where 0 ≤ α ≤ 1 is a constant real number. A pair of an encoder and a decoder is designed to let the receiver be able to recover the source message with a vanishing decoding error probability and keep the eavesdropper ignorant of the message. This communication model includes a variety of wiretap channels as special cases. The coding scheme is based on that designed by Ozarow and Wyner for the classic wiretap channel II.

DOI: 10.3390/e18110377

Related papers

Strong secrecy capacity of the wiretap channel II with DMC main channel

Dan Nong He, Yuan Luo, Ning Cai

This paper considers an extension of wiretap channel II, where the source message W is transmitted to the legitimate receiver via a discrete memoryless main channel (DMC). Receiving YN, the receiver needs to recover W with small error probability. Meanwhile, an eavesdropper is able to observe arbitrary subsequence of YNwith size μ = Nα, where 0 <; α <; 1 is a constant real number. The encoding-decoding scheme is designed to satisfy a strong secrecy criterion, i.e. the information of each block (instead of each bit) exposed to the eavesdropper is negligible or arbitrarily close to 0 when N is sufficiently large. We focus on the secrecy capacity of this model.

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

A New Wiretap Channel Model and Its Strong Secrecy Capacity

Mohamed Nafea, Aylin Yener

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted code word symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases, and is termed as the generalized wiretap channel for that reason. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at the wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the generalized wiretap channel by the secrecy capacity when the tapped subset is randomly chosen by nature.

IEEE Transactions on Information TheoryDec 22, 201726 citations

A New Wiretap Channel Model and its Strong Secrecy Capacity

Mohamed Nafea, Aylin Yener

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the new wiretap channel model by the secrecy capacity when the tapped subset is randomly chosen by nature.

arXiv:1701.07007Jan 24, 20170 citations

A new multiple access wiretap channel model

Mohamed Nafea, Aylin Yener

A new model for the two-user multiple-access wiretap channel is considered. In this model, the legitimate (main) channel is a discrete memoryless channel (DMC), and the wiretapper chooses a fixed-length subset of the channel uses where she has perfect access to the transmitted symbols of the both users, while observing the remainder of the transmitted codewords through a second DMC. As such, it generalizes the existing multiple-access wiretap channel models and extends the recently proposed new wiretap channel model to a multiple access setting. An achievable strong secrecy rate region for the model is derived. The achievability is established by solving a dual multi-terminal secret key agreement problem in the source model, where two independent sources are communicating confidential keys to a common decoder over a public channel in the presence of a compound wiretapping source. The secrecy of the two keys in the dual source model is established by deriving a lemma which provides a doubly exponential convergence rate for the probability of the keys being uniform and independent from the public discussion and the wiretapping source observation.

IEEE Information Theory Workshop (ITW)Sep 1, 20165 citations

Secrecy Capacity of Wiretap Channels with Additive Colored Gaussian Noise

Hachiro Fujita

Wyner has shown in his seminal paper on (discrete memoryless) wiretap channels that if the channel between the sender and an eavesdropper is a degraded version of the channel between the sender and the legitimate receiver, then the sender can reliably and securely transmit a message to the receiver, while the eavesdropper obtains absolutely no information about the message. Later, Leung-Yan-Cheong and Hellman extended Wyner's result to the case where the noise is white Gaussian. In this paper we extend the white Gaussian wiretap channel to the colored Gaussian case and show the finite block length secrecy capacity of colored Gaussian wiretap channels. We also show the asymptotic secrecy capacity of a specific colored Gaussian wiretap channel for which optimal power allocation can be found by a water-filling procedure.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20150 citations

Compound Wiretap Channels

Yingbin Liang, Gerhard G. Kramer, H. Vincent Poor +1 more

This paper considers the compound wiretap channel, which generalizes Wyner's wiretap model to allow the channels to the (legitimate) receiver and to the eavesdropper to take a number of possible states. No matter which states occur, the transmitter guarantees that the receiver decodes its message and that the eavesdropper is kept in full ignorance about the message. The compound wiretap channel can also be viewed as a multicast channel with multiple eavesdroppers, in which the transmitter sends information to all receivers and keeps the information secret from all eavesdroppers. For the discrete memoryless channel, lower and upper bounds on the secrecy capacity are derived. The secrecy capacity is established for the degraded channel and the semideterministic channel with one receiver. The parallel Gaussian channel is further studied. The secrecy capacity and the secrecy degree of freedom ( ) are derived for the degraded case with one receiver. Schemes to achieve the for the case with two receivers and two eavesdroppers are constructed to demonstrate the necessity of a prefix channel in encoder design. Finally, the multi-antenna (i.e., MIMO) compound wiretap channel is studied. The secrecy capacity is established for the degraded case and an achievable is given for the general case.

EURASIP Journal on Wireless Communications and NetworkingOct 20, 2009309 citations