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:1110.6476 · IEEE Transactions on Information Theory

Key Generation Using External Source Excitation: Capacity, Reliability, and Secrecy Exponent

Tzu-Han Chou, Stark Christiaan Draper, A.M. Sayeed

Published Nov 22, 2011• 30 citations
arXivHTMLPDF

Abstract

We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS, a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key capacity for such systems with one-way public messaging. We then characterize a tradeoff between the secret key rate and exponential bounds on the probability of key agreement failure and on the secrecy of the key generated. We find that there is a fundamental tradeoff between reliability and secrecy.

DOI
10.1109/tit.2011.2176311

Related papers

The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents

Tzu-Han Chou, Vincent Y. F. Tan, Stark Christiaan Draper

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states, where the channel state may be influenced by some of the parties involved. We derive single-letter expressions for the secret key capacity through a type of source emulation analysis. We also derive lower bounds on the achievable reliability and secrecy exponents, i.e., the exponential rates of decay of the probability of decoding error and of the information leakage. These exponents allow us to determine a set of strongly achievable secret key rates. For degraded eavesdroppers, the maximum strongly achievable rate equals the secret key capacity; our exponents can also be specialized to previously known results. In deriving our strong achievability results, we introduce a coding scheme that combines wiretap coding (to excite the channel) and key extraction (to distill keys from residual randomness). The secret key capacity is naturally seen to be a combination of both source- and channel-type randomness. Through examples, we illustrate a fundamental interplay between the portion of the secret key rate due to each type of randomness. We also illustrate inherent tradeoffs between the achievable reliability and secrecy exponents. Our new scheme also naturally accommodates rate limits on the public discussion. We show that under rate constraints, we are able to achieve larger rates than those that can be attained through a pure source emulation strategy.

arXiv:1107.4148•IEEE Transactions on Information Theory•Nov 11, 2014•18 citations

The sender-excited secret key agreement model: Capacity theorems

Tzu-Han Chou, Vincent Y. F. Tan, Stark Christiaan Draper

We consider the fundamental limits of the secret key generation problem when the sources are excited by the sender. In many practical communication settings, the channel may be influenced by the parties involved. Similar to recent works on probing capacity and channels with action-dependent states, our system model captures such a scenario. We derive single-letter expressions for the secret key capacity. Our coding strategy involves wiretap channel coding and a key generation scheme. By assuming that the eavesdropper receives a degraded version of the legitimate receiver's observation, we also obtain a capacity result that does not involve any auxiliary random variables. Finally, by studying two examples, we show that there is a fundamental tradeoff in between the amount of common randomness (i.e., the secret key rate) and the wiretap secrecy rate.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2011•3 citations

Secret Key Generation for Correlated Gaussian Sources

Sirin Nitinawarat, Prakash Narayan

Secret key generation by multiple terminals is considered based on their observations of jointly distributed Gaussian signals, followed by public communication among themselves. Exploiting an inherent connection between secrecy generation and lossy data compression, two main contributions are made. The first is a characterization of strong secret key capacity, and entails a converse proof technique that is valid for real-valued (and not necessarily Gaussian) as well as finite-valued signals. The capacity formula acquires a simple form when the terminals observe “symmetrically correlated” jointly Gaussian signals. For the latter setup with two terminals, considering schemes that involve quantization at one terminal, the best rate of an achievable secret key is characterized as a function of quantization rate; secret key capacity is attained as the quantization rate tends to infinity. Structured codes are shown to attain the optimum tradeoff between secret key rate and quantization rate, constituting our second main contribution.

IEEE Transactions on Information Theory•Jan 12, 2012•49 citations

Secret-Key capacity of compound source models with one-way public communication

Nima Tavangaran, Holger Boche, Rafael F. Schaefer

In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this work, the Secret-Key generation model based on a compound source is studied where the source realization is unknown. The protocol should guarantee the security and reliability of the generated Secret-Key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the Secret-Key capacity is derived for the case where the public communication rate is limited. Furthermore, a multi-letter capacity formula is computed for the case where the public communication is unconstrained.

IEEE Information Theory Workshop (ITW)•Oct 1, 2015•4 citations

Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy

Sebastian Baur, Ning Cai, Moritz Wiese +1 more

Secret key generation at two terminals is considered. Each terminal observes one of the outputs of a two component source. The two source outputs are correlated. Additionally one terminal can send a message to the second terminal via a noiseless public channel. It is assumed that this message is rate constrained. An eavesdropper with access to the public communication should be kept ignorant of the secret key. The maximum secret key rate that can be achieved such that the key is uniformly distributed and meets the perfect secrecy requirement is determined. This result is established for a compound source model.

IEEE International Workshop on Information Forensics and Security•Dec 1, 2019•4 citations

