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:1406.6758 · IEEE Transactions on Information Forensics and Security

Information Spectrum Approach to Strong Converse Theorems for Degraded Wiretap Channels

Vincent Y. F. Tan, Matthieu R. Bloch

Published Sep 1, 2014• 17 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tifs.2015.2434592

Related papers

Partial strong converse for the non-degraded wiretap channel

Yi-Peng Wei, Şennur Ulukuş

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.

arXiv:1610.04215•Allerton Conference on Communication, Control, and Computing•Sep 1, 2016•2 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

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 Sciences•Jan 1, 2015•0 citations

Achievable second-order coding rates for the wiretap channel

Vincent Y. F. Tan

We derive lower bounds to the second-order coding rates for the wiretap channel. The decoding error probability and the information leakage measured in terms of the variational distance secrecy metric are fixed at some constants εrand εsrespectively. We leverage on the connection between wiretap channel coding and channel resolvability to derive tighter secrecy bounds than those available in the literature. We then use central limit theorem-style analysis to evaluate these bounds for the discrete memoryless wiretap channel with cost constraints and the Gaussian wiretap channel.

IEEE International Conference on Communication Systems (ICCS)•Nov 1, 2012•22 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 an asymptotic lower bound on the secrecy capacity of a specific colored Gaussian wiretap channel for which optimum power allocation can be found by water filling.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 1, 2012•2 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
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.
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 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.
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.
We derive lower bounds to the second-order coding rates for the wiretap channel. The decoding error probability and the information leakage measured in terms of the variational distance secrecy metric are fixed at some constants εrand εsrespectively. We leverage on the connection between wiretap channel coding and channel resolvability to derive tighter secrecy bounds than those available in the literature. We then use central limit theorem-style analysis to evaluate these bounds for the discrete memoryless wiretap channel with cost constraints and the Gaussian wiretap channel.
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 an asymptotic lower bound on the secrecy capacity of a specific colored Gaussian wiretap channel for which optimum power allocation can be found by water filling.
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.