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:2411.10292

Private Communication over a Bosonic Compound Channel

Florian Seitz, Matteo Rosati, M. A. Vázquez‐Castro, Janis Nötzel

Published Nov 15, 2024• 1 citation
arXivHTMLPDF

Abstract

It is a common belief that quantum key distribution systems are the one and only information-theoretically secure physical layer security protocol that enables secure data transmission without a need for the legitimate parties to have any channel knowledge. It is also known that this high security profile results in severe rate restrictions for the parties utilizing the quantum key distribution systems. This observation raises the question of whether quantifying the level of ignorance of the legitimate parties with regard to the channel parameters may enable us to navigate the large gray zone between insecure but highly performant systems on the one side and perfectly secure but highly non-performant systems on the other side. Indeed, by proving a capacity formula for the bosonic compound wiretap channel using the binary phase shift keying alphabet, we are able to quantify in this work exactly how channel uncertainty penalizes data transmission rates.

DOI
10.48550/arxiv.2411.10292

Related papers

Capacity Achieving Codes for the Wire Tap Channel with Applications to Quantum Key Distribution

Andrew Thangaraj, Souvik Dihidar, A.R. Calderbank +2 more

With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model for such a setting is the wire tap channel system introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channel systems. We provide a novel proof for the secrecy capacity theorem for wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel system and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide complete security at rates below secrecy capacity in some specific cases.

•Nov 2, 2004•15 citations

On the application of LDPC codes to a novel wiretap channel inspired by quantum key distribution

Andrew Thangaraj, Souvik Dihidar, A.R. Calderbank +2 more

With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical errorcorrecting codes for both error correction (for the honest p arties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model for such a setting is the wire tap channel introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channels. We provide a novel proof for the secrecy capacity theorem for wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide complete security at rates below secrecy capacity in some specific cases.

•Jan 1, 2005•8 citations

Secrecy capacities of compound quantum wiretap channels and applications

Holger Boche, Minglai Cai, Ning Cai +1 more

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information and determine the secrecy capacity of the compound classical-quantum wiretap channel with channel state information at the transmitter. We use this result to derive a proof for a lower bound on the entanglement generating capacity of the compound quantum channel. We also derive a proof for the formula for entanglement generating capacity of the compound quantum channel with channel state information at the encoder which was given in additional information [Bjelakovi\ifmmode \acute{c}\else \'{c}\fi{}, Boche, and N\"otzel, in Proceedings of International Symposium on Information Theory ISIT, Korea, 2009 (IEEE, New York, 2009), pp. 1889--1893].

arXiv:1302.3412•Physical Review A•May 16, 2014•23 citations

Opportunistic transmission of secret data through randomized parallel subcarriers

Mona Hajimomeni, Hassan Aghaeinia

In this paper a physical layer security scheme is proposed for secret transmission of data between legitimate parties, Alice and Bob, in presence of an illegitimate receiver, Eve. It is assumed that there is no knowledge of Eve's channel state information, and Alice/Bob exploit common randomness of wireless environment to randomize data over independent subcarriers. Specifically, we consider concurrent transmission of secret/normal data over a set of independent subcarriers to meet the goal of achieving high uncertainty in information received by illegitimate party. It is first shown that this scheme provides perfect secrecy in information-theoretic sense. Next, a power allocation strategy is designed to maintain normal service with specified data rate requirement and minimum power. Alice and Bob then use the available power to opportunistically achieve the maximum possible secrecy rate. Satisfactory performance curves of this scheme is shown under different parameters (number of total subcarriers, data requirement of the normal service, and main channel average SNR level) using complementary cumulative distribution function of obtained secrecy rate. One goal in this work is to demonstrate how the price for secret communication is paid in terms of consumed power and occupied subcarriers when Alice/Bob has no knowledge of wiretap channel state information.

International Symposium on Telecommunications•Nov 1, 2012•0 citations

Quantum-secure covert communication on bosonic channels

Boulat A. Bash, Andrei H Gheorghe, Monika Patel +4 more

Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.

arXiv:1404.7347•Nature Communications•Oct 19, 2015•128 citations

Secure multi-antenna transmission with finite-alphabet signaling

Sina Rezaei Aghdam

With the ever-growing demand for services that rely on transmission over wireless networks, a challenging issue is the security of the transmitted information. Due to its open nature, wireless communications is prone to eavesdropping attacks. Typically, secrecy of the transmitted information is ensured with the aid of cryptographic techniques, which are deployed on upper layers of the network protocol stack. However, due to the need for key distribution and management, cryptographic solutions are difficult to implement in decentralized networks. Moreover, the security provided by key based solutions is not provable from a mathematical point of view. Physical layer security is an alternative or complement to the cryptographic techniques, which can resolve the complexities associated with key distribution and management. The basic principle of physical layer security is to exploit the randomness of the communication channels to allow a transmitter deliver its message to an intended receiver reliably while guaranteeing that a third party cannot infer any information about it. Much of the existing research in physical layer security focuses on investigating the information theoretic limits of secure communications. Among different techniques proposed, multiple-antenna based solutions have been shown to exhibit a high potential for enhancing security. Furthermore, Gaussian inputs are proved to be the optimal input distributions in a variety of scenarios. However, due to the high detection complexity, Gaussian signaling is not used in practice, and the transmission is carried out with the aid of symbols drawn from standard signal constellations. In this thesis, we develop several secure multi-antenna transmission techniques under the practical finite-alphabet input assumption. We first consider multipleinput multiple-output (MIMO) wiretap channels under finite-alphabet input constraints. We assume that the statistical channel state information (CSI) of the eavesdropper is available at the transmitter, and study two different scenarios regarding the transmitter's knowledge on the main channel CSI (MCSI) including availability of perfect and statistical MCSI at the transmitter. In each scenario, we introduce iterative algorithms for joint optimization of data precoder and arti ficial noise. We also propose different strategies to reduce the computational complexity associated with the transmit signal design. Moreover, we consider the setups with simultaneous wireless information and power transfer (SWIPT), and propose transmission schemes for achieving the trade-off between the secrecy rate and the harvested power. We demonstrate the efficacy of the proposed transmit signal design algorithms via extensive numerical examples. We also introduce several secure transmission schemes with spatial modulation and space shift keying (SSK). We derive an expression for the achievable secrecy rate, and develop precoder optimization algorithms for its maximization using transmitter side CSI. Furthermore, we introduce a group of secure SSK transmission schemes, which rely on dynamic antenna index assignment over reciprocal channels. Our results reveal that the fundamentally different working principle of SSK opens up new avenues for secure multi-antenna transmission.

•Jan 1, 2018•1 citation
It is a common belief that quantum key distribution systems are the one and only information-theoretically secure physical layer security protocol that enables secure data transmission without a need for the legitimate parties to have any channel knowledge. It is also known that this high security profile results in severe rate restrictions for the parties utilizing the quantum key distribution systems. This observation raises the question of whether quantifying the level of ignorance of the legitimate parties with regard to the channel parameters may enable us to navigate the large gray zone between insecure but highly performant systems on the one side and perfectly secure but highly non-performant systems on the other side. Indeed, by proving a capacity formula for the bosonic compound wiretap channel using the binary phase shift keying alphabet, we are able to quantify in this work exactly how channel uncertainty penalizes data transmission rates.
With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model for such a setting is the wire tap channel system introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channel systems. We provide a novel proof for the secrecy capacity theorem for wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel system and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide complete security at rates below secrecy capacity in some specific cases.
With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical errorcorrecting codes for both error correction (for the honest p arties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model for such a setting is the wire tap channel introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channels. We provide a novel proof for the secrecy capacity theorem for wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide complete security at rates below secrecy capacity in some specific cases.
We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information and determine the secrecy capacity of the compound classical-quantum wiretap channel with channel state information at the transmitter. We use this result to derive a proof for a lower bound on the entanglement generating capacity of the compound quantum channel. We also derive a proof for the formula for entanglement generating capacity of the compound quantum channel with channel state information at the encoder which was given in additional information [Bjelakovi\ifmmode \acute{c}\else \'{c}\fi{}, Boche, and N\"otzel, in Proceedings of International Symposium on Information Theory ISIT, Korea, 2009 (IEEE, New York, 2009), pp. 1889--1893].
In this paper a physical layer security scheme is proposed for secret transmission of data between legitimate parties, Alice and Bob, in presence of an illegitimate receiver, Eve. It is assumed that there is no knowledge of Eve's channel state information, and Alice/Bob exploit common randomness of wireless environment to randomize data over independent subcarriers. Specifically, we consider concurrent transmission of secret/normal data over a set of independent subcarriers to meet the goal of achieving high uncertainty in information received by illegitimate party. It is first shown that this scheme provides perfect secrecy in information-theoretic sense. Next, a power allocation strategy is designed to maintain normal service with specified data rate requirement and minimum power. Alice and Bob then use the available power to opportunistically achieve the maximum possible secrecy rate. Satisfactory performance curves of this scheme is shown under different parameters (number of total subcarriers, data requirement of the normal service, and main channel average SNR level) using complementary cumulative distribution function of obtained secrecy rate. One goal in this work is to demonstrate how the price for secret communication is paid in terms of consumed power and occupied subcarriers when Alice/Bob has no knowledge of wiretap channel state information.
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
With the ever-growing demand for services that rely on transmission over wireless networks, a challenging issue is the security of the transmitted information. Due to its open nature, wireless communications is prone to eavesdropping attacks. Typically, secrecy of the transmitted information is ensured with the aid of cryptographic techniques, which are deployed on upper layers of the network protocol stack. However, due to the need for key distribution and management, cryptographic solutions are difficult to implement in decentralized networks. Moreover, the security provided by key based solutions is not provable from a mathematical point of view. Physical layer security is an alternative or complement to the cryptographic techniques, which can resolve the complexities associated with key distribution and management. The basic principle of physical layer security is to exploit the randomness of the communication channels to allow a transmitter deliver its message to an intended receiver reliably while guaranteeing that a third party cannot infer any information about it. Much of the existing research in physical layer security focuses on investigating the information theoretic limits of secure communications. Among different techniques proposed, multiple-antenna based solutions have been shown to exhibit a high potential for enhancing security. Furthermore, Gaussian inputs are proved to be the optimal input distributions in a variety of scenarios. However, due to the high detection complexity, Gaussian signaling is not used in practice, and the transmission is carried out with the aid of symbols drawn from standard signal constellations. In this thesis, we develop several secure multi-antenna transmission techniques under the practical finite-alphabet input assumption. We first consider multipleinput multiple-output (MIMO) wiretap channels under finite-alphabet input constraints. We assume that the statistical channel state information (CSI) of the eavesdropper is available at the transmitter, and study two different scenarios regarding the transmitter's knowledge on the main channel CSI (MCSI) including availability of perfect and statistical MCSI at the transmitter. In each scenario, we introduce iterative algorithms for joint optimization of data precoder and arti ficial noise. We also propose different strategies to reduce the computational complexity associated with the transmit signal design. Moreover, we consider the setups with simultaneous wireless information and power transfer (SWIPT), and propose transmission schemes for achieving the trade-off between the secrecy rate and the harvested power. We demonstrate the efficacy of the proposed transmit signal design algorithms via extensive numerical examples. We also introduce several secure transmission schemes with spatial modulation and space shift keying (SSK). We derive an expression for the achievable secrecy rate, and develop precoder optimization algorithms for its maximization using transmitter side CSI. Furthermore, we introduce a group of secure SSK transmission schemes, which rely on dynamic antenna index assignment over reciprocal channels. Our results reveal that the fundamentally different working principle of SSK opens up new avenues for secure multi-antenna transmission.