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 Global Conference on Signal and Information Processing

Secret-key generation with arbitrarily varying eavesdropper's channel

Rémi A. Chou, Matthieu R. Bloch

Published Dec 1, 2013• 7 citations
Publisher

Abstract

Information-theoretic secret-key generation often requires the legitimate users to know the eavesdropper's statistics, which might not always be a realistic assumption. We study secret-key generation for a channel model with unknown and arbitrarily varying channel states at the eavesdropper. We first develop an achievable secret-key rate in the case of finite alphabets. We then extend the result to multiple-input multiple-output (MIMO) channels with continuous alphabets. In this case, we show that a positive secret-key rate, optimal in terms of secure degrees of freedom, is achievable if the eavesdropper has strictly less antennas than the legitimate users.

DOI
10.1109/globalsip.2013.6736869

Related papers

MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

Xiang He, Aylin Yener

In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdropper has fewer antennas than the transmitter and its intended receiver, a positive secrecy rate in the sense of strong secrecy is proved to be achievable and shown to match with the converse in secure degrees of freedom. This yields the conclusion that secure communication is possible regardless of the location or channel states of the eavesdropper. Additionally, it is observed that, the present setting renders the secrecy capacity problems for some multiterminal wiretap-type channels more tractable as compared to the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access (MAC) wiretap channel and the two-user Gaussian MIMO broadcast (BC) wiretap channel, where the transmitter(s) and intended receiver(s) have the same number of antennas.

IEEE Transactions on Information Theory•Oct 1, 2014•54 citations

MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States

Xiang He, Aylin Yener

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wiretap channel in the sense of strong secrecy is derived, and shown to match with the converse in secure degrees of freedom. It is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. This yields the conclusion that secure communication is possible regardless of the location or channel states of (potentially infinite number of) eavesdroppers. Additionally, it is observed that, the present setting renders the secrecy capacity problems for multi-terminal wiretap-type channels more tractable as compared the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access wiretap channel (MIMO MAC-WT) and the Gaussian MIMO broadcast wiretap channel (MIMO BC-WT) where the transmitter(s) and the intended receiver(s) have the same number of antennas.

arXiv:1007.4801•Jul 27, 2010•50 citations

Providing secrecy when the eavesdropper channel is arbitrarily varying: A case for multiple antennas

Xiang He, Aylin Yener

Despite recent attempts with compound channel settings, guaranteeing information theoretically secure communication rates with no knowledge of the eavesdropper channel states has been elusive to date. In this work, we address this problem, and consider the worst case scenario where the eavesdropper's channel is arbitrarily varying, and is known only by itself. We show that it is possible to provide non-zero secure communication rates with the aid of multiple antennas. Under the mild assumption that the number of antennas at the eavesdropper is limited, we provide the strong secrecy rate for the MIMO wiretap channel. Specifically, it is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. We show that the result is tight in terms of secure degrees of freedom.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2010•17 citations

Providing Secrecy Irrespective of Eavesdropper's Channel State

Xiang He, Aylin Yener

A usual concern against physical layer security is that the legitimate parties would need to have (partial) channel state information (CSI) of the eavesdropper in order to design transmission schemes that provide secrecy. In this work, to overcome this concern, we consider the model where the eavesdropper's CSI is completely unknown at the legitimate transmitter(s) and the receiver. A static channel setting, and multiple antennas are considered for all parties, and it is assumed that the eavesdropper has perfect self-CSI. In this setting, assuming that the legitimate parties can employ a larger number of antennas than the eavesdropper, we provide a positive secure communication rate in the sense of strong secrecy. The achievable (guaranteed) secrecy rate we derive for the MIMO wiretap channel matches its converse in terms of secure degrees of freedom. As a side result of our approach, we also derive the secure degrees of freedom region for the MIMO MAC-wiretap channel where the transmitters and the intended receiver have the same number of antennas.

Globecom•Dec 1, 2010•4 citations

New bounds on the information-theoretic key agreement of multiple terminals

Amin Gohari, Venkat Anantharam

We study the problem of information-theoretically secure secret key agreement under the well-known source model and channel model. In both of these models the parties wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. In the channel model, the first party can choose a sequence of inputs to a discrete memoryless channel, which has outputs at the other parties and at the eavesdropper. After each channel use, the parties can engage in arbitrarily many rounds of interactive authenticated communication over a public channel. At the end, each party should be able to generate the key. In the source model, the parties wishing to generate a secret key (as well as the eavesdropper) receive a certain number of independent identically distributed copies of jointly distributed random variables after which the parties are allowed interactive authenticated public communication, at the end of which each party should be able to generate the key. We derive new lower and upper bounds on the secret key rate under the source model and the channel model, and introduce a technique for proving that a given expression bounds the secrecy rate from above in the channel model. Our lower bounds strictly improve what is essentially the best known lower bound in both the source model and the channel model. Our upper bound in the channel model strictly improves the current state of art upper bound. We do not know whether our new upper bound in the source model represents an strict improvement but it includes the current best known bound as a special case.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•13 citations

Secret Key Generation With Precoding and Role Reversal in MIMO Wireless Systems

Saygın Bakşi, Dimitrie C. Popescu

