A remark on secret-key generation over correlated fading channels

Khisti, Ashish; Diggavi, Suhas

doi:10.1109/glocomw.2011.6162578

Cited by 6 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore since lim P →∞ log 1 + P2 1+P1 = 0 clearly holds, using (19) and (20) it follows that lim P →∞ R − AB (P ) + R − BA (P ) = γ (100)…”

Section: Proof Of Corollarymentioning

confidence: 99%

“…Motivated by applications to wireless channels references [16], [17] study secret-key generation over a state-controlled broadcast channel However the cost of acquiring CSI is not accounted for in these setups. Secret-key generation over a fast fading Rayleigh channel in the forward direction and a public discussion channel in the reverse direction have been studied in [18], [19] for the case of coherent channels and in [20] for the case of non-coherent channels. Note that these works only consider one-way fading channels and do not account for the role of channel reciprocity in secret-key generation, which has been the focus of practical approaches.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Khisti

2016

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Fundamental limits of secret-key generation over a two-way, reciprocal and block fading wireless channel are investigated. Only statistical channel state information (CSI) of the main channel is assumed to be available, whereas the eavesdropper has perfect CSI of its own channel. We establish upper and lower bounds on the secret-key generation capacity with public discussion. The upper bound can be expressed as a sum of two terms -one of the terms arises due to channel reciprocity, while the other term arises due to the communication. In the limit of long coherence period, the contribution from channel reciprocity vanishes to zero, whereas the other term prevails. The lower bound involves a separation based scheme consisting of channel training followed by source emulation in each coherence block. The resulting rate also consists of the contribution from each phase. For Rayleigh fading channels, in the high signalto-noise ratio (SNR) regime, the gap between the upper and lower bounds decreases inversely with the coherence period. Numerical results indicate significant performance gains over training-only schemes even for moderate values of SNR and small coherence periods.

show abstract

“…Furthermore since lim P →∞ log 1 + P2 1+P1 = 0 clearly holds, using (19) and (20) it follows that lim P →∞ R − AB (P ) + R − BA (P ) = γ (100)…”

Section: Proof Of Corollarymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Khisti

2016

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…This property serves as a theoretical foundation to design the adaptive channel probing scheme based on a feedback controller. Assume a noisy channel, according to [15], [20], [21], the upper bound of KGR is equal to the conditional mutual information betweenĥ ab andĥ ba given Eve's observation:…”

Section: Theoretical Analysis: Probing Rate Versus Kgrmentioning

confidence: 99%

Adaptive Wireless Channel Probing for Shared Key Generation Based on PID Controller

Wei

Zeng

Mohapatra

2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Generating a shared key between two parties from the wireless channel is an increasingly interesting topic. The process of obtaining information from the wireless channel is called channel probing. Previous key generation schemes probe the channel at a preset and constant rate without any consideration of channel variation or probing efficiency. To satisfy the users' requirements for key generation rate (KGR) and to use the wireless channel efficiently, we propose an adaptive channel probing scheme based on the proportional-integral-derivative controller, which is used to tune the probing rate. Moreover, we use the Lempel-Ziv complexity to estimate the entropy rate of channel statistics (received signal strength), which is considered as an indicator of probing efficiency. The experimental results show that the controller can dynamically tune the probing rate and, meanwhile, to achieve a user desired KGR. It stabilizes the KGR at the desired value with error below 1 bit/s. Besides, channel probing process is efficient under different user velocities, motion types, and sites.

show abstract

“…In computing (38) we assume that the legitimate receivers have a genie-aided side information of the respective channel gains and furthermore no overhead arising from the transmission of public messages is considered. In Fig.…”

Section: Numerical Comparisonmentioning

confidence: 99%

Secret-Key Agreement Capacity over Reciprocal Fading Channels: A Separation Approach

Khisti

2012

Preprint

Self Cite

View full text Add to dashboard Cite

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are correlated. The channel gains between the legitimate terminals are not revealed to any terminal, whereas the channel gains of the eavesdropper are revealed to the eavesdropper. We propose a twophase transmission scheme, that reserves a certain portion of each coherence block for channel estimation, and the remainder of the coherence block for correlated source generation. The resulting secret-key involves contributions of both channel sequences and source sequences, with the contribution of the latter becoming dominant as the coherence period increases. We also establish an upper bound on the secret-key capacity, which has a form structurally similar to the lower bound. Our upper and lower bounds coincide in the limit of high signal-to-noise-ratio (SNR) and large coherence period, thus establishing the secret-key agreement capacity in this asymptotic regime. Numerical results indicate that the proposed scheme achieves significant gains over training-only schemes, even for moderate SNR and small coherence periods, thus implying the necessity of randomnesssharing in practical secret-key generation systems.

show abstract

A remark on secret-key generation over correlated fading channels

Cited by 6 publications

References 19 publications

Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Adaptive Wireless Channel Probing for Shared Key Generation Based on PID Controller

Secret-Key Agreement Capacity over Reciprocal Fading Channels: A Separation Approach

Contact Info

Product

Resources

About