Data Encryption Battlefield: A Deep Dive into the Dynamic Confrontations in Ransomware Attacks

📅 2025-04-29
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Ransomware evades conventional detection via entropy-reduction techniques—such as Base64 obfuscation and intermittent/partial encryption—challenging static analysis. Method: This paper proposes an online incremental learning framework for real-time prediction of file encryption behavior. It systematically evaluates incremental learning’s adaptability against evolving ransomware, introduces a collaborative detection paradigm with encryption-mode-specific classifiers (AES-Base64 vs. intermittent), integrates Hoeffding Trees with warm-start random forests, and designs multi-format file feature engineering (entropy, byte distribution, structural offsets). Contribution/Results: Evaluated on 32.6 GB of real-world samples spanning 75 ransomware families, the framework achieves 98.2% accuracy for AES-Base64 encryption detection using Hoeffding Trees and 96.7% F1-score for intermittent encryption using random forests—substantially outperforming static models while enabling resource-efficient, real-time edge deployment.

Technology Category

Application Category

📝 Abstract
In the rapidly evolving landscape of cybersecurity threats, ransomware represents a significant challenge. Attackers increasingly employ sophisticated encryption methods, such as entropy reduction through Base64 encoding, and partial or intermittent encryption to evade traditional detection methods. This study explores the dynamic battle between adversaries who continuously refine encryption strategies and defenders developing advanced countermeasures to protect vulnerable data. We investigate the application of online incremental machine learning algorithms designed to predict file encryption activities despite adversaries evolving obfuscation techniques. Our analysis utilizes an extensive dataset of 32.6 GB, comprising 11,928 files across multiple formats, including Microsoft Word documents (doc), PowerPoint presentations (ppt), Excel spreadsheets (xlsx), image formats (jpg, jpeg, png, tif, gif), PDFs (pdf), audio (mp3), and video (mp4) files. These files were encrypted by 75 distinct ransomware families, facilitating a robust empirical evaluation of machine learning classifiers effectiveness against diverse encryption tactics. Results highlight the Hoeffding Tree algorithms superior incremental learning capability, particularly effective in detecting traditional and AES-Base64 encryption methods employed to lower entropy. Conversely, the Random Forest classifier with warm-start functionality excels at identifying intermittent encryption methods, demonstrating the necessity of tailored machine learning solutions to counter sophisticated ransomware strategies.
Problem

Research questions and friction points this paper is trying to address.

Explores dynamic ransomware encryption vs defense strategies
Tests machine learning on diverse file encryption detection
Evaluates classifiers against 75 ransomware families' tactics
Innovation

Methods, ideas, or system contributions that make the work stand out.

Online incremental machine learning predicts encryption
Hoeffding Tree detects AES-Base64 encryption effectively
Random Forest identifies intermittent encryption methods
🔎 Similar Papers
No similar papers found.
Arash Mahboubi
Arash Mahboubi
Charles Sturt University
CybersecurityRansomwareMalware and attack analysisSpread modellingThreat Hunting
H
Hamed Aboutorab
University of New South Wales, Canberra, 2600, Australia
S
S. Çamtepe
CSIRO Data 61, Sydney, New South Wales, 2000, Australia
H
Hang Thanh Bui
University of New South Wales, Canberra, 2600, Australia
K
Khanh Luong
Queensland University of Technology, Queensland, 4000, Australia
Keyvan Ansari
Keyvan Ansari
Murdoch University
Connected VehiclesSmart MobilityInternet of ThingsCyber Security
S
Shenlu Wang
CSIRO Data 61, Sydney, New South Wales, 2000, Australia
B
Bazara Barry
Cyber Security NSW – NSW Department of Customer Service