Papers
Topics
Authors
Recent
Search
2000 character limit reached

Perfectly Secure Key Agreement Over a Full Duplex Wireless Channel

Published 10 Apr 2024 in cs.IT and math.IT | (2404.06952v2)

Abstract: Secret key generation (SKG) between authenticated devices is a pivotal task for secure communications. Diffie-Hellman (DH) is de-facto standard but not post-quantum secure. In this paper, we shall invent and analyze a new security primitive that is specifically designed for WPAN. For WPAN, wireless channel-based SKG has been proposed but was not widely deployed due to its critical dependence on the channel's entropy which is uncontrollable. We formulate a different approach: We still exploit channel properties but mainly hinge on the reciprocity of the wireless channel and not on the channel's entropy. The radio advantage comes from the use of full duplex communication. We show that in this situation both legitimate parties can agree on a common secret key even without ever probing the channel at all. At the core is a new bisparse blind deconvolution scheme for which we prove correctness and information-theoretic, i.e. perfect, security. We show that, ultimately, a secret key can be extracted and give a lower bound for the number of secret key bits which is then verified by experiments.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. G. Alagic, D. Apon, D. Cooper, Q. Dang, T. Dang, J. Kelsey, J. Lichtinger, Y.-K. Liu, C. Miller, D. Moody, R. Peralta, R. Perlner, A. Robinson, and D. Smith-Tone, “Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process,” Internal Report, no. 8413, 2022.
  2. T. J. Pierson, T. Peters, R. Peterson, and D. Kotz, “Closetalker: Secure, short-range ad hoc wireless communication,” in Proceedings of the 17th Annual International Conference on Mobile Systems, Applications, and Services, ser. MobiSys ’19.   New York, NY, USA: Association for Computing Machinery, 2019, p. 340–352. [Online]. Available: https://doi.org/10.1145/3307334.3326100
  3. K. Reaz and G. Wunder, “Compass: Proximity aware common passphrase agreement protocol for wi-fi devices using physical layer security,” in Innovative Mobile and Internet Services in Ubiquitous Computing, L. Barolli, K. Yim, and H.-C. Chen, Eds.   Cham: Springer International Publishing, 2022, pp. 263–275.
  4. T. J. Pierson, T. Peters, R. Peterson, and D. Kotz, “Proximity detection with single-antenna iot devices,” in The 25th Annual International Conference on Mobile Computing and Networking, ser. MobiCom ’19.   New York, NY, USA: Association for Computing Machinery, 2019. [Online]. Available: https://doi.org/10.1145/3300061.3300120
  5. A. Mukherjee, S. A. A. Fakoorian, J. Huang, and A. L. Swindlehurst, “Principles of physical layer security in multiuser wireless networks: A survey,” IEEE Communications Surveys & Tutorials, vol. 16, no. 3, pp. 1550–1573, 2014.
  6. W. Tang, X. Chen, M. Z. Chen, J. Y. Dai, Y. Han, S. Jin, Q. Cheng, G. Y. Li, and T. J. Cui, “On channel reciprocity in reconfigurable intelligent surface assisted wireless network,” CoRR, vol. abs/2103.03753, 2021. [Online]. Available: https://arxiv.org/abs/2103.03753
  7. J. Zhang, T. Q. Duong, A. Marshall, and R. Woods, “Key generation from wireless channels: A review,” IEEE Access, vol. 4, pp. 614–626, 2016.
  8. R. Fritschek and G. Wunder, “On full-duplex secure key generation with deterministic models,” in 2017 IEEE Conference on Communications and Network Security (CNS), 2017, pp. 550–554.
  9. E. J. Candes, “The restricted isometry property and its implications for compressed sensing,” Compte Rendus de l’Academie des Sciences, vol. 346, pp. 589–592, May 2008. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S1631073X08000964
  10. E. J. Candes, Y. C. Eldar, T. Strohmer, and V. Voroninski, “Phase retrieval via matrix completion,” SIAM review, vol. 57, pp. 225–251, 2015.
  11. J. Eisert, A. Flinth, B. Groß, I. Roth, and G. Wunder, “Hierarchical compressed sensing,” in Compressed Sensing in Information Processing.   Springer, 2022, pp. 1–35.
  12. R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,” IEEE Transactions on information theory, vol. 56, no. 4, pp. 1982–2001, 2010.
  13. I. Roth, M. Kliesch, A. Flinth, G. Wunder, and J. Eisert, “Reliable recovery of hierarchically sparse signals for gaussian and kronecker product measurements,” IEEE Transactions on Signal Processing, vol. 68, pp. 4002–4016, 2020.
  14. A. Flinth, I. Roth, and G. Wunder, “Bisparse blind deconvolution through hierarchical sparse recovery,” 2024. [Online]. Available: https://arxiv.org/abs/2210.11993v2
  15. X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,” Applied and computational harmonic analysis, vol. 47, pp. 893–934, 2019.
  16. K. Lee, Y. Wu, and Y. Bresler, “Near-optimal compressed sensing of a class of sparse low-rank matrices via sparse power factorization,” IEEE Trans. Inf. Th., vol. 64, pp. 1666–1698, 2017.
  17. K. Lee, Y. Li, M. Junge, and Y. Bresler, “Blind recovery of sparse signals from subsampled convolution,” IEEE Trans. Inf. Th., vol. 63, pp. 802–821, 2016.
  18. P. Jung, F. Krahmer, and D. Stöger, “Blind demixing and deconvolution at near-optimal rate,” IEEE Trans. Inf. Th., vol. 64, pp. 704–727, 2018.
  19. Y. Chen, J. Fan, B. Wang, and Y. Yan, “Convex and nonconvex optimization are both minimax-optimal for noisy blind deconvolution under random designs,” Journal of the American Statistical Association, pp. 1–11, 2021. [Online]. Available: https://doi.org/10.1080/01621459.2021.1956501
  20. A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Trans. Inf. Th., vol. 60, pp. 1711–1732, 2013.
  21. S. Ling and T. Strohmer, “Self-calibration and biconvex compressive sensing,” Inverse Problems, vol. 31, p. 115002, sep 2015. [Online]. Available: https://doi.org/10.1088%2F0266-5611%2F31%2F11%2F115002
  22. A. M. Ostrowski, “A quantitative formulation of sylvester’s law of inertia,” Proceedings of the National Academy of Sciences, vol. 45, no. 5, pp. 740–744, 1959.
  23. G. Wunder, S. Stefanatos, A. Flinth, I. Roth, and G. Caire, “Low-overhead hierarchically-sparse channel estimation for multiuser wideband massive mimo,” IEEE Transactions on Wireless Communications, vol. 18, no. 4, pp. 2186–2199, 2019.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.

Sign Up for Free