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

Low-power secret-key agreement over OFDM

Francesco Renna, Nicola Laurenti, Stefano Tomasin, Marco Baldi, Nicola Maturo, Marco Bianchi, Franco Chiaraluce, Matthieu R. Bloch

Published Apr 16, 2013• 8 citations
Publisher

Abstract

Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.

DOI
10.1145/2463183.2463194

Related papers

Low-power Secret-key Agreement over OFDM

Francesco Renna, Nicola Laurenti, Stefano Tomasin +5 more

Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.

arXiv:1302.4767•Feb 19, 2013•0 citations

Physical-Layer Secrecy for OFDM Transmissions Over Fading Channels

Francesco Renna, Nicola Laurenti, H. Vincent Poor

This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. The secrecy capacity is formulated as a maximization problem under a trace constraint, and simple expressions are given for its high signal-to-noise (SNR) limit. The low rate limit of the secrecy outage probability is also evaluated under a fading channel model. As for the finite SNR case, the secrecy rates that can be achieved with particular inputs are considered. Numerical results are provided under a Rayleigh fading channel model and under dependence of the main and eavesdropper channels. The secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver, are also considered.

IEEE Transactions on Information Forensics and Security•Apr 20, 2012•99 citations

Increasing secret key capacity of OFDM systems: a geometric program approach

Longwang Cheng, Wei Li, Li Zhou +3 more

Summary Extracting secret keys from the common randomness of wireless channels has attracted prominent attention recently. Orthogonal frequency‐division multiplexing (OFDM) systems can provide extra randomness in view of the use of multiple subchannels. So far, the secret key capacity of OFDM systems is still an open issue. In this paper, the secret key capacity of OFDM systems based on the subchannel state information is analyzed, and an expression of the secret key capacity is derived under the assumption that the subchannels are independent. To increase the secret key capacity, a power allocation scheme based on geometric program is proposed. Furthermore, an underlying propagation protocol is designed to realize the power allocation scheme. Performance simulations show that the proposed scheme achieves greater secret key capacity in comparison with equal power allocation scheme, especially at low signal‐to‐noise ratio region. Besides, the secret key bits mismatch rate during the secret key generation based on the power allocated subchannels is decreased.

Concurrency and Computation Practice and Experience•Sep 23, 2016•5 citations

High SNR secrecy rates with OFDM signaling over fading channels

Francesco Renna, Nicola Laurenti, H. Vincent Poor

Orthogonal frequency division multiplexing (OFDM) systems have enjoyed widespread adoption in high data rate wired and wireless networks, due to their ability to efficiently cope with slowly varying dispersive channels. This paper considers the information theoretic secrecy rates that are achievable by an OFDM transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is performed through modeling of the OFDM system with an eavesdropper as a special case of a high dimensional multiple-input multiple-output (MIMO) wiretap channel, which allows the secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver to be quantified. The results are expressed in terms of both ergodic rates and outage probabilities for multipath Rayleigh fading channels, and in terms of dependence on the signal to noise ratio (SNR) ratio between the main and eavesdropper channels.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2010•12 citations

Wireless Information-Theoretic Security

Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues +1 more

This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal—even in the presence of imperfect channel state information.

IEEE Transactions on Information Theory•May 29, 2008•1,853 citations

Novel Secret-Key-Assisted Schemes for Secure MISOME-OFDM Systems

Mohamed F. Marzban, Ahmed El Shafie, Naofal Al‐Dhahir

We propose a new secure transmission scheme for uplink multiple-input single-output (MISO) orthogonal-frequency multiplexing (OFDM) systems in the presence of multiple eavesdroppers. Our proposed scheme utilizes the sub-channels orthogonality of OFDM systems to simultaneously transmit data and secret key symbols. The base station, Bob, shares secret key symbols with the legitimate user, Alice, using wiretap coding over a portion of the sub-channels. Concurrently, Alice uses the accumulated secret keys in her secret-key queue to encrypt data symbols using a one time pad (OTP) cipher and transmits them to Bob over the remaining sub-channels. if Alice did not accumulate sufficient keys in her secret-key queue, she employs wiretap coding to secure her data transmissions. We propose fixed and dynamic sub-channel allocation schemes to divide the sub-channels between data and secret keys. We derive the secrecy outage probability (SOP) and the secure throughput for the proposed scheme. We quantify the system's security under practical non-Gaussian transmissions where discrete signal constellation points are transmitted by the legitimate source nodes. Numerical results validate our theoretical findings and quantify the impact of different system design parameters.

arXiv:2110.08707•Oct 17, 2021•2 citations
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.
This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. The secrecy capacity is formulated as a maximization problem under a trace constraint, and simple expressions are given for its high signal-to-noise (SNR) limit. The low rate limit of the secrecy outage probability is also evaluated under a fading channel model. As for the finite SNR case, the secrecy rates that can be achieved with particular inputs are considered. Numerical results are provided under a Rayleigh fading channel model and under dependence of the main and eavesdropper channels. The secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver, are also considered.
Summary Extracting secret keys from the common randomness of wireless channels has attracted prominent attention recently. Orthogonal frequency‐division multiplexing (OFDM) systems can provide extra randomness in view of the use of multiple subchannels. So far, the secret key capacity of OFDM systems is still an open issue. In this paper, the secret key capacity of OFDM systems based on the subchannel state information is analyzed, and an expression of the secret key capacity is derived under the assumption that the subchannels are independent. To increase the secret key capacity, a power allocation scheme based on geometric program is proposed. Furthermore, an underlying propagation protocol is designed to realize the power allocation scheme. Performance simulations show that the proposed scheme achieves greater secret key capacity in comparison with equal power allocation scheme, especially at low signal‐to‐noise ratio region. Besides, the secret key bits mismatch rate during the secret key generation based on the power allocated subchannels is decreased.
Orthogonal frequency division multiplexing (OFDM) systems have enjoyed widespread adoption in high data rate wired and wireless networks, due to their ability to efficiently cope with slowly varying dispersive channels. This paper considers the information theoretic secrecy rates that are achievable by an OFDM transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is performed through modeling of the OFDM system with an eavesdropper as a special case of a high dimensional multiple-input multiple-output (MIMO) wiretap channel, which allows the secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver to be quantified. The results are expressed in terms of both ergodic rates and outage probabilities for multipath Rayleigh fading channels, and in terms of dependence on the signal to noise ratio (SNR) ratio between the main and eavesdropper channels.
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal—even in the presence of imperfect channel state information.
We propose a new secure transmission scheme for uplink multiple-input single-output (MISO) orthogonal-frequency multiplexing (OFDM) systems in the presence of multiple eavesdroppers. Our proposed scheme utilizes the sub-channels orthogonality of OFDM systems to simultaneously transmit data and secret key symbols. The base station, Bob, shares secret key symbols with the legitimate user, Alice, using wiretap coding over a portion of the sub-channels. Concurrently, Alice uses the accumulated secret keys in her secret-key queue to encrypt data symbols using a one time pad (OTP) cipher and transmits them to Bob over the remaining sub-channels. if Alice did not accumulate sufficient keys in her secret-key queue, she employs wiretap coding to secure her data transmissions. We propose fixed and dynamic sub-channel allocation schemes to divide the sub-channels between data and secret keys. We derive the secrecy outage probability (SOP) and the secure throughput for the proposed scheme. We quantify the system's security under practical non-Gaussian transmissions where discrete signal constellation points are transmitted by the legitimate source nodes. Numerical results validate our theoretical findings and quantify the impact of different system design parameters.