An Enhanced Steganography-Based Botnet Communication Method in BitTorrent

G. Park, Youngho Cho, Gang QuElectronics 2025 · DOI

TL;DR

This paper introduces a novel method for botnet command and control (C&C) communication using steganography within the BitTorrent protocol. By embedding C&C messages into BitTorrent's "Piece" messages, the system achieves significantly higher payload capacity and better stealth compared to existing stego-botnet techniques, making it harder to detect and more efficient for attackers.

What Problem Does This Paper Address?

Botnets, networks of compromised computers controlled by attackers, pose a significant threat. Traditional botnets often use centralized command and control (C&C) systems, making them vulnerable to detection and disruption. To evade detection, attackers have turned to steganography, hiding C&C messages within seemingly innocuous media files shared on platforms like social networking sites (SNS). However, SNS platforms impose strict file size limits, severely restricting the amount of data (payload capacity) that can be hidden. While Peer-to-Peer (P2P) networks like BitTorrent offer a solution by removing file size limitations, existing steganographic methods within these networks, like those using Bitfield messages, still suffer from low payload capacity and can be detected. This paper addresses the challenge of creating a stealthy and high-capacity C&C communication channel for botnets within the BitTorrent ecosystem.

Methods

The core of the proposed method lies in leveraging the BitTorrent protocol's "Piece" message for steganography. Instead of using the "Bitfield" message (which is sent only once per session and has limited capacity), the authors embed C&C messages within the "Piece" messages, which are the actual data chunks of a file being transferred.

Here's how it works:

  1. Embedding: The botmaster embeds the C&C message into a video file, which then becomes part of a "Piece" message.
  2. Pre-Verification Copying: Crucially, before the BitTorrent client performs its standard hash verification on the received "Piece" message, a copy of this message is saved to a random folder.
  3. Extraction: The bot then extracts the hidden C&C message from this copied "Piece" message.
  4. Standard Verification: The original "Piece" message proceeds through the normal BitTorrent hash verification. If it passes, the file is reconstructed. If it fails (due to modification), it's discarded, and the bot requests it again.
  5. Cleanup: The copied "Piece" messages containing the extracted secret are deleted, leaving no trace in the standard file reconstruction process.

This approach allows for continuous C&C communication, leverages the large file transfer capabilities of BitTorrent, and aims to maintain the appearance of normal BitTorrent traffic.

Datasets

Not discussed in the paper. The experiments used a shared video file of 105 MB as the cover medium.

Key Insights and Ideas

  • Piece Message is Key: The most significant insight is the shift from using "Bitfield" messages to "Piece" messages for steganography in BitTorrent. This unlocks much higher payload capacity because "Piece" messages are the actual data blocks being transferred, unlike the metadata-focused "Bitfield."
  • Pre-Verification Copying is Crucial: The technique of copying the "Piece" message before the BitTorrent client's hash verification is ingenious. It allows the bot to extract the secret without interfering with the integrity checks that keep the BitTorrent network functioning normally.
  • Stealth Through Normalcy: By embedding C&C data within legitimate "Piece" messages and ensuring the final downloaded file is intact, the covert traffic closely mimics normal BitTorrent activity, making it very difficult for network monitoring tools to distinguish.
  • Overcoming SNS Limitations: This method directly addresses the payload limitations of SNS-based stego-botnets by utilizing the unbounded file transfer capabilities of P2P networks.

Key Results

  • Payload Capacity: The proposed method achieves at least a twofold increase in payload capacity compared to prior work using Bitfield messages. For instance, to transmit 1 GB of C&C data, the previous method required 128 video files (2 GB each), while the proposed method requires only 1 video file.
  • Efficiency: The increased payload capacity translates to more efficient C&C message delivery, reducing the number of cover media files needed.
  • Stealth: Wireshark analysis showed no significant differences between the traffic generated by the proposed model and normal BitTorrent traffic, indicating high stealthiness.
  • Consistency and Integrity: The method maintains BitTorrent protocol consistency and data integrity by ensuring that only verified pieces are used to reconstruct the final file.

Limitations and Future Work

  • Controlled Environment: The experiments were conducted in a controlled environment with only four peers. Broader simulations in more complex P2P environments are needed.
  • Advanced Detection: While stealthy against current methods, the authors acknowledge that more sophisticated detection approaches (like deep packet inspection or advanced machine learning) might identify anomalies by looking at fragment deletion/reassembly patterns.
  • Robustness Evaluation: The paper notes that due to the absence of a dedicated verification procedure at the destination for the copied messages, the full robustness of the proposed technique against network attacks couldn't be fully evaluated.
  • Future Directions:
    • Develop enhanced algorithms to improve robustness against network attacks while maintaining payload efficiency.
  • Explore advanced detection mechanisms for P2P environments, potentially combining data loss prevention (DLP) with machine learning.
  • Integrate cryptographic and blockchain-based algorithms to further enhance robustness, confidentiality, and decentralization, making the C&C infrastructure more resilient.
  • Investigate new algorithms for stealth and channel stability.

Summary updated

Abstract

In a botnet attack, significant damage can occur when an attacker gains control over a large number of compromised network devices. Botnets have evolved from traditional centralized architectures to decentralized Peer-to-Peer (P2P) and hybrid forms. Recently, a steganography-based botnet (Stego-botnet) has emerged, which conceals command and control (C&C) messages within cover media such as images or video files shared over social networking sites (SNS). This type of Stego-botnet can evade conventional detection systems, as identifying hidden messages embedded in media transmitted via SNS platforms is inherently challenging. However, the inherent file size limitations of SNS platforms restrict the achievable payload capacity of such Stego-botnets. Moreover, the centralized characteristics of conventional botnet architectures expose attackers to a higher risk of identification. To overcome these challenges, researchers have explored network steganography techniques leveraging P2P networks such as BitTorrent, Google Suggest, and Skype. Among these, a hidden communication method utilizing Bitfield messages in BitTorrent has been proposed, demonstrating improved concealment compared to prior studies. Nevertheless, existing approaches still fail to achieve sufficient payload capacity relative to traditional digital steganography techniques. In this study, we extend P2P-based network steganography methods—particularly within the BitTorrent protocol—to address these limitations. We propose a novel botnet C&C communication model that employs network steganography over BitTorrent and validate its feasibility through experimental implementation. Furthermore, our results show that the proposed Stego-botnet achieves a higher payload capacity and outperforms existing Stego-botnet models in terms of both efficiency and concealment performance.
BibTeX
@inproceedings{park2025enhanced,
  author = {G. Park and Youngho Cho and Gang Qu},
  title = {{An Enhanced Steganography-Based Botnet Communication Method in BitTorrent}},
  booktitle = {Electronics},
  year = {2025},
  doi = {10.3390/electronics14204081},
}
Figure