Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unification of Secret Key Generation and Wiretap Channel Transmission (2403.06438v1)

Published 11 Mar 2024 in cs.IT, eess.SP, and math.IT

Abstract: This paper presents further insights into a recently developed round-trip communication scheme called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)''. A legitimate wireless channel between a multi-antenna user (Alice) and a single-antenna user (Bob) in the presence of a multi-antenna eavesdropper (Eve) is focused on. STEEP does not require full-duplex, channel reciprocity or Eve's channel state information, but is able to yield a positive secrecy rate in bits per channel use between Alice and Bob in every channel coherence period as long as Eve's receive channel is not noiseless. This secrecy rate does not diminish as coherence time increases. Various statistical behaviors of STEEP's secrecy capacity due to random channel fading are also illustrated.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (13)
  1. C. E. Shannon, “Communication theory of secrecy systems,” Bell Lab Technical Journal, Vol. 28, No. 4, pp. 656-715, 1948.
  2. A. D. Wyner, “The wire-tap channel,” Bell Lab Tehnical Journal, Vol. 54, No. 8, pp. 1355-1367, Oct 1975.
  3. I. Csiszar and J. Korner, “Broadcast channel with confientiall messages,” IEEE Trans. Infomation Theory, Vol. 24, No. 3, pp. 339-348, May 1978.
  4. C. Feng, H.-M. Wang, and H. V. Poor, “Reliable and secure short-packet communications,” IEEE Trans. Wireless Communications, Vol. 21, No. 3, pp. 1913-1926, Mar. 2022.
  5. R. Wilson, D. Tse, and R. A. Scholtz, “Channel identification: secret sharing using reciprocity in ultrawideband channels,” IEEE Trans. Inf. Forensics Secur., vol. 2, no. 3, pp. 364–375, Sep. 2007.
  6. J. W. Wallace and R. K. Sharma, “Automatic secret keys from reciprocal MIMO wireless channels: Measurement and analysis,” IEEE Trans. Inf. Forensics Secur., vol. 5, no. 3, pp. 381–392, Sep. 2010.
  7. N. Aldaghri and H. Mahdavifar, “Physical layer secret key generation in static environments”, IEEE Transactions on Information Forensics and Security, Vol. 15, pp. 2692-2705, Feb. 2020.
  8. G. Li, H. Yang, J. Zhang, H. Liu, and A. Hu, “Fast and secure key generation with channel obfuscation in slowly varying environments,” IEEE INFOCOM 2022, May 2022.
  9. Y. Hua, “Generalized channel probing and generalized pre-processing for secret key generation,” IEEE Transactions on Signal Processing, Vol. 71, pp. 1067-1082, April 2023.
  10. Y. Hua and A. Maksud, “Secret key generation from MIMO channel with or without reciprocity,” 57th Annual Conference on Information Sciences and Systems, Baltimore, MD, March 2023.
  11. U. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Information Theory, Vol. 39, No. 3, pp. 733-742, May 1993.
  12. R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography, Part I: secret sharing,” IEEE Trans. Information Theory, Vol. 39, pp. 1121-1132, July 1993.
  13. Y. Hua, “Secret-message transmission by echoing encrypted probes –- STEEP”, 2309.14529.pdf (arxiv.org), Sept 2023.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Yingbo Hua (21 papers)
  2. Md Saydur Rahman (6 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com