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 International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Space-time transmissions for wireless secret-key agreement with information-theoretic secrecy

Xiaohua Li, Mo Chen, E. Paul Ratazzi

Published Sep 12, 2005• 26 citations
Publisher

Abstract

An important building block of the cross-layer network security design is the physical-layer security which addresses problems such as whether the physical-layer can have build-in security and whether physical-layer techniques can assist the upper-layer encryption-based security techniques. This paper provides a positive answer by realizing information-theoretic secrecy with space-time transmissions. While most existing results on information-theoretic secrecy rely on some impractical assumptions, we propose a more practical approach that uses the redundancy of space-time transmissions to create intentional ambiguity to the adversary. Secrecy can be guaranteed even if the adversary has extremely high receiving signal-to-noise ratio. This approach is presented as a new way for secret-key agreement. Simulations in terms of receiving error rate and secret channel capacity are presented.

DOI
10.1109/spawc.2005.1506252

Related papers

A Randomized Space-Time Transmission Scheme for Secret-Key Agreement

Maobian Chen, E. Paul Ratazzi

In contrast to the pessimistic view on perfect secrecy, studies on information-theoretic secrecy have shown that perfect secrecy may be possible in practice. A typical example is the Wyner’s wire-tap channel concept. However, existing approaches mostly depend on unrealistic noise or error-rate assumptions. We propose a more practical way in this paper which uses advanced space-time transmissions for enhanced information-theoretical secrecy. Based on the fundamental limits of MIMO blind channel identification, space-time transmissions with proper randomization can effectively prevent the adversary from channel estimation while allowing reliable transmission between the authorized parties. The high error rate suffered by the adversary enhances secret channel capacity. This paper points out a new and practical approach for secret-key agreement which achieves perfect secrecy based on the physical-layer signal processing techniques.

•Jan 1, 2005•12 citations

MIMO transmissions with information-theoretic secrecy for secret-key agreement in wireless networks

Xiaohua Li, E. Paul Ratazzi

Information-theoretic secrecy gives the strongest information security that is important for military wireless networks. In this paper, we show that randomized MIMO transmissions can achieve such secrecy. A method is proposed to randomize the MIMO transmission coefficients. The received signal of the adversary has some special statistical distributions, based on which the indeterminacy of the adversary's blind deconvolution is proved. Receiving error rates and secret channel capacity are analyzed and simulated. This paper points out a practical way to realize the well-known wire-tap channel for perfect secrecy, which is one of the interesting challenges in information theory. The proposed method is also useful for key management in military wireless networks.

IEEE Military Communications Conference (MILCOM)•Jan 1, 2005•50 citations

Wireless Physical Layer Security: Towards Practical Assumptions and Requirements

Biao He

The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.

•Jan 1, 2016•1 citation

On Enhancements of Physical Layer Secret Key Generation and Its Application in Wireless Communication Systems

Kang Liu

As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.\nIn this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel's signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.\nIn order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.\nIn the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control.

•Jan 1, 2015•1 citation

Security pairings using physical layer properties of wireless communications

Jani Suomalainen, Antti Evesti, Adrian Kotelba

New security solutions in the physical communication layer - secret key extraction from the radio channel and information-theoretic secrecy - protect confidentiality of communication without cryptographic establishment of secret keys. Unfortunately, they currently lack authentication. Cryptographic mechanisms are still needed to secure the first contact between previously unknown devices - to guarantee that security pairings are made as the user intends. In this paper, we contribute by analyzing how five different security pairing approaches can be realized or complemented with physical layer solutions. We propose new solutions for replacing the use of expensive crypto algorithms with secret key extraction. We note that information-theoretic secrecy solutions are less capable of surviving without cryptographic authentication. However, in some information-theoretic secrecy approaches, secure out-of-band delivery of channel state information can authenticate receivers.

International Conference on Privacy and Security in Mobile Systems (PRISMS)•May 1, 2014•0 citations