Secret key generation based on channel measurements has emerged as a meaningful approach to enhance the security of wireless links. The key generation mechanism takes advantage of wireless channel reciprocity and uses the mutual information between legitimate users' channel measurements. However, the rate at which key bits are generated depends on the channel coherence time. Furthermore, eavesdroppers may obtain information to generate the secret key bits if their channels become correlated to the legitimate channels. In this paper, we propose a new approach for key generation that uses MIMO precoding and role switching by legitimate users during the key generation process in order to prevent an eavesdropper whose channel is correlated with the legitimate channel to acquire information that can be used to generate the encryption key, while also ensuring that the rate at which uncorrelated key bits are generated does not depend on the channel coherence time. The proposed approach is supported by an information theoretic analysis and is illustrated with numerical results obtained from simulations showing that, even when the legitimate and eavesdropper channels are correlated, the bit mismatch rate at the eavesdropper does not improve with increasing SNR, while that at the legitimate users improves.

IEEE Transactions on Wireless Communications•Apr 16, 2019•27 citations
Information-theoretic secret-key generation often requires the legitimate users to know the eavesdropper's statistics, which might not always be a realistic assumption. We study secret-key generation for a channel model with unknown and arbitrarily varying channel states at the eavesdropper. We first develop an achievable secret-key rate in the case of finite alphabets. We then extend the result to multiple-input multiple-output (MIMO) channels with continuous alphabets. In this case, we show that a positive secret-key rate, optimal in terms of secure degrees of freedom, is achievable if the eavesdropper has strictly less antennas than the legitimate users.
In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdropper has fewer antennas than the transmitter and its intended receiver, a positive secrecy rate in the sense of strong secrecy is proved to be achievable and shown to match with the converse in secure degrees of freedom. This yields the conclusion that secure communication is possible regardless of the location or channel states of the eavesdropper. Additionally, it is observed that, the present setting renders the secrecy capacity problems for some multiterminal wiretap-type channels more tractable as compared to the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access (MAC) wiretap channel and the two-user Gaussian MIMO broadcast (BC) wiretap channel, where the transmitter(s) and intended receiver(s) have the same number of antennas.
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wiretap channel in the sense of strong secrecy is derived, and shown to match with the converse in secure degrees of freedom. It is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. This yields the conclusion that secure communication is possible regardless of the location or channel states of (potentially infinite number of) eavesdroppers. Additionally, it is observed that, the present setting renders the secrecy capacity problems for multi-terminal wiretap-type channels more tractable as compared the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access wiretap channel (MIMO MAC-WT) and the Gaussian MIMO broadcast wiretap channel (MIMO BC-WT) where the transmitter(s) and the intended receiver(s) have the same number of antennas.
Despite recent attempts with compound channel settings, guaranteeing information theoretically secure communication rates with no knowledge of the eavesdropper channel states has been elusive to date. In this work, we address this problem, and consider the worst case scenario where the eavesdropper's channel is arbitrarily varying, and is known only by itself. We show that it is possible to provide non-zero secure communication rates with the aid of multiple antennas. Under the mild assumption that the number of antennas at the eavesdropper is limited, we provide the strong secrecy rate for the MIMO wiretap channel. Specifically, it is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. We show that the result is tight in terms of secure degrees of freedom.
A usual concern against physical layer security is that the legitimate parties would need to have (partial) channel state information (CSI) of the eavesdropper in order to design transmission schemes that provide secrecy. In this work, to overcome this concern, we consider the model where the eavesdropper's CSI is completely unknown at the legitimate transmitter(s) and the receiver. A static channel setting, and multiple antennas are considered for all parties, and it is assumed that the eavesdropper has perfect self-CSI. In this setting, assuming that the legitimate parties can employ a larger number of antennas than the eavesdropper, we provide a positive secure communication rate in the sense of strong secrecy. The achievable (guaranteed) secrecy rate we derive for the MIMO wiretap channel matches its converse in terms of secure degrees of freedom. As a side result of our approach, we also derive the secure degrees of freedom region for the MIMO MAC-wiretap channel where the transmitters and the intended receiver have the same number of antennas.
We study the problem of information-theoretically secure secret key agreement under the well-known source model and channel model. In both of these models the parties wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. In the channel model, the first party can choose a sequence of inputs to a discrete memoryless channel, which has outputs at the other parties and at the eavesdropper. After each channel use, the parties can engage in arbitrarily many rounds of interactive authenticated communication over a public channel. At the end, each party should be able to generate the key. In the source model, the parties wishing to generate a secret key (as well as the eavesdropper) receive a certain number of independent identically distributed copies of jointly distributed random variables after which the parties are allowed interactive authenticated public communication, at the end of which each party should be able to generate the key. We derive new lower and upper bounds on the secret key rate under the source model and the channel model, and introduce a technique for proving that a given expression bounds the secrecy rate from above in the channel model. Our lower bounds strictly improve what is essentially the best known lower bound in both the source model and the channel model. Our upper bound in the channel model strictly improves the current state of art upper bound. We do not know whether our new upper bound in the source model represents an strict improvement but it includes the current best known bound as a special case.
Secret key generation based on channel measurements has emerged as a meaningful approach to enhance the security of wireless links. The key generation mechanism takes advantage of wireless channel reciprocity and uses the mutual information between legitimate users' channel measurements. However, the rate at which key bits are generated depends on the channel coherence time. Furthermore, eavesdroppers may obtain information to generate the secret key bits if their channels become correlated to the legitimate channels. In this paper, we propose a new approach for key generation that uses MIMO precoding and role switching by legitimate users during the key generation process in order to prevent an eavesdropper whose channel is correlated with the legitimate channel to acquire information that can be used to generate the encryption key, while also ensuring that the rate at which uncorrelated key bits are generated does not depend on the channel coherence time. The proposed approach is supported by an information theoretic analysis and is illustrated with numerical results obtained from simulations showing that, even when the legitimate and eavesdropper channels are correlated, the bit mismatch rate at the eavesdropper does not improve with increasing SNR, while that at the legitimate users improves.