Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
132 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Secret-Message Transmission by Echoing Encrypted Probes -- STEEP (2309.14529v1)

Published 25 Sep 2023 in cs.IT, eess.SP, and math.IT

Abstract: This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the insights into MAC's bounds, a scheme called secret-message transmission by echoing encrypted probes (STEEP) is proposed. STEEP consists of two phases: in phase 1, Alice sends random probes over a probing channel to Bob; in phase 2, Bob echoes back an estimated version of the probes, but encrypted by a secret, over a high-quality return channel. Provided that Eve is unable to obtain the exact probes transmitted by Alice in phase 1, STEEP guarantees a positive secrecy rate from Bob to Alice over the return channel even if Eve's channel strength during channel probing is stronger than Bob's. STEEP is applicable to both physical layer and upper layers in connected networks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  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. M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, “Wireless information-theoretic security,” IEEE Trans. Information Theory, Vol. 54, No. 6, pp. 2515-2534, June 2008.
  5. W. Yang, R. F. Schaefer, and H. V. Poor, “Wiretap channels: nonasymptotic fundamental limits,” IEEE Trans. Information Theory, Vol. 65, No. 7, pp. 4069-4093, July 2019.
  6. N. Ari, N. Thomos, and L. Musavian, “Performance analysis of short packet communications with multiple eavesdropper,” IEEE Trans. Communications, Vol. 70, No. 10, pp. 6778-6789, Oct. 2022.
  7. 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.
  8. U. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Information Theory, Vol. 39, No. 3, pp. 733-742, May 1993.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. L. Lai. Y. Liang and H. V. Poor, “A unified framework for key agreement over wireless fading channel,” IEEE Transactions on Information Forensics and Security, Vol. 7, No. 2, April 2012.
  17. A. Khisti, “Interactive secret key generation over reciprocal fading channel,” Proc of 50th Annual Allerton Conference, pp. 1374-1381, UIUC, IL, Oct, 2012.
  18. A. Maksud and Y. Hua, “Second-order analysis of secret-key capacity from a MIMO channel”, accepted for presentation at MILCOM2023, 30 Oct. - 3 Nov. 2023, Boston, MA, USA.
  19. K. R. Duffy and M. Medard, “Guessing random additive noise decoding with soft detection symbol reliability information — SGRAND,” 57th Annual Conference on Information Sciences and Systems, Baltimore, MD, March 2023.
  20. D. R. Stinson, “Universal hashing and authentication codes,” Designs, Codes and Cryptography, 4, 369-380 (1994).
  21. C. Huth, R. Guillaume, T. Strohm, P. Duplys, and I. A. Samuel, “Information reconciliation schemes in physical-layer security: A survey,” Comput. Netw., vol. 109, pp. 84-104, 2016.
Citations (6)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now