Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pilot-Attacks Can Enable Positive-Rate Covert Communications of Wireless Hardware Trojans

Published 15 Apr 2024 in cs.IT and math.IT | (2404.09922v2)

Abstract: Hardware Trojans can inflict harm on wireless networks by exploiting the link margins inherent in communication systems. We investigate a setting in which, alongside a legitimate communication link, a hardware Trojan embedded in the legitimate transmitter attempts to establish communication with its intended rogue receiver. To illustrate the susceptibility of wireless networks against pilot attacks, we examine a two-phased scenario. In the channel estimation phase, the Trojan carries out a covert pilot scaling attack to corrupt the channel estimation of the legitimate receiver. Subsequently, in the communication phase, the Trojan exploits the ensuing imperfect channel estimation to covertly communicate with its receiver. By analyzing the corresponding hypothesis tests conducted by the legitimate receiver in both phases, we establish that the pilot scaling attack allows the Trojan to operate in the so-called "linear regime" i.e., covertly and reliably transmitting at a positive rate to the rogue receiver. Our results highlight the vulnerability of the channel estimation process in wireless communication systems against hardware Trojans.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. B. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communication with low probability of detection on AWGN channels,” IEEE JSAC, vol. 31, no. 9, pp. 1921–1930, September 2013.
  2. S. Sangodoyin, F. T. Werner, B. B. Yilmaz, C.-L. Cheng, E. M. Ugurlu, N. Sehatbakhsh, M. Prvulovic, and A. Zajic, “Side-channel propagation measurements and modeling for hardware security in IoT devices,” IEEE TAP, vol. 69, no. 6, pp. 3470–3484, Jun. 2021.
  3. K. S. Subramani, A. Antonopoulos, A. A. Abotabl, A. Nosratinia, and Y. Makris, “Demonstrating and mitigating the risk of an FEC-based hardware Trojan in wireless networks,” IEEE TIFS, vol. 14, no. 10, pp. 2720–2734, 2019.
  4. K. S. Subramani, N. Helal, A. Antonopoulos, A. Nosratinia, and Y. Makris, “Amplitude-modulating analog/RF hardware Trojans in wireless networks: Risks and remedies,” IEEE TIFS, vol. 15, pp. 3497–3510, 2020.
  5. M. R. Bloch, “Covert communication over noisy channels: A resolvability perspective,” IEEE Trans. Inf. Theory, vol. 62, no. 5, pp. 2334–2354, 2016.
  6. L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” IEEE Trans. Inf. Theory, vol. 62, no. 6, pp. 3493–3503, Jun. 2016.
  7. S.-H. Lee, L. Wang, A. Khisti, and G. W. Wornell, “Covert communication with channel-state information at the transmitter,” IEEE TIFS, vol. 13, no. 9, pp. 2310–2319, 2018.
  8. P. H. Che, M. Bakshi, C. Chan, and S. Jaggi, “Reliable deniable communication with channel uncertainty,” in 2014 IEEE Information Theory Workshop (ITW), Hobart, Tasmania, November 2014, pp. 30–34.
  9. T. V. Sobers, B. A. Bash, S. Guha, D. Towsley, and D. Goeckel, “Covert communication in the presence of an uninformed jammer,” IEEE TWC, vol. 16, no. 9, pp. 6193–6206, 2017.
  10. S. Lee, R. Baxley, M. Weitnauer, and B. Walkenhorst, “Achieving undetectable communication,” IEEE JSTSP, vol. 9, no. 7, pp. 1195–1205, Oct 2015.
  11. H. Zivari-Fard, M. Bloch, and A. Nosratinia, “Keyless covert communication via channel state information,” IEEE Trans. Inf. Theory, vol. 68, no. 8, pp. 5440–5474, Aug. 2022.
  12. E. Tekin and A. Yener, “The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming,” IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2735–2751, Jun. 2008.
  13. B. Hassibi and B. M. Hochwald, “How much training is needed in multiple-antenna wireless links?” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 951–963, 2003.
  14. G. Caire, G. Taricco, and E. Biglieri, “Optimum power control over fading channels,” IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1468–1489, 1999.
  15. S. V. Hanly and D. N. C. Tse, “Multiaccess fading channels. ii. delay-limited capacities,” IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 2816–2831, 1998.
  16. H. Q. Ta and S. W. Kim, “Covert communication under channel uncertainty and noise uncertainty,” in IEEE ICC 2019.   IEEE, 2019, pp. 1–6.
  17. S. Lee, R. J. Baxley, M. A. Weitnauer, and B. Walkenhorst, “Achieving undetectable communication,” JSTSP, vol. 9, no. 7, pp. 1195–1205, 2015.
  18. J. Duchi, “Derivations for linear algebra and optimization,” 2007, manuscript available at https://ai.stanford.edu/~jduchi/projects/general_notes.pdf.
  19. K. S. Miller, “On the inverse of the sum of matrices,” Mathematics Magazine, vol. 54, no. 2, pp. 67–72, 1981.
  20. H. Flanders, “Differentiation under the integral sign,” The American Mathematical Monthly, vol. 80, no. 6, pp. 615–627, 1973.
  21. B. Laurent and P. Massart, “Adaptive estimation of a quadratic functional by model selection,” Annals of Statistics, pp. 1302–1338, 2000.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

Open Problems

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

Continue Learning

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

Collections

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

Tweets

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