Array-transmission based physical-layer security techniques for wireless sensor networks

Xiaohua Li, Mo Chen, E. Paul Ratazzi

This paper proposes new approaches to enhance the security of wireless sensor networks. Two randomized array transmission schemes are developed to secure wireless sensor networks at the physical layer. Transmission secrecy can be guaranteed by either the inherent ambiguities of MIMO blind equalization or the intentionally created ambiguities. Perfect secrecy is shown to be realizable under certain conditions. The schemes do not require secret keys, and work under more relaxed assumptions than existing techniques. They are useful for secure wireless data transmission or key distribution in wireless sensor networks.

International Conference on Mechatronics and Automation•Aug 15, 2006•18 citations
An important building block of the cross-layer network security design is the physical-layer security which addresses problems such as whether the physical-layer can have build-in security and whether physical-layer techniques can assist the upper-layer encryption-based security techniques. This paper provides a positive answer by realizing information-theoretic secrecy with space-time transmissions. While most existing results on information-theoretic secrecy rely on some impractical assumptions, we propose a more practical approach that uses the redundancy of space-time transmissions to create intentional ambiguity to the adversary. Secrecy can be guaranteed even if the adversary has extremely high receiving signal-to-noise ratio. This approach is presented as a new way for secret-key agreement. Simulations in terms of receiving error rate and secret channel capacity are presented.
In contrast to the pessimistic view on perfect secrecy, studies on information-theoretic secrecy have shown that perfect secrecy may be possible in practice. A typical example is the Wyner’s wire-tap channel concept. However, existing approaches mostly depend on unrealistic noise or error-rate assumptions. We propose a more practical way in this paper which uses advanced space-time transmissions for enhanced information-theoretical secrecy. Based on the fundamental limits of MIMO blind channel identification, space-time transmissions with proper randomization can effectively prevent the adversary from channel estimation while allowing reliable transmission between the authorized parties. The high error rate suffered by the adversary enhances secret channel capacity. This paper points out a new and practical approach for secret-key agreement which achieves perfect secrecy based on the physical-layer signal processing techniques.
Information-theoretic secrecy gives the strongest information security that is important for military wireless networks. In this paper, we show that randomized MIMO transmissions can achieve such secrecy. A method is proposed to randomize the MIMO transmission coefficients. The received signal of the adversary has some special statistical distributions, based on which the indeterminacy of the adversary's blind deconvolution is proved. Receiving error rates and secret channel capacity are analyzed and simulated. This paper points out a practical way to realize the well-known wire-tap channel for perfect secrecy, which is one of the interesting challenges in information theory. The proposed method is also useful for key management in military wireless networks.
The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.
As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.\nIn this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel's signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.\nIn order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.\nIn the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control.
New security solutions in the physical communication layer - secret key extraction from the radio channel and information-theoretic secrecy - protect confidentiality of communication without cryptographic establishment of secret keys. Unfortunately, they currently lack authentication. Cryptographic mechanisms are still needed to secure the first contact between previously unknown devices - to guarantee that security pairings are made as the user intends. In this paper, we contribute by analyzing how five different security pairing approaches can be realized or complemented with physical layer solutions. We propose new solutions for replacing the use of expensive crypto algorithms with secret key extraction. We note that information-theoretic secrecy solutions are less capable of surviving without cryptographic authentication. However, in some information-theoretic secrecy approaches, secure out-of-band delivery of channel state information can authenticate receivers.
This paper proposes new approaches to enhance the security of wireless sensor networks. Two randomized array transmission schemes are developed to secure wireless sensor networks at the physical layer. Transmission secrecy can be guaranteed by either the inherent ambiguities of MIMO blind equalization or the intentionally created ambiguities. Perfect secrecy is shown to be realizable under certain conditions. The schemes do not require secret keys, and work under more relaxed assumptions than existing techniques. They are useful for secure wireless data transmission or key distribution in wireless sensor networks.