Secret-Key Generation Using Compound Sources and One-Way Public Communication

Nima Tavangaran, Holger Boche, Rafael F. Schaefer

In the classical secret-key generation model, common randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this paper, the secret-key generation based on a compound source is studied where the realization of the source statistic is unknown. The protocol should guarantee the security and reliability of the generated secret-key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the secret-key capacity for a finite compound source is derived as a function of the public communication rate constraint. A multi-letter capacity formula is further computed for a finite compound source for the case in which the public communication is unconstrained. Finally, a single-letter capacity formula is derived for a degraded compound source with an arbitrary (possibly infinite) set of source states and a finite set of marginal states.

arXiv:1601.07513•IEEE Transactions on Information Forensics and Security•Jan 1, 2016•23 citations
We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS, a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key capacity for such systems with one-way public messaging. We then characterize a tradeoff between the secret key rate and exponential bounds on the probability of key agreement failure and on the secrecy of the key generated. We find that there is a fundamental tradeoff between reliability and secrecy.
We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states, where the channel state may be influenced by some of the parties involved. We derive single-letter expressions for the secret key capacity through a type of source emulation analysis. We also derive lower bounds on the achievable reliability and secrecy exponents, i.e., the exponential rates of decay of the probability of decoding error and of the information leakage. These exponents allow us to determine a set of strongly achievable secret key rates. For degraded eavesdroppers, the maximum strongly achievable rate equals the secret key capacity; our exponents can also be specialized to previously known results. In deriving our strong achievability results, we introduce a coding scheme that combines wiretap coding (to excite the channel) and key extraction (to distill keys from residual randomness). The secret key capacity is naturally seen to be a combination of both source- and channel-type randomness. Through examples, we illustrate a fundamental interplay between the portion of the secret key rate due to each type of randomness. We also illustrate inherent tradeoffs between the achievable reliability and secrecy exponents. Our new scheme also naturally accommodates rate limits on the public discussion. We show that under rate constraints, we are able to achieve larger rates than those that can be attained through a pure source emulation strategy.
We consider the fundamental limits of the secret key generation problem when the sources are excited by the sender. In many practical communication settings, the channel may be influenced by the parties involved. Similar to recent works on probing capacity and channels with action-dependent states, our system model captures such a scenario. We derive single-letter expressions for the secret key capacity. Our coding strategy involves wiretap channel coding and a key generation scheme. By assuming that the eavesdropper receives a degraded version of the legitimate receiver's observation, we also obtain a capacity result that does not involve any auxiliary random variables. Finally, by studying two examples, we show that there is a fundamental tradeoff in between the amount of common randomness (i.e., the secret key rate) and the wiretap secrecy rate.
Secret key generation by multiple terminals is considered based on their observations of jointly distributed Gaussian signals, followed by public communication among themselves. Exploiting an inherent connection between secrecy generation and lossy data compression, two main contributions are made. The first is a characterization of strong secret key capacity, and entails a converse proof technique that is valid for real-valued (and not necessarily Gaussian) as well as finite-valued signals. The capacity formula acquires a simple form when the terminals observe “symmetrically correlated” jointly Gaussian signals. For the latter setup with two terminals, considering schemes that involve quantization at one terminal, the best rate of an achievable secret key is characterized as a function of quantization rate; secret key capacity is attained as the quantization rate tends to infinity. Structured codes are shown to attain the optimum tradeoff between secret key rate and quantization rate, constituting our second main contribution.
In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this work, the Secret-Key generation model based on a compound source is studied where the source realization is unknown. The protocol should guarantee the security and reliability of the generated Secret-Key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the Secret-Key capacity is derived for the case where the public communication rate is limited. Furthermore, a multi-letter capacity formula is computed for the case where the public communication is unconstrained.
Secret key generation at two terminals is considered. Each terminal observes one of the outputs of a two component source. The two source outputs are correlated. Additionally one terminal can send a message to the second terminal via a noiseless public channel. It is assumed that this message is rate constrained. An eavesdropper with access to the public communication should be kept ignorant of the secret key. The maximum secret key rate that can be achieved such that the key is uniformly distributed and meets the perfect secrecy requirement is determined. This result is established for a compound source model.
In the classical secret-key generation model, common randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this paper, the secret-key generation based on a compound source is studied where the realization of the source statistic is unknown. The protocol should guarantee the security and reliability of the generated secret-key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the secret-key capacity for a finite compound source is derived as a function of the public communication rate constraint. A multi-letter capacity formula is further computed for a finite compound source for the case in which the public communication is unconstrained. Finally, a single-letter capacity formula is derived for a degraded compound source with an arbitrary (possibly infinite) set of source states and a finite set of marginal states.