Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Acoustics Speech and Signal Processing

Optimal transceiver design for wiretap channels with side information

Holger Boche, Rafael F. Schaefer

Published May 1, 2013• 2 citations
Publisher

Abstract

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.

DOI
10.1109/icassp.2013.6638186

Related papers

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

Holger Boche, Rafael F. Schaefer

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.

IEEE Transactions on Information Forensics and Security•Jun 27, 2013•20 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 Communications•Jun 1, 2013•1 citation

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 Processing•May 1, 2014•2 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 Security•Oct 1, 2014•4 citations

Imperfect secrecy in wiretap channel II

Fan Cheng, Raymond W. Yeung, Kenneth W. Shum

In a point-to-point communication system which consists of a sender s, a receiver t and a set of noiseless channels, the senders wants to transmit a private message to the receiver t through the channels which may be eavesdropped by a wiretapper. The wiretapper can access any one but not more than one set of channels, which is referred to as a wiretap set. It is assumed that from each wiretap set, the wiretapper can obtain some partial information about the private message which is measured by the wiretapper's equivocation. The security strategy is to encode the message with some random key. Under these settings, we define an achievable rate tuple in terms of the message, the key and the wiretapper's equivocation, and prove a tight rate region of the rate tuples.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•7 citations

Wiretap Channel with Information Embedding on Actions

Xinxing Yin, Zhi Xue

Information embedding on actions is a new channel model in which a specific decoder is used to observe the actions taken by the encoder and retrieve part of the message intended for the receiver. We revisit this model and consider a different scenario where a secrecy constraint is imposed. By adding a wiretapper in the model, we aim to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible. We characterize the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information. Furthermore, the lower and upper bounds on the sum secrecy capacity are also obtained. Besides, by eliminating the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove it is tighter than the existing outer bound. A binary example is presented to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint. We find that the secrecy constraint and the communication requirements of information embedding have a negative impact on improving the secrecy transmission rate of the given communication link.

Entropy•Apr 14, 2014•4 citations
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.
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.
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.
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.
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.
In a point-to-point communication system which consists of a sender s, a receiver t and a set of noiseless channels, the senders wants to transmit a private message to the receiver t through the channels which may be eavesdropped by a wiretapper. The wiretapper can access any one but not more than one set of channels, which is referred to as a wiretap set. It is assumed that from each wiretap set, the wiretapper can obtain some partial information about the private message which is measured by the wiretapper's equivocation. The security strategy is to encode the message with some random key. Under these settings, we define an achievable rate tuple in terms of the message, the key and the wiretapper's equivocation, and prove a tight rate region of the rate tuples.
Information embedding on actions is a new channel model in which a specific decoder is used to observe the actions taken by the encoder and retrieve part of the message intended for the receiver. We revisit this model and consider a different scenario where a secrecy constraint is imposed. By adding a wiretapper in the model, we aim to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible. We characterize the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information. Furthermore, the lower and upper bounds on the sum secrecy capacity are also obtained. Besides, by eliminating the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove it is tighter than the existing outer bound. A binary example is presented to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint. We find that the secrecy constraint and the communication requirements of information embedding have a negative impact on improving the secrecy transmission rate of the given communication link.