Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model
arXiv:0804.2940 · doi:10.1587/transfun.E92.A.525
Abstract
We consider the problem of secret key agreement in Gaussian Maurer's Model. In Gaussian Maurer's model, legitimate receivers, Alice and Bob, and a wire-tapper, Eve, receive signals randomly generated by a satellite through three independent memoryless Gaussian channels respectively. Then Alice and Bob generate a common secret key from their received signals. In this model, we propose a protocol for generating a common secret key by using the result of soft-decision of Alice and Bob's received signals. Then, we calculate a lower bound on the secret key rate in our proposed protocol. As a result of comparison with the protocol that only uses hard-decision, we found that the higher rate is obtained by using our protocol.
arXiv comment10 pages, 4 figures, to be appear in Proc. of 2008 IEEE International Symposium on Information Theory in Toronto, Canada
Cited by in corpus (7)
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication
- Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- On Stochastic Orders and Fast Fading Multiuser Channels with Statistical CSIT
- Biometric Identification Systems With Both Chosen and Generated Secret Keys by Allowing Correlation
- Effects of Quantization on the Multiple-Round Secret-Key Capacity