Noncoherent Capacity of Secret-Key Agreement With Public Discussion

Agrawal, Anurag A.; Rezki, Zouheir; Khisti, Ashish; Alouini, Mohamed‐Slim

doi:10.1109/tifs.2011.2158999

Cited by 22 publications

(22 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The rate of the Wyner-Ziv codebook must satisfy the rate constraint (22) and the associated secretkey rate is given by (19). Likewise the Wyner-Ziv codebook on the reverse channel must satisfy the rate constraint (23) and the associated rate of the secret-key is given by (20) We omit the secrecy analysis and a more detailed description of the proposed scheme due to space constraints.…”

Section: Proof Of Theoremmentioning

confidence: 99%

Interactive secret key generation over reciprocal fading channels

Khisti

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We study a two-terminal secret-key generation problem over a two-way, approximately reciprocal, block-fading channel. The channel gains between the legitimate terminals are not revealed to any terminal, whereas the channel gains of the eavesdropper are revealed perfectly to the eavesdropper. We study a separation based scheme that involves a training phase followed by a communication phase within each block. The training phase generates correlated estimates of the channel state sequence between the two terminals, whereas the communication phase generates correlated source sequences between the two terminals. A portion of the secret-key is generated from the correlated channel state sequences by creating omniscience between the legitimate terminals and the remainder of the secret-key is generated from the correlated source sequences. An upper bound on the secret-key capacity is also established by reducing the setup to a coherent channel by providing genieaided side information to the receivers. We observe that the diffrence between the upper and lower bound decreases as 1 T in the high signal-to-noise-ratio (SNR) regime. Numerical results indicate that the proposed scheme achieves significant gains over the commonly used training-only schemes even for moderate SNR.

show abstract

Section: Proof Of Theoremmentioning

confidence: 99%

Interactive secret key generation over reciprocal fading channels

Khisti

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…Specifically, we focus on ergodic fading channels with known statistics and we investigate the secure message rates and secret-key rates that can be obtained if there is only partial CSIT. In the extreme cases of perfect CSI and no CSI, the secrecy capacity and secret-key capacity have been studied for Single-Input Single Output (SISO) or Multiple-Input Multiple Output (MIMO) ergodic and block ergodic channels, see for instance [6], [7], [13]- [15]. However, to the best of our knowledge, few works analyze intermediate situations in which partial CSIT is available, for instance via a rate-limited feedback link.…”

Section: Introductionmentioning

confidence: 99%

Exploiting Partial Channel State Information for Secrecy over Wireless Channels

Bloch

Laneman

2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we investigate the effect of partial channel state information on the achievable secure communication rates and secret-key generation rates over ergodic fading channels. In particular, we establish lower bounds for the strong secrecy capacity and the strong secret-key capacity of ergodic and block-ergodic fading channels with partial Channel State Information at the Transmitter (CSIT). Our analysis sheds light on the usefulness of CSIT to harness the benefits of fading for secrecy and allows us to quantify the penalty incurred by lack of full CSIT. In particular, we illustrate numerically situations in which little CSIT is required to recover most of the benefits of fading and in which the legitimate terminals have an incentive to characterize their channel precisely.

show abstract

“…The secret-key generation codebook is then used conditioned on this knowledge at all the terminals. We observe that the capacity achieving technique in [10], [12] that involves joint binning of the receiver output and channel gains is sub-optimal. We then extend these results to the case when the transmitter also has access to a noisy CSI of the legitimate receiver.…”

Section: Introductionmentioning

confidence: 97%

“…The secret-key capacity is characterized in an analogous manner and Gaussian inputs are shown to be optimal. Reference [12] studies a non-coherent i.i.d. Rayleigh fading CW model and establishes that (i) the capacity achieving distribution is discrete and (ii) the secret-key capacity remains bounded in the signal-tonoise ratio (SNR) regardless of the number of antennas at each terminal.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A remark on secret-key generation over correlated fading channels

Khisti

Diggavi²

2011

2011 IEEE GLOBECOM Workshops (GC Wkshps)

View full text Add to dashboard Cite

Abstract-We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.

show abstract

Noncoherent Capacity of Secret-Key Agreement With Public Discussion

Cited by 22 publications

References 29 publications

Interactive secret key generation over reciprocal fading channels

Interactive secret key generation over reciprocal fading channels

Exploiting Partial Channel State Information for Secrecy over Wireless Channels

A remark on secret-key generation over correlated fading channels

Contact Info

Product

Resources

About