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

arXiv:1610.04215 · Allerton Conference on Communication, Control, and Computing

Partial strong converse for the non-degraded wiretap channel

Yi-Peng Wei, Şennur Ulukuş

Published Sep 1, 2016• 2 citations
arXivHTMLPDF

Abstract

We prove the partial strong converse property for the discrete memoryless non-degraded wiretap channel, for which we require the leakage to the eavesdropper to vanish but allow an asymptotic error probability ε ∈ [0, 1) to the legitimate receiver. We show that when the transmission rate is above the secrecy capacity, the probability of correct decoding at the legitimate receiver decays to zero exponentially. Therefore, the maximum transmission rate is the same for ε ∈ [0, 1), and the partial strong converse property holds. Our work is inspired by a recently developed technique based on information spectrum method and Chernoff-Cramer bound for evaluating the exponent of the probability of correct decoding.

DOI
10.1109/allerton.2016.7852274

Related papers

Information Spectrum Approach to Strong Converse Theorems for Degraded Wiretap Channels

Vincent Y. F. Tan, Matthieu R. Bloch

We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability ε but the leakage to the eavesdropper vanishes. For discrete memoryless and Gaussian wiretap channels, we show that the maximum rate of transmission does not depend on ε ϵ [0, 1), i.e., such channels possess the partial strong converse property. Furthermore, we derive sufficient conditions for the partial strong converse property to hold for memoryless but non-stationary symmetric and degraded wiretap channels. Our proof techniques leverage the information spectrum method, which allows us to establish a necessary and sufficient condition for the partial strong converse to hold for general wiretap channels without any information stability assumptions.

arXiv:1406.6758•IEEE Transactions on Information Forensics and Security•Sep 1, 2014•17 citations

Wiretap channel capacity: Secrecy criteria, strong converse, and phase change

Eric Graves, Tan F. Wong

This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements on the expected values and tail probabilities of the differences, in absolute value and in exponent, between the joint probability of the secret message and the eavesdropper's observation and the corresponding probability if they were independent. Some of these criteria reduce back to the standard leakage and variation distance constraints that have been previously considered in the literature. The capacities under these secrecy criteria are found to be different when non-vanishing error and secrecy tolerances are allowed. Based on these new results, we are able to conclude that the strong converse property generally holds for the DM-WTC only under the two secrecy criteria based on constraining the tail probabilities. Under the secrecy criteria based on the expected values, an interesting phase change phenomenon is observed as the tolerance values vary.

arXiv:1701.07347•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•4 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.

arXiv:1701.07007•IEEE Transactions on Information Theory•Dec 22, 2017•26 citations

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, 2016•9 citations

Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength

Wei Qing Yang, Rafael F. Schaefer, H. Vincent Poor

This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy rate is derived. Unlike the secrecy capacity, the second-order secrecy rate characterizes the optimal tradeoff between secrecy and reliability at finite blocklength.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•20 citations

Degraded Gaussian MIMO multi-receiver wiretap channel with public and confidential messages

Ersen Ekrem, Şennur Ulukuş

We study the degraded multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The legitimate users and the eavesdropper satisfy a certain degradation order. In this paper, we study this channel model for the scenario where the transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messages need to be transmitted in perfect secrecy. First, we obtain an inner bound for the capacity region of the discrete memoryless channel by using an achievable scheme that uses superposition coding and binning. Next, we obtain an outer bound for the capacity region of the degraded discrete memoryless channel. We show that this outer bound partially matches the inner bound. Consequently, we provide a partial characterization of the capacity region of the degraded discrete memoryless channel. Finally, we consider the degraded Gaussian multi-input multi-output (MIMO) wiretap channel with public and confidential messages. We show that, to evaluate both the inner and outer bounds for the Gaussian MIMO case, considering only jointly Gaussian auxiliary random variables and channel input is sufficient. Since the inner and outer bounds provided earlier for the degraded discrete memoryless channel partially match, these sufficiency results provide a partial characterization of the capacity region of the degraded Gaussian MIMO channel.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2010•1 citation
We prove the partial strong converse property for the discrete memoryless non-degraded wiretap channel, for which we require the leakage to the eavesdropper to vanish but allow an asymptotic error probability ε ∈ [0, 1) to the legitimate receiver. We show that when the transmission rate is above the secrecy capacity, the probability of correct decoding at the legitimate receiver decays to zero exponentially. Therefore, the maximum transmission rate is the same for ε ∈ [0, 1), and the partial strong converse property holds. Our work is inspired by a recently developed technique based on information spectrum method and Chernoff-Cramer bound for evaluating the exponent of the probability of correct decoding.
We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability ε but the leakage to the eavesdropper vanishes. For discrete memoryless and Gaussian wiretap channels, we show that the maximum rate of transmission does not depend on ε ϵ [0, 1), i.e., such channels possess the partial strong converse property. Furthermore, we derive sufficient conditions for the partial strong converse property to hold for memoryless but non-stationary symmetric and degraded wiretap channels. Our proof techniques leverage the information spectrum method, which allows us to establish a necessary and sufficient condition for the partial strong converse to hold for general wiretap channels without any information stability assumptions.
This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements on the expected values and tail probabilities of the differences, in absolute value and in exponent, between the joint probability of the secret message and the eavesdropper's observation and the corresponding probability if they were independent. Some of these criteria reduce back to the standard leakage and variation distance constraints that have been previously considered in the literature. The capacities under these secrecy criteria are found to be different when non-vanishing error and secrecy tolerances are allowed. Based on these new results, we are able to conclude that the strong converse property generally holds for the DM-WTC only under the two secrecy criteria based on constraining the tail probabilities. Under the secrecy criteria based on the expected values, an interesting phase change phenomenon is observed as the tolerance values vary.
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.
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.
This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy rate is derived. Unlike the secrecy capacity, the second-order secrecy rate characterizes the optimal tradeoff between secrecy and reliability at finite blocklength.
We study the degraded multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The legitimate users and the eavesdropper satisfy a certain degradation order. In this paper, we study this channel model for the scenario where the transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messages need to be transmitted in perfect secrecy. First, we obtain an inner bound for the capacity region of the discrete memoryless channel by using an achievable scheme that uses superposition coding and binning. Next, we obtain an outer bound for the capacity region of the degraded discrete memoryless channel. We show that this outer bound partially matches the inner bound. Consequently, we provide a partial characterization of the capacity region of the degraded discrete memoryless channel. Finally, we consider the degraded Gaussian multi-input multi-output (MIMO) wiretap channel with public and confidential messages. We show that, to evaluate both the inner and outer bounds for the Gaussian MIMO case, considering only jointly Gaussian auxiliary random variables and channel input is sufficient. Since the inner and outer bounds provided earlier for the degraded discrete memoryless channel partially match, these sufficiency results provide a partial characterization of the capacity region of the degraded Gaussian MIMO channel.