CONNECTION: COvert chaNnel NEtwork attaCk Through bIt-rate mOdulatioN

• URL: http://arxiv.org/abs/2404.15858v1
• Date: Wed, 24 Apr 2024 13:14:09 GMT
• Title: CONNECTION: COvert chaNnel NEtwork attaCk Through bIt-rate mOdulatioN
• Authors: Simone Soderi, Rocco De Nicola,
• Abstract summary: Covert channel networks are a well-known method for circumventing the security measures organizations put in place to protect their networks from adversarial attacks. This paper introduces a novel method based on bit-rate modulation for implementing covert channels between devices connected over a wide area network.
• Score: 1.7034813545878589
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Covert channel networks are a well-known method for circumventing the security measures organizations put in place to protect their networks from adversarial attacks. This paper introduces a novel method based on bit-rate modulation for implementing covert channels between devices connected over a wide area network. This attack can be exploited to exfiltrate sensitive information from a machine (i.e., covert sender) and stealthily transfer it to a covert receiver while evading network security measures and detection systems. We explain how to implement this threat, focusing specifically on covert channel networks and their potential security risks to network information transmission. The proposed method leverages bit-rate modulation, where a high bit rate represents a '1' and a low bit rate represents a '0', enabling covert communication. We analyze the key metrics associated with covert channels, including robustness in the presence of legitimate traffic and other interference, bit-rate capacity, and bit error rate. Experiments demonstrate the good performance of this attack, which achieved 5 bps with excellent robustness and a channel capacity of up to 0.9239 bps/Hz under different noise sources. Therefore, we show that bit-rate modulation effectively violates network security and compromises sensitive data.

Related papers

• Attacking Slicing Network via Side-channel Reinforcement Learning Attack [9.428116807615407]
  We introduce a reinforcement learning-based side-channel cache attack framework specifically designed for network slicing environments. Our framework dynamically identifies and exploit cache locations storing sensitive information, such as authentication keys and user registration data. Experimental results showcase the superiority of our approach, achieving a success rate of approximately 95% to 98%.
  arXiv  Detail & Related papers  (2024-09-17T15:07:05Z)
• Exploiting CPU Clock Modulation for Covert Communication Channel [0.3277163122167433]
  We unveil a novel covert channel exploiting the duty cycle modulation feature of modern x86 processors. Specifically, we illustrate how two collaborating processes, a sender and a receiver can manipulate this feature to transmit sensitive information surreptitiously. Our live system implementation demonstrates that this covert channel can achieve a data transfer rate of up to 55.24 bits per second.
  arXiv  Detail & Related papers  (2024-04-08T19:23:04Z)
• Threats and Limitations of Terrestrial Broadcast Attacks [1.2289361708127877]
  We implement a proof-of-concept attack based on a malicious Hybrid Broadcast Broadband TV app. These attacks are severely limited in range due to required co-channel protection ratios (CCPRs) We present evidence for these limitations in form of laboratory experiments, extensive simulations, and field measurements.
  arXiv  Detail & Related papers  (2024-02-07T18:03:23Z)
• Semantic Entropy Can Simultaneously Benefit Transmission Efficiency and Channel Security of Wireless Semantic Communications [55.54210451136529]
  We propose SemEntropy to explore semantics of data for both adaptive transmission and physical layer encryption. We show that SemEntropy can keep the semantic accuracy remain 95% with 60% less transmission.
  arXiv  Detail & Related papers  (2024-02-05T12:25:02Z)
• Eavesdropper localization for quantum and classical channels via nonlinear scattering [58.720142291102135]
  Quantum key distribution (QKD) offers theoretical security based on the laws of physics. We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels. We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
  arXiv  Detail & Related papers  (2023-06-25T21:06:27Z)
• Is Semantic Communications Secure? A Tale of Multi-Domain Adversarial Attacks [70.51799606279883]
  We introduce test-time adversarial attacks on deep neural networks (DNNs) for semantic communications. We show that it is possible to change the semantics of the transferred information even when the reconstruction loss remains low.
  arXiv  Detail & Related papers  (2022-12-20T17:13:22Z)
• Mixture GAN For Modulation Classification Resiliency Against Adversarial Attacks [55.92475932732775]
  We propose a novel generative adversarial network (GAN)-based countermeasure approach. GAN-based aims to eliminate the adversarial attack examples before feeding to the DNN-based classifier. Simulation results show the effectiveness of our proposed defense GAN so that it could enhance the accuracy of the DNN-based AMC under adversarial attacks to 81%, approximately.
  arXiv  Detail & Related papers  (2022-05-29T22:30:32Z)
• Harnessing Wireless Channels for Scalable and Privacy-Preserving Federated Learning [56.94644428312295]
  Wireless connectivity is instrumental in enabling federated learning (FL) Channel randomnessperturbs each worker inversions model update while multiple workers updates incur significant interference on bandwidth. In A-FADMM, all workers upload their model updates to the parameter server using a single channel via analog transmissions. This not only saves communication bandwidth, but also hides each worker's exact model update trajectory from any eavesdropper.
  arXiv  Detail & Related papers  (2020-07-03T16:31:15Z)
• Physical-Layer Authentication Using Channel State Information and Machine Learning [0.0]
  Strong authentication in an interconnected wireless environment continues to be an important, but sometimes elusive goal. Research in physical-layer authentication using channel features holds promise as a technique to improve network security for a variety of devices. We propose the use of machine learning and measured multiple-input multiple-output communications channel information to make a decision on whether or not to authenticate a particular device.
  arXiv  Detail & Related papers  (2020-06-05T21:26:01Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.