A Novel Distributed Secret Key Extraction Technique for Wireless Network 


Vol. 39,  No. 12, pp. 708-717, Dec.  2014


PDF
  Abstract

In this paper, we present a secret key distribution protocol without resorting to a key management infrastructure targeting at providing a low-complexity distributed solution to wireless network. The proposed scheme extracts a secret key from the random fluctuation of wireless channels. By exploiting time division duplexing transmission, two legitimate users, Alice and Bob can have highly correlated channel gains due to channel reciprocity, and a pair of random bit sequences can be generated by quantizing the channel gains. We propose a novel adaptive quantization scheme that adjusts quantization thresholds according to channel variations and reduces the mismatch probability between generated bit sequences by Alice and Bob. BCH codes, as a low-complexity and pratical approach, are also employed to correct the mismatches between the pair of bit sequences and produce a secret key shared by Alice and Bob. To maximize the secret key extraction rate, the parameters, quantization levels and code rates of BCH codes are jointly optimized.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Im, H. Jeon, J. Ha, "A Novel Distributed Secret Key Extraction Technique for Wireless Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 12, pp. 708-717, 2014. DOI: .

[ACM Style]

Sanghun Im, Hyungsuk Jeon, and Jeongseok Ha. 2014. A Novel Distributed Secret Key Extraction Technique for Wireless Network. The Journal of Korean Institute of Communications and Information Sciences, 39, 12, (2014), 708-717. DOI: .

[KICS Style]

Sanghun Im, Hyungsuk Jeon, Jeongseok Ha, "A Novel Distributed Secret Key Extraction Technique for Wireless Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 12, pp. 708-717, 12. 2014.