Rahmat Budiarto
Department Of Computer Science, Albaha University

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 6 Documents
Search

Selecting Root Exploit Features Using Flying Animal-Inspired Decision Ahmad Firdaus; Mohd Faizal Ab Razak; Wan Isni Sofiah Wan Din; Danakorn Nincarean; Shahreen Kasim; Tole Sutikno; Rahmat Budiarto
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 7, No 4: December 2019
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (465.202 KB) | DOI: 10.52549/ijeei.v7i4.1146

Abstract

Malware is an application that executes malicious activities to a computer system, including mobile devices. Root exploit brings more damages among all types of malware because it is able to run in stealthy mode. It compromises the nucleus of the operating system known as kernel to bypass the Android security mechanisms. Once it attacks and resides in the kernel, it is able to install other possible types of malware to the Android devices. In order to detect root exploit, it is important to investigate its features to assist machine learning to predict it accurately. This study proposes flying animal-inspired (1) bat, 2) firefly, and 3) bee) methods to search automatically the exclusive features, then utilizes these flying animal-inspired decision features to improve the machine learning prediction. Furthermore, a boosting method (Adaboost) boosts the multilayer perceptron (MLP) potential to a stronger classification. The evaluation jotted the best result is from bee search, which recorded 91.48 percent in accuracy, 82.2 percent in true positive rate, and 0.1 percent false positive rate.
Enhanced Deep Learning Intrusion Detection in IoT Heterogeneous Network with Feature Extraction Sharipuddin Sharipuddin; Eko Arip Winanto; Benni Purnama; Kurniabudi Kurniabudi; Deris Stiawan; Darmawijoyo Hanapi; Mohd Yazid bin Idris; Bedine Kerim; Rahmat Budiarto
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 9, No 3: September 2021
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/.v9i3.3134

Abstract

Heterogeneous network is one of the challenges that must be overcome in Internet of Thing Intrusion Detection System (IoT IDS). The difficulty of the IDS significantly is caused by various devices, protocols, and services, that make the network becomes complex and difficult to monitor. Deep learning is one algorithm for classifying data with high accuracy. This research work incorporated Deep Learning into IDS for IoT heterogeneous networks. There are two concerns on IDS with deep learning in heterogeneous IoT networks, i.e.: limited resources and excessive training time. Thus, this paper uses Principle Component Analysis (PCA) as features extraction method to deal with data dimensions so that resource usage and training time will be significantly reduced. The results of the evaluation show that PCA was successful reducing resource usage with less training time of the proposed IDS with deep learning in heterogeneous networks environment. Experiment results show the proposed IDS achieve overall accuracy above 99%.
Time Efficiency on Computational Performance of PCA, FA and TSVD on Ransomware Detection Benni Purnama; Deris Stiawan; Darmawijoyo Hanapi; Mohd. Yazid Idris; Sharipuddin Sharipuddin; Nurul Afifah; Rahmat Budiarto
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 10, No 1: March 2022
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v10i1.3481

Abstract

Ransomware is able to attack and take over access of the targeted user'scomputer. Then the hackers demand a ransom to restore the user's accessrights. Ransomware detection process especially in big data has problems interm of computational processing time or detection speed. Thus, it requires adimensionality reduction method for computational process efficiency. Thisresearch work investigates the efficiency of three dimensionality reductionmethods, i.e.: Principal Component Analysis (PCA), Factor Analysis (FA) andTruncated Singular Value Decomposition (TSVD). Experimental results onCICAndMal2017 dataset show that PCA is the fastest and most significantmethod in the computational process with average detection time of 34.33s.Furthermore, result of accuracy, precision and recall also show that the PCAis superior compared to FA and TSVD.
An Incentive Mechanism for Cooperative Data Replication in MANETs - A Game Theoretical Approach Alireza Tajalli; Seyed-Amin Hosseini-Seno; Mohamed Shenify; Rahmat Budiarto
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 1: EECSI 2014
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1129.059 KB) | DOI: 10.11591/eecsi.v1.356

Abstract

Wireless ad hoc networks have seen a great deal of attention in the past years, especially in cases where no infrastructure is available. The main goal in these networks is to provide good data accessibility for participants. Because of the wireless nodes’ continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication costs in terms of nodes’ storage space and energy. Hence, autonomous nodes may behave selfishly in this cooperative process and do not replicate data. This kind of phenomenon is referred to as a strategic situation and is best modeled and analyzed using the game theory concept. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes’ best interest to cooperate fully in the replication process if our mechanism is used.
MPKMS: A Matrix-based Pairwise Key Management Scheme for Wireless Sensor Networks Fatemeh Banaie; Seyed Amin Hosseini Seno; Reem Hajaj Aljoufi; Rahmat Budiarto
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 1: EECSI 2014
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1224.28 KB) | DOI: 10.11591/eecsi.v1.382

Abstract

Due to the sensitivity of the Wireless Sensor Networks (WSN) applications and resource constraints, authentication and key management emerge as a challenging issue for WSN. In general, various approaches have been developed for the key management in WSN. This paper has come up with a new robust key pre-distribution scheme using random polynomial functions and matrix. This new proposed scheme significantly increases the storage efficiency and provides resilience to network against node capture by using random prime numbers, polynomial functions and matrix properties. The effectiveness of the scheme is demonstrated through a security analysis and comparison with the existing schemes.
Dynamic Prioritization of Path for Quality-of-Service Differentiation in Multi-Priority Traffic Fatemeh Banaie; Seyed Amin Hosseini-Seno; Mohammad Hossein Yaghmaee; Rahmat Budiarto
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 1: EECSI 2014
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (961.813 KB) | DOI: 10.11591/eecsi.v1.385

Abstract

The emergence of value added services relying on a higher interactivity has altered the requirements of current transport network. Diverse traffic classes are processed by a large-scale optical network, imposing a more efficient utilization of their network infrastructure resources. Such services generally cross multiple domains, but inter-domain path computation algorithms still have some limitations. This paper describes a priority based path computation algorithm to meet all QoS requirements with the available capacity. The proposed algorithm increases the rate of successful replies while minimizing the blockage in network. The dynamic traffic is classified into high and low priority, so it improves emergency response in network.