Efficient Malware Detection in Cybersecurity: Leveraging Advanced Data Structures for Enhanced Threat Identification

Notice

This is an unedited manuscript accepted for publication and provided as an Article in Press for early access at the author’s request. The article will undergo copyediting, typesetting, and galley proof review before final publication. Please be aware that errors may be identified during production that could affect the content. All legal disclaimers of the journal apply.

Year : 2024 | Volume :02 | Issue : 02 | Page : –
By
vector

P. Devi Sravanthi,

vector

Manas Kumar Yogi,

  1. Post Graduate Student, Department of Computer Science and Engineering, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India
  2. Assistant Professor, Department of Computer Science and Engineering, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India

Abstract document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_abs_111500’);});Edit Abstract & Keyword

The cybersecurity landscape is constantly changing, with more advanced malware creating major challenges for detection systems. To address these challenges effectively, advanced data structures have become essential in optimizing how data is managed, processed, and analyzed for malware detection. This review paper delves into the role of several cutting-edge data structures—Bloom Filters, Tries, Hash Tables, Graphs, Decision Trees, and Suffix Trees—in enhancing the efficiency and accuracy of malware detection mechanisms. Bloom Filters offer rapid membership testing, crucial for initial checks of malware signatures with minimal memory usage. Tries facilitating efficient string searches, making them ideal for managing and matching malware signatures. Hash Tables enable quick lookups of malware behavior profiles, supporting real-time detection. Graphs model malware propagation and network activity, aiding in identifying and mitigating threats. Decision Trees classify files and activities based on learned features, enhancing classification accuracy. Suffix Trees detect variants of known malware by analyzing common patterns. The paper provides a comprehensive examination of these structures, their applications, benefits, limitations, and potential advancements in improving malware detection systems.

Keywords: Cybersecurity, Attack, Tries, Bloom Filters, Hash tables

[This article belongs to International Journal of Data Structure Studies (ijdss)]

How to cite this article:
P. Devi Sravanthi, Manas Kumar Yogi. Efficient Malware Detection in Cybersecurity: Leveraging Advanced Data Structures for Enhanced Threat Identification. International Journal of Data Structure Studies. 2024; 02(02):-.
How to cite this URL:
P. Devi Sravanthi, Manas Kumar Yogi. Efficient Malware Detection in Cybersecurity: Leveraging Advanced Data Structures for Enhanced Threat Identification. International Journal of Data Structure Studies. 2024; 02(02):-. Available from: https://journals.stmjournals.com/ijdss/article=2024/view=0

Full Text PDF

Full Text PDF

References
document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_ref_111500’);});Edit

  1. Aghaeikheirabady M, Farshchi SM, Shirazi H. A new approach to malware detection by comparative analysis of data structures in a memory image. In2014 International Congress on Technology, Communication and Knowledge (ICTCK) 2014 Nov 26 (pp. 1-4). IEEE.
  2. Aslan ÖA, Samet R. A comprehensive review on malware detection approaches. IEEE access. 2020 Jan 3;8:6249-71.
  3. Vinayakumar R, Alazab M, Soman KP, Poornachandran P, Venkatraman S. Robust intelligent malware detection using deep learning. IEEE access. 2019 Apr 3;7:46717-38.
  4. Bilot T, El Madhoun N, Al Agha K, Zouaoui A. A survey on malware detection with graph representation learning. ACM Computing Surveys. 2024 Jun 29;56(11):1-36.
  5. Tahir, Rabia. “A study on malware and malware detection techniques.” International Journal of Education and Management Engineering 8.2 (2018): 20.
  6. Oak R, Du M, Yan D, Takawale H, Amit I. Malware detection on highly imbalanced data through sequence modeling. InProceedings of the 12th ACM Workshop on artificial intelligence and security 2019 Nov 11 (pp. 37-48).
  7. Qiu J, Zhang J, Luo W, Pan L, Nepal S, Xiang Y. A survey of android malware detection with deep neural models. ACM Computing Surveys (CSUR). 2020 Dec 6;53(6):1-36.
  8. 8.Jeon, Jueun, Jong Hyuk Park, and Young-Sik Jeong. “Dynamic analysis for IoT malware detection with convolution neural network model.” Ieee Access 8 (2020): 96899-96911.
  9. Sihwail R, Omar K, Ariffin KZ. A survey on malware analysis techniques: Static, dynamic, hybrid and memory analysis. Int. J. Adv. Sci. Eng. Inf. Technol. 2018 Sep 30;8(4-2):1662-71.
  10. Xu K, Li Y, Deng R, Chen K, Xu J. Droidevolver: Self-evolving android malware detection system. In2019 IEEE European Symposium on Security and Privacy (EuroS&P) 2019 Jun 17 (pp. 47-62). IEEE.
  11. Alasmary H, Khormali A, Anwar A, Park J, Choi J, Abusnaina A, Awad A, Nyang D, Mohaisen A. Analyzing and detecting emerging Internet of Things malware: A graph-based approach. IEEE Internet of Things Journal. 2019 Jul 1;6(5):8977-88.
  12. Ngo, Quoc-Dung, et al. “A survey of IoT malware and detection methods based on static features.” ICT express 6.4 (2020): 280-286.
  13. Akcora CG, Li Y, Gel YR, Kantarcioglu M. Bitcoinheist: Topological data analysis for ransomware detection on the bitcoin blockchain. arXiv preprint arXiv:1906.07852. 2019 Jun 19.
  14. Taheri R, Shojafar M, Alazab M, Tafazolli R. FED-IIoT: A robust federated malware detection architecture in industrial IoT. IEEE transactions on industrial informatics. 2020 Dec 9;17(12):8442-52.
  15. Yan J, Qi Y, Rao Q. Detecting malware with an ensemble method based on deep neural network. Security and Communication Networks. 2018;2018(1):7247095.
Regular Issue Subscription Review Article
Volume 02
Issue 02
Received 18/09/2024
Accepted 12/10/2024
Published 07/11/2024
219

function myFunction2() {
var x = document.getElementById(“browsefigure”);
if (x.style.display === “block”) {
x.style.display = “none”;
}
else { x.style.display = “Block”; }
}
document.querySelector(“.prevBtn”).addEventListener(“click”, () => {
changeSlides(-1);
});
document.querySelector(“.nextBtn”).addEventListener(“click”, () => {
changeSlides(1);
});
var slideIndex = 1;
showSlides(slideIndex);
function changeSlides(n) {
showSlides((slideIndex += n));
}
function currentSlide(n) {
showSlides((slideIndex = n));
}
function showSlides(n) {
var i;
var slides = document.getElementsByClassName(“Slide”);
var dots = document.getElementsByClassName(“Navdot”);
if (n > slides.length) { slideIndex = 1; }
if (n (item.style.display = “none”));
Array.from(dots).forEach(
item => (item.className = item.className.replace(” selected”, “”))
);
slides[slideIndex – 1].style.display = “block”;
dots[slideIndex – 1].className += ” selected”;
}