Lunodzo Justine Mwinuka

Mr. Lunodzo Justine Mwinuka

Mzumbe University
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 November 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
AAAbel Agghey
Abel Agghey
LMLunodzo Justine Mwinuka
Lunodzo Justine Mwinuka
SPSanket Mohan Pandhare
Sanket Mohan Pandhare
MDMussa Ally Dida
Mussa Ally Dida
Jema D. NdibwileJema D. Ndibwile
Jema D. Ndibwile
Over the last two decades (2000–2020), the Internet has rapidly evolved, resulting in symmetrical and asymmetrical Internet consumption patterns and billions of users worldwide. With the immense rise of the Internet, attacks and malicious behaviors pose a huge threat to our computing environment. Brute-force attack is among the most prominent and commonly used attacks, achieved out using password-attack tools, a wordlist dictionary, and a usernames list—obtained through a so-called an enumeration attack. In this paper, we investigate username enumeration attack detection on SSH protocol by using machine-learning classifiers. We apply four asymmetrical classifiers on our generated dataset collected from a closed-environment network to build machine-learning-based models for attack detection. The use of several machine-learners offers a wider investigation spectrum of the classifiers’ ability in attack detection. Additionally, we investigate how beneficial it is to include or exclude network ports information as features-set in the process of learning. We evaluated and compared the performances of machine-learning models for both cases. The models used are k-nearest neighbor (K-NN), naïve Bayes (NB), random forest (RF) and decision tree (DT) with and without ports information. Our results show that machine-learning approaches to detect SSH username enumeration attacks were quite successful, with KNN having an accuracy of 99.93%, NB 95.70%, RF 99.92%, and DT 99.88%. Furthermore, the results improve when using ports information.

27 January 2022 in IEEE Access
Verified
Journal Article
Open access
LMLunodzo Justine Mwinuka
Lunodzo Justine Mwinuka
AAAbel Agghey
Abel Agghey
Shubi Felix KaijageShubi Felix Kaijage
Shubi Felix Kaijage
Jema D. NdibwileJema D. Ndibwile
Jema D. Ndibwile
Network spoofing is becoming a common attack in wireless networks. The trend is going high due to an increase in Internet users. Similarly, there is a rapid growth of numbers in mobile devices in the working environments and on most official occasions. The trends pose a huge threat to users since they become the prime target of attackers. More unfortunately, mobile devices have weak security measures due to their limited computational powers. Current approaches to detect spoofing attacks focus on personal computers and rely on the network hosts’ capacity, leaving guest users with mobile devices at risk. Some approaches on Android-based devices demand root privilege, which is highly discouraged. This paper presents an Android-based client-side solution to detect the presence of fake access points in a perimeter using details collected from probe responses. Our approach considers the difference in security information and signal level of an access point (AP). We present the detection in three networks, (i) open networks, (ii) closed networks and (iii) networks with captive portals. As a departure from existing works, our solution does not require root access for detection, and it is developed for portability and better performance. Experimental results show that our approach can detect fake access points with an accuracy of 99% and 99.7% at an average of 24.64 and 7.78 milliseconds in open and closed networks, respectively.

26 December 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
LMLunodzo Justine Mwinuka
Lunodzo Justine Mwinuka
Massimo CafaroMassimo Cafaro
Massimo Cafaro
Lucas PereiraLucas Pereira
Lucas Pereira
Hugo MoraisHugo Morais
Hugo Morais
This paper presents the design of G-IDSS (Graph-based InnoCyPES Data Storage Service): a novel, distributed data storage service that is built around a P2P network overlay to support handling distributed data. G-IDSS is accessible through a standard command-line interface and is based on a graph database to support the schema-less management of the distributed data stored among peers. The mechanisms to facilitate the execution of complex queries requiring distributed data integration and fusion are also presented and discussed. Besides the design, this work also provides relevant details related to the implementation of G-IDSS, reflecting several use cases that demand data that are distributed across different, even geographically spread, locations. G-IDSS scales to thousands of peers in an overlay, it is able to run distributed queries and can integrate data that are stored in different sources.

19 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
Massimo CafaroMassimo Cafaro
Massimo Cafaro
Italo  EpicocoItalo Epicoco
Italo Epicoco
Marco PulimenoMarco Pulimeno
Marco Pulimeno
LMLunodzo Justine Mwinuka
Lunodzo Justine Mwinuka
Lucas PereiraLucas Pereira
Lucas Pereira
Hugo MoraisHugo Morais
Hugo Morais
The rate at which data is generated has been increasing rapidly, raising challenges related to its management. Traditional database management systems suffer from scalability and are usually inefficient when dealing with large-scale and heterogeneous data. This paper introduces IDSS (InnoCyPES Data Storage Service), a novel large-scale data storage tool that leverages peer-to-peer networks and embedded relational databases. We present the IDSS architecture and its design, and provide details related to the implementation. The peer-to-peer framework is used to provide support for distributed queries leveraging a relational database architecture based on a common schema. Furthermore, methods to support complex distributed query processing, enabling robust and efficient management of vast amounts of data are presented.