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 Transactions on Information Forensics and Security

Resource Allocation for Secret Key Agreement Over Parallel Channels With Full and Partial Eavesdropper CSI

Stefano Tomasin, Alberto Dall’Arche

Published Jul 10, 2015• 6 citations
Publisher

Abstract

We consider the distillation phase of the secret key agreement (SKA) channel model for users connected through parallel additive white Gaussian noise fading channels. Alice sends binary phase shift keying modulated random bits to Bob who selects the subset of bits that have a log-likelihood ratio higher than a given threshold, i.e., they are sufficiently reliable. Alice has either full or partial channel state information (CSI) on her channel to the eavesdropper Eve. The main contributions of this paper are: 1) the derivation of the expression of outage probability when partial CSI is available; 2) the introduction of (outage) secret key throughput (SKT) as a metric in the full (partial) CSI scenario; 3) the derivation of SKT bounds; 4) the proposal of a new power allocation and threshold choice algorithm that maximizes the SKT under an outage probability constraint; and 5) the derivation of a suboptimal version of the allocation algorithm amenable for practical implementation obtained by approximating the objective functions with a closed-form expression. Moreover, we show that when power allocation and thresholds are optimized, per-channel and joint SKA are equivalent.

DOI
10.1109/tifs.2015.2455412

Related papers

Resource allocation for secret key agreement by LLR thresholding over parallel channels

Alberto Dall’Arche, Stefano Tomasin

We consider a channel-model based secret key agreement (SKA) over parallel channels, where Alice transmits a random sequence of bits, and Bob selects those having an absolute value of log-likelihood ratio (LLR) larger than a given threshold. Distillation and reconciliation processes follow, independently on each channel. Assuming a total transmit power constraint, we aim at choosing both the LLR threshold and the transmit power on each channel, in order to maximize the secret key throughput (SKT), under a full channel state information of both legitimate and eavesdropper channels. A two-step solution is considered. First the LLR threshold is determined on a per-channel basis for a given power allocation by numerical methods. Then we fit the SKT as a function of the transmit power by an exponential function and the power allocation problem is solved in closed form. Extensive simulation results show accuracy of the fitting function and the importance of the optimization, also for practical reconciliation processes.

International Symposium on Wireless Communication Systems•Aug 1, 2014•2 citations

Resource allocation for secret transmissions on parallel Rayleigh channels

Nicola Laurenti, Stefano Tomasin, Francesco Renna

A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All subchannels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.

International Conference on Communications•Jun 1, 2014•8 citations

Secret Key Agreement by LLR Thresholding and Syndrome Feedback over AWGN Channel

Stefano Tomasin, Francesco Trentini, Nicola Laurenti

In this paper we propose novel advantage distillation and reconciliation approaches for secret key agreement (SKA) over additive white Gaussian noise (AWGN) (possibly fading) channels, using binary phase shift keying (BPSK) constellations. For advantage distillation Bob selects bits having an absolute log-likelihood ratio (LLR) larger than some threshold. For reconciliation, Alice transmits the syndrome of the selected bits with respect to a globally pre-shared forward error correcting (FEC) code. We show that the syndrome transmission does not diminish the advantage of Bob over Eve on the key knowledge, thus being an efficient solution. For the proposed scheme we derive both a lower bound on the achievable secret key rate with ideal wiretap coding, and the effective throughput achieved by using practical codes.

IEEE Communications Letters•Jan 1, 2014•11 citations

Resource allocation for secure Gaussian parallel relay channels with finite-length coding and discrete constellations

Linda Senigagliesi, Marco Baldi, Stefano Tomasin

Abstract We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of efficient implementations, including discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then, we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee anoutagesecrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones.

arXiv:1807.06448•EURASIP Journal on Wireless Communications and Networking•Dec 1, 2019•4 citations

Resource allocation for secret transmissions over MIMOME fading channels

Stefano Tomasin

For a communication where agent Alice aims at transmitting to agent Bob a message which must be kept secret to a third agent Eve, we consider terminals equipped with multiple antennas, obtaining the multiple-input multiple-output multiple-output-eavesdropper (MIMOME) channel. In this scenario, we assume that Alice knows the instantaneous channel conditions of the Alice-Bob channel before transmission, while knowing only the statistics of the Alice-Eve channel. For Rayleigh fading channels there is a non-zero probability that Eve gets a better channel than Bob, thus obtaining some information on the secret message (secrecy outage probability). We derive a closed form expression of the secrecy outage probability and then we consider the problem of allocating the power among the space streams, in order to maximize the total rate of the secret message under a constraint on the secrecy outage probability.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2013•4 citations

Secret-Key-Agreement Advantage Distillation With Quantization Correction

Francesco Ardizzon, Francesco Giurisato, Stefano Tomasin

We consider a physical layer-based secret-key-agreement (SKA) scenario where Alice and Bob aim at extracting a common bit sequence, which should remain secret to Eve, by quantizing a random number obtained from measurements of their communication channel. We propose an asymmetric advantage distillation protocol where i) Alice quantizes her measurement and sends partial information on it over an authenticated public side channel, and ii) Bob (and Eve) quantizes his measurement by exploiting the partial information. The partial information on the position of the measurement in the quantization interval allows Bob to obtain a quantized value closer to that of Alice. Such strategies are shown to increase the lower bound of the secret key rate.

arXiv:2304.10312•IEEE Communications Letters•Aug 1, 2023•7 citations
We consider the distillation phase of the secret key agreement (SKA) channel model for users connected through parallel additive white Gaussian noise fading channels. Alice sends binary phase shift keying modulated random bits to Bob who selects the subset of bits that have a log-likelihood ratio higher than a given threshold, i.e., they are sufficiently reliable. Alice has either full or partial channel state information (CSI) on her channel to the eavesdropper Eve. The main contributions of this paper are: 1) the derivation of the expression of outage probability when partial CSI is available; 2) the introduction of (outage) secret key throughput (SKT) as a metric in the full (partial) CSI scenario; 3) the derivation of SKT bounds; 4) the proposal of a new power allocation and threshold choice algorithm that maximizes the SKT under an outage probability constraint; and 5) the derivation of a suboptimal version of the allocation algorithm amenable for practical implementation obtained by approximating the objective functions with a closed-form expression. Moreover, we show that when power allocation and thresholds are optimized, per-channel and joint SKA are equivalent.
We consider a channel-model based secret key agreement (SKA) over parallel channels, where Alice transmits a random sequence of bits, and Bob selects those having an absolute value of log-likelihood ratio (LLR) larger than a given threshold. Distillation and reconciliation processes follow, independently on each channel. Assuming a total transmit power constraint, we aim at choosing both the LLR threshold and the transmit power on each channel, in order to maximize the secret key throughput (SKT), under a full channel state information of both legitimate and eavesdropper channels. A two-step solution is considered. First the LLR threshold is determined on a per-channel basis for a given power allocation by numerical methods. Then we fit the SKT as a function of the transmit power by an exponential function and the power allocation problem is solved in closed form. Extensive simulation results show accuracy of the fitting function and the importance of the optimization, also for practical reconciliation processes.
A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All subchannels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.
In this paper we propose novel advantage distillation and reconciliation approaches for secret key agreement (SKA) over additive white Gaussian noise (AWGN) (possibly fading) channels, using binary phase shift keying (BPSK) constellations. For advantage distillation Bob selects bits having an absolute log-likelihood ratio (LLR) larger than some threshold. For reconciliation, Alice transmits the syndrome of the selected bits with respect to a globally pre-shared forward error correcting (FEC) code. We show that the syndrome transmission does not diminish the advantage of Bob over Eve on the key knowledge, thus being an efficient solution. For the proposed scheme we derive both a lower bound on the achievable secret key rate with ideal wiretap coding, and the effective throughput achieved by using practical codes.
Abstract We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of efficient implementations, including discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then, we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee anoutagesecrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones.
For a communication where agent Alice aims at transmitting to agent Bob a message which must be kept secret to a third agent Eve, we consider terminals equipped with multiple antennas, obtaining the multiple-input multiple-output multiple-output-eavesdropper (MIMOME) channel. In this scenario, we assume that Alice knows the instantaneous channel conditions of the Alice-Bob channel before transmission, while knowing only the statistics of the Alice-Eve channel. For Rayleigh fading channels there is a non-zero probability that Eve gets a better channel than Bob, thus obtaining some information on the secret message (secrecy outage probability). We derive a closed form expression of the secrecy outage probability and then we consider the problem of allocating the power among the space streams, in order to maximize the total rate of the secret message under a constraint on the secrecy outage probability.
We consider a physical layer-based secret-key-agreement (SKA) scenario where Alice and Bob aim at extracting a common bit sequence, which should remain secret to Eve, by quantizing a random number obtained from measurements of their communication channel. We propose an asymmetric advantage distillation protocol where i) Alice quantizes her measurement and sends partial information on it over an authenticated public side channel, and ii) Bob (and Eve) quantizes his measurement by exploiting the partial information. The partial information on the position of the measurement in the quantization interval allows Bob to obtain a quantized value closer to that of Alice. Such strategies are shown to increase the lower bound of the secret key rate.