IEEE Transactions on Information Forensics and Security

Wiretap Channels With Side Information—Strong Secrecy Capacity and Optimal Transceiver Design

Holger Boche, Rafael F. Schaefer

Published Jun 27, 2013• 20 citations

Abstract

The wiretap channel models the communication scenario where two legitimate users want to communicate in such a way that a wiretapper is kept ignorant. In this paper, the wiretap channel with side information is studied, where the wiretapper has additional side information available. This side information allows the wiretapper to restrict the transmitted message to a certain subset of messages before further postprocessing. Two different criteria are employed to model the secrecy of the confidential message: the information theoretic criterion of strong secrecy and a signal-processing-inspired criterion based on the decoding performance of the wiretapper. For the latter, the wiretapper is required to have the worst decoding performance regardless of the specific decoding strategy that is used. It is shown that both criteria are equivalent in terms of secrecy capacity. Furthermore, the secrecy capacity equals the one of the classical wiretap channel without side information available at the wiretapper. In addition, the corresponding capacity-achieving code structure and optimal transceiver design are characterized and properties are identified. Finally, extensions to channel uncertainty and multiple wiretappers are discussed.

DOI: 10.1109/tifs.2013.2271424

Related papers

Optimal transceiver design for wiretap channels with side information

Holger Boche, Rafael F. Schaefer

The wiretap channel models the communication scenario where two legitimate users want to communicate in such a way that an external wiretapper is kept ignorant. In this paper, the wiretap channel with side information is studied, where the wiretapper has additional side information about the transmitted message available for post-processing. The secrecy of the message is modeled by the decoding performance of the wiretapper. It is required for the wiretapper to have worst behavior of decoding performance regardless of the decoding strategy that is used. The secrecy capacity is derived and shown to be equal to the one of the classical wiretap channel without side information available at the wiretapper. Further, the corresponding optimal transceiver design is characterized.

IEEE International Conference on Acoustics Speech and Signal ProcessingMay 1, 20132 citations

On the strong secrecy capacity of wiretap channels with side information

Holger Boche, Rafael F. Schaefer

The wiretap channel models the communication scenario where two legitimate users want to communicate in such a way that an external wiretapper is kept ignorant. In this paper the wiretap channel with side information is studied, where the wiretapper has additional side information about the transmitted message available for decoding. The corresponding secrecy capacity is derived and shown to be equal to the one of the classical wiretap channel without side information available at the wiretapper. Further, the capacity-achieving code structure is analyzed and properties are identified. Finally, channel uncertainty is taken into account and the results are extended to the compound wiretap channel with side information.

International Conference on CommunicationsJun 1, 20131 citation

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

On the use of secret keys in broadcast channels with receiver side information

Rafael F. Schaefer, Ashish J. Khisti, Holger Boche

The use of secret keys in broadcast channels with receiver side information is studied. The particular scenario is analyzed where a transmitter wants to send two confidential messages to two receivers, while keeping an external eavesdropper ignorant. Each receiver has one of the confidential messages as side information available for decoding. In addition to that, the transmitter shares independent secret keys of arbitrary rates with both receivers. The secret keys can be used in different ways: They can act as one-time pads to encrypt the confidential messages or they can be used as randomization resources for wiretap coding. Both approaches are discussed and an achievable rate region based on superposition coding is established for the one-time pad approach. For the wiretap coding approach, the secrecy capacity for degraded channels is derived. In the optimal coding scheme, the available secret keys are used as the randomization part of the wiretap code to keep the eavesdropper ignorant. In establishing the capacity region, a new upper bound on the sum-rate is derived. This bound shows that in an optimal coding scheme, in the degraded case, the total equivocation-rate of the (opposite) secret-keys at the legitimate receivers must equal the equivocation-rate of the secret-keys at the eavesdropper, when informed about the messages.

IEEE International Conference on Acoustics Speech and Signal ProcessingMay 1, 20142 citations

On secure communication over multiple access wiretap channels under channel uncertainty

Rafael F. Schaefer, H. Vincent Poor

The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.

IEEE Conference on Communications and Network SecurityOct 1, 20144 citations