International Journal of Computer Network and Information Security最新文献

{"title":"Deep Learning-based Resource Prediction and Mutated Leader Algorithm Enabled Load Balancing in Fog Computing","authors":"S. G, Monica R. Mundada, S. Supreeth, Bryan Gardiner","doi":"10.5815/ijcnis.2023.04.08","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.04.08","url":null,"abstract":"Load balancing plays a major part in improving the performance of fog computing, which has become a requirement in fog layer for distributing all workload in equal manner amongst the current Virtual machines (VMs) in a segment. The distribution of load is a complicated process as it consists of numerous users in fog computing environment. Hence, an effectual technique called Mutated Leader Algorithm (MLA) is proposed for balancing load in fogging environment. Firstly, fog computing is initialized with fog layer, cloud layer and end user layer. Then, task is submitted from end user under fog layer with cluster of nodes. Afterwards, load balancing process is done in each cluster and the resources for each VM are predicted using Deep Residual Network (DRN). The load balancing is accomplished by allocating and reallocating the task from the users to the VMs in the cloud based on the resource constraints optimally using MLA. Here, the load balancing is needed for optimizing resources and objectives. Lastly, if VMs are overloaded and then the jobs are pulled from associated VM and allocated to under loaded VM. Thus the proposed MLA achieved minimum execution time is 1.472ns, cost is $69.448 and load is 0.0003% respectively.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49019089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Distributed Denial of Service Attack Detection Using Hyper Calls Analysis in Cloud","authors":"K. Umamaheswari, N. Subramanian, M. Subramaniyan","doi":"10.5815/ijcnis.2023.04.06","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.04.06","url":null,"abstract":"In the scenario of Distributed Denial of Service (DDoS) attacks are increasing in a significant manner, the attacks should be mitigated in the beginning itself to avoid its devastating consequences for any kind of business. DDoS attack can slow down or completely block online services of business like websites, email or anything that faces internet. The attacks are frequently originating from cloud virtual machines for anonymity and wide network bandwidth. Hyper-Calls Analysis(HCA) enables the tracing of command flow to detect any clues for the occurrence of malicious activity in the system. A DDoS attack detection approach proposed in this paper works in the hypervisor side to perform hyper calls based introspection with machine learning algorithms. The system evaluates system calls in hypervisor for the classification of malicious activities through Support Vector Machine and Stochastic Gradient Descent (SVM & SGD) Algorithms. The attack environment created using XOIC attacker tool and CPU death ping libraries. The system’s performance also evaluated on CICDDOS 2019 dataset. The experimental results reveal that more than 99.6% of accuracy in DDoS detection without degrading performance.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41893045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reinforcement Learning Based Efficient Power Control and Spectrum Utilization for D2D Communication in 5G Network","authors":"Chellarao Chowdary Mallipudi, S. Chandra, Prateek Prakash, Rajeev Arya, Akhtar Husain, S. Qamar","doi":"10.5815/ijcnis.2023.04.02","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.04.02","url":null,"abstract":"There are billions of inter-connected devices by the help of Internet-of-Things (IoT) that have been used in a number of applications such as for wearable devices, e-healthcare, agriculture, transportation, etc. Interconnection of devices establishes a direct link and easily shares the information by utilizing the spectrum of cellular users to enhance the spectral efficiency with low power consumption in an underlaid Device-to-Device (D2D) communication. Due to reuse of the spectrum of cellular devices by D2D users causes severe interference between them which may impact on the network performance. Therefore, we proposed a Q-Learning based low power selection scheme with the help of multi-agent reinforcement learning to detract the interference that helps to increase the capacity of the D2D network. For the maximization of capacity, the updated reward function has been reformulated with the help of a stochastic policy environment. With the help of a stochastic approach, we figure out the proposed optimal low power consumption techniques which ensures the quality of service (QoS) standards of the cellular devices and D2D users for D2D communication in 5G Networks and increase the utilization of resources. Numerical results confirm that the proposed scheme improves the spectral efficiency and sum rate as compared to Q-Learning approach by 14% and 12.65%.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48752156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Detecting Remote Access Network Attacks Using Supervised Machine Learning Methods","authors":"Samuel Ndichu, Sylvester Mcoyowo, H. Okoyo, Cyrus Wekesa","doi":"10.5815/ijcnis.2023.02.04","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.04","url":null,"abstract":"Remote access technologies encrypt data to enforce policies and ensure protection. Attackers leverage such techniques to launch carefully crafted evasion attacks introducing malware and other unwanted traffic to the internal network. Traditional security controls such as anti-virus software, firewall, and intrusion detection systems (IDS) decrypt network traffic and employ signature and heuristic-based approaches for malware inspection. In the past, machine learning (ML) approaches have been proposed for specific malware detection and traffic type characterization. However, decryption introduces computational overheads and dilutes the privacy goal of encryption. The ML approaches employ limited features and are not objectively developed for remote access security. This paper presents a novel ML-based approach to encrypted remote access attack detection using a weighted random forest (W-RF) algorithm. Key features are determined using feature importance scores. Class weighing is used to address the imbalanced data distribution problem common in remote access network traffic where attacks comprise only a small proportion of network traffic. Results obtained during the evaluation of the approach on benign virtual private network (VPN) and attack network traffic datasets that comprise verified normal hosts and common attacks in real-world network traffic are presented. With recall and precision of 100%, the approach demonstrates effective performance. The results for k-fold cross-validation and receiver operating characteristic (ROC) mean area under the curve (AUC) demonstrate that the approach effectively detects attacks in encrypted remote access network traffic, successfully averting attackers and network intrusions.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45812104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluation of GAN-based Models for Phishing URL Classifiers","authors":"Thi Thanh Thuy Pham, T. Pham, Viet-Cuong Ta","doi":"10.5815/ijcnis.2023.02.01","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.01","url":null,"abstract":"Phishing attacks by malicious URL/web links are common nowadays. The user data, such as login credentials and credit card numbers can be stolen by their careless clicking on these links. Moreover, this can lead to installation of malware on the target systems to freeze their activities, perform ransomware attack or reveal sensitive information. Recently, GAN-based models have been attractive for anti-phishing URLs. The general motivation is using Generator network (G) to generate fake URL strings and Discriminator network (D) to distinguish the real and the fake URL samples. This is operated in adversarial way between G and D so that the synthesized URL samples by G become more and more similar to the real ones. From the perspective of cybersecurity defense, GAN-based motivation can be exploited for D as a phishing URL detector or classifier. This means after training GAN on both malign and benign URL strings, a strong classifier/detector D can be achieved. From the perspective of cyberattack, the attackers would like to to create fake URLs that are as close to the real ones as possible to perform phishing attacks. This makes them easier to fool users and detectors. In the related proposals, GAN-based models are mainly exploited for anti-phishing URLs. There have been no evaluations specific for GAN-generated fake URLs. The attacker can make use of these URL strings for phishing attacks. In this work, we propose to use TLD (Top-level Domain) and SSIM (Structural Similarity Index Score) scores for evaluation the GAN-synthesized URL strings in terms of the structural similariy with the real ones. The more similar in the structure of the GAN-generated URLs are to the real ones, the more likely they are to fool the classifiers. Different GAN models from basic GAN to others GAN extensions of DCGAN, WGAN, SEQGAN are explored in this work. We show from the intensive experiments that D classifier of basic GAN and DCGAN surpasses other GAN models of WGAN and SegGAN. The effectiveness of the fake URL patterns generated from SeqGAN is the best compared to other GAN models in both structural similarity and the ability in deceiving the phishing URL classifiers of LSTM (Long Short Term Memory) and RF (Random Forest).","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48958881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Patch Based Sclera and Periocular Biometrics Using Deep Learning","authors":"V. Sandhya, N. Hegde","doi":"10.5815/ijcnis.2023.02.02","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.02","url":null,"abstract":"Biometric authentication has become an essential security aspect in today's digitized world. As limitations of the Unimodal biometric system increased, the need for multimodal biometric has become more popular. More research has been done on multimodal biometric systems for the past decade. sclera and periocular biometrics have gained more attention. The segmentation of sclera is a complex task as there is a chance of losing some of the features of sclera vessel patterns. In this paper we proposed a patch-based sclera and periocular segmentation. Experiments was conducted on sclera patches, periocular patches and sclera-periocular patches. These sclera and periocular patches are trained using deep learning neural networks. The deep learning network CNN is applied individually for sclera and periocular patches, on a combination of three Data set. The data set has images with occlusions and spectacles. The accuracy of the proposed sclera-periocular patches is 97.3%. The performance of the proposed patch-based system is better than the traditional segmentation methods.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41794488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Two-Layer Security of Images Using Elliptic Curve Cryptography with Discrete Wavelet Transform","authors":"G. M, P. S.","doi":"10.5815/ijcnis.2023.02.03","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.03","url":null,"abstract":"Information security is an important part of the current interactive world. It is very much essential for the end-user to preserve the confidentiality and integrity of their sensitive data. As such, information encoding is significant to defend against access from the non-authorized user. This paper is presented with an aim to build a system with a fusion of Cryptography and Steganography methods for scrambling the input image and embed into a carrier media by enhancing the security level. Elliptic Curve Cryptography (ECC) is helpful in achieving high security with a smaller key size. In this paper, ECC with modification is used to encrypt and decrypt the input image. Carrier media is transformed into frequency bands by utilizing Discrete Wavelet Transform (DWT). The encrypted hash of the input is hidden in high-frequency bands of carrier media by the process of Least-Significant-Bit (LSB). This approach is successful to achieve data confidentiality along with data integrity. Data integrity is verified by using SHA-256. Simulation outcomes of this method have been analyzed by measuring performance metrics. This method enhances the security of images obtained with 82.7528db of PSNR, 0.0012 of MSE, and SSIM as 1 compared to other existing scrambling methods.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47729670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Predicting Intrusion in a Network Traffic Using Variance of Neighboring Object’s Distance","authors":"K. G. Sharma, Yashpal Singh","doi":"10.5815/ijcnis.2023.02.06","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.06","url":null,"abstract":"Activities in network traffic can be broadly classified into two categories: normal and malicious. Malicious activities are harmful and their detection is necessary for security reasons. The intrusion detection process monitors network traffic to identify malicious activities in the system. Any algorithm that divides objects into two categories, such as good or bad, is a binary class predictor or binary classifier. In this paper, we utilized the Nearest Neighbor Distance Variance (NNDV) classifier for the prediction of intrusion. NNDV is a binary class predictor and uses the concept of variance on the distance between objects. We used KDD CUP 99 dataset to evaluate the NNDV and compared the predictive accuracy of NNDV with that of the KNN or K Nearest Neighbor classifier. KNN is an efficient general purpose classifier, but we only considered its binary aspect. The results are quite satisfactory to show that NNDV is comparable to KNN. Many times, the performance of NNDV is better than KNN. We experimented with normalized and unnormalized data for NNDV and found that the accuracy results are generally better for normalized data. We also compared the accuracy results of different cross validation techniques such as 2 fold, 5 fold, 10 fold, and leave one out on the NNDV for the KDD CUP 99 dataset. Cross validation results can be helpful in determining the parameters of the algorithm.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49157715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"LCDT-M: Log-Cluster DDoS Tree Mitigation Framework Using SDN in the Cloud Environment","authors":"Jeba Praba. J., R. Sridaran","doi":"10.5815/ijcnis.2023.02.05","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.05","url":null,"abstract":"In the cloud computing platform, DDoS (Distributed Denial-of-service) attacks are one of the most commonly occurring attacks. Research studies on DDoS mitigation rarely considered the data shift problem in real-time implementation. Concurrently, existing studies have attempted to perform DDoS attack detection. Nevertheless, they have been deficient regarding the detection rate. Hence, the proposed study proposes a novel DDoS mitigation scheme using LCDT-M (Log-Cluster DDoS Tree Mitigation) framework for the hybrid cloud environment. LCDT-M detects and mitigates DDoS attacks in the Software-Defined Network (SDN) based cloud environment. The LCDT-M comprises three algorithms: GFS (Greedy Feature Selection), TLMC (Two Log Mean Clustering), and DM (Detection-Mitigation) based on DT (Decision Tree) to optimize the detection of DDoS attacks along with mitigation in SDN. The study simulated the defined cloud environment and considered the data shift problem during the real-time implementation. As a result, the proposed architecture achieved an accuracy of about 99.83%, confirming its superior performance.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41709556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient Load Balancing in WSN Using Quasi – oppositional Based Jaya Optimization with Cluster Head Selection","authors":"M. S. Muthukkumar, S. Diwakaran","doi":"10.5815/ijcnis.2023.02.07","DOIUrl":"https://doi.org/10.5815/ijcnis.2023.02.07","url":null,"abstract":"Researchers have been paying close attention to the wireless sensor (WSN) networks area because of its variety of applications, including industrial management, human detection, and health care management. In Wireless Sensor (WSN) Network, consumption of efficient energy is a challenging problem. Many clustering techniques were used for balancing the load of WSN network. In clustering, the cluster head (CH) is selected as a relay node with greater power which is compared with the nodes of non-CH. In the existing system, it uses LBC-COFL algorithm to reduce the energy consumption problem. To overcome this problem, the proposed system uses Quasi oppositional based Jaya load balancing strategy with cluster head (QOJ-LCH) selection protocol to boost the lifespan of network and energy consumption. The QOJ-LCH method improves the relay nodes life and shares the load on relay nodes equitably across the network to enhance the lifespan. It also reduces the load-balancing problems in Wireless Sensor networks. It uses two routing methods single-hop and multiple-hop. The proposed QOJ-LCH with cluster head selection method enhances the network’s lifespan, total amount of power utilization and the active sensor devices present in the Single-hop routing,it worked with 1600 rounds in network and 300 sensor nodes, for Multiple-hop routing, it worked with 1800 rounds in network and 350 sensor nodes. It achieves better performance, scalability and reliability.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42125889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}