• Title/Summary/Keyword: Security Measure

Search Result 578, Processing Time 0.021 seconds

Simulator Design and Performance Analysis of BADA Distributed Consensus Algorithm (BADA 분산합의 알고리즘 시뮬레이터 설계 및 성능 분석)

  • Kim, Young Chang;Kim, Kiyoung;Oh, Jintae;Kim, Do Gyun;Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.168-177
    • /
    • 2020
  • In recent years, importance of blockchain systems has been grown after success of bitcoin. Distributed consensus algorithm is used to achieve an agreement, which means the same information is recorded in all nodes participating in blockchain network. Various algorithms were suggested to resolve blockchain trilemma, which refers conflict between decentralization, scalability, security. An algorithm based on Byzantine Agreement among Decentralized Agents (BADA) were designed for the same manner, and it used limited committee that enables an efficient consensus among considerable number of nodes. In addition, election of committee based on Proof-of-Nonce guarantees decentralization and security. In spite of such prominence, application of BADA in actual blockchain system requires further researches about performance and essential features affecting on the performance. However, performance assessment committed in real systems takes a long time and costs a great deal of budget. Based on this motivation, we designed and implemented a simulator for measuring performance of BADA. Specifically, we defined a simulation framework including three components named simulator Command Line Interface, transaction generator, BADA nodes. Furthermore, we carried out response surface analysis for revealing latent relationship between performance measure and design parameters. By using obtained response surface models, we could find an optimal configuration of design parameters for achieving a given desirable performance level.

Accuracy of Phishing Websites Detection Algorithms by Using Three Ranking Techniques

  • Mohammed, Badiea Abdulkarem;Al-Mekhlafi, Zeyad Ghaleb
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.272-282
    • /
    • 2022
  • Between 2014 and 2019, the US lost more than 2.1 billion USD to phishing attacks, according to the FBI's Internet Crime Complaint Center, and COVID-19 scam complaints totaled more than 1,200. Phishing attacks reflect these awful effects. Phishing websites (PWs) detection appear in the literature. Previous methods included maintaining a centralized blacklist that is manually updated, but newly created pseudonyms cannot be detected. Several recent studies utilized supervised machine learning (SML) algorithms and schemes to manipulate the PWs detection problem. URL extraction-based algorithms and schemes. These studies demonstrate that some classification algorithms are more effective on different data sets. However, for the phishing site detection problem, no widely known classifier has been developed. This study is aimed at identifying the features and schemes of SML that work best in the face of PWs across all publicly available phishing data sets. The Scikit Learn library has eight widely used classification algorithms configured for assessment on the public phishing datasets. Eight was tested. Later, classification algorithms were used to measure accuracy on three different datasets for statistically significant differences, along with the Welch t-test. Assemblies and neural networks outclass classical algorithms in this study. On three publicly accessible phishing datasets, eight traditional SML algorithms were evaluated, and the results were calculated in terms of classification accuracy and classifier ranking as shown in tables 4 and 8. Eventually, on severely unbalanced datasets, classifiers that obtained higher than 99.0 percent classification accuracy. Finally, the results show that this could also be adapted and outperforms conventional techniques with good precision.

Prediction of Student's Interest on Sports for Classification using Bi-Directional Long Short Term Memory Model

  • Ahamed, A. Basheer;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.246-256
    • /
    • 2022
  • Recently, parents and teachers consider physical education as a minor subject for students in elementary and secondary schools. Physical education performance has become increasingly significant as parents and schools pay more attention to physical schooling. The sports mining with distribution analysis model considers different factors, including the games, comments, conversations, and connection made on numerous sports interests. Using different machine learning/deep learning approach, children's athletic and academic interests can be tracked over the course of their academic lives. There have been a number of studies that have focused on predicting the success of students in higher education. Sports interest prediction research at the secondary level is uncommon, but the secondary level is often used as a benchmark to describe students' educational development at higher levels. An Automated Student Interest Prediction on Sports Mining using DL Based Bi-directional Long Short-Term Memory model (BiLSTM) is presented in this article. Pre-processing of data, interest classification, and parameter tweaking are all the essential operations of the proposed model. Initially, data augmentation is used to expand the dataset's size. Secondly, a BiLSTM model is used to predict and classify user interests. Adagrad optimizer is employed for hyperparameter optimization. In order to test the model's performance, a dataset is used and the results are analysed using precision, recall, accuracy and F-measure. The proposed model achieved 95% accuracy on 400th instances, where the existing techniques achieved 93.20% accuracy for the same. The proposed model achieved 95% of accuracy and precision for 60%-40% data, where the existing models achieved 93% for accuracy and precision.

A Detecting Technique for the Climatic Factors that Aided the Spread of COVID-19 using Deep and Machine Learning Algorithms

  • Al-Sharari, Waad;Mahmood, Mahmood A.;Abd El-Aziz, A.A.;Azim, Nesrine A.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.131-138
    • /
    • 2022
  • Novel Coronavirus (COVID-19) is viewed as one of the main general wellbeing theaters on the worldwide level all over the planet. Because of the abrupt idea of the flare-up and the irresistible force of the infection, it causes individuals tension, melancholy, and other pressure responses. The avoidance and control of the novel Covid pneumonia have moved into an imperative stage. It is fundamental to early foresee and figure of infection episode during this troublesome opportunity to control of its grimness and mortality. The entire world is investing unimaginable amounts of energy to fight against the spread of this lethal infection. In this paper, we utilized machine learning and deep learning techniques for analyzing what is going on utilizing countries shared information and for detecting the climate factors that effect on spreading Covid-19, such as humidity, sunny hours, temperature and wind speed for understanding its regular dramatic way of behaving alongside the forecast of future reachability of the COVID-2019 around the world. We utilized data collected and produced by Kaggle and the Johns Hopkins Center for Systems Science. The dataset has 25 attributes and 9566 objects. Our Experiment consists of two phases. In phase one, we preprocessed dataset for DL model and features were decreased to four features humidity, sunny hours, temperature and wind speed by utilized the Pearson Correlation Coefficient technique (correlation attributes feature selection). In phase two, we utilized the traditional famous six machine learning techniques for numerical datasets, and Dense Net deep learning model to predict and detect the climatic factor that aide to disease outbreak. We validated the model by using confusion matrix (CM) and measured the performance by four different metrics: accuracy, f-measure, recall, and precision.

SITM Attacks on Skinny-128-384 and Romulus-N (Skinny-128-384와 Romulus-N의 SITM 공격)

  • Park, Jonghyun;Kim, Jongsung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.5
    • /
    • pp.807-816
    • /
    • 2022
  • See-In-The-Middle (SITM) is an analysis technique that uses Side-Channel information for differential cryptanalysis. This attack collects unmasked middle-round power traces when implementing block ciphers to select plaintext pairs that satisfy the attacker's differential pattern and utilize them for differential cryptanalysis to recover the key. Romulus, one of the final candidates for the NIST Lightweight Cryptography standardization competition, is based on Tweakable block cipher Skinny-128-384+. In this paper, the SITM attack is applied to Skinny-128-384 implemented with 14-round partial masking. This attack not only increased depth by one round, but also significantly reduced the time/data complexity to 214.93/214.93. Depth refers to the round position of the block cipher that collects the power trace, and it is possible to measure the appropriate number of masking rounds required when applying the masking technique to counter this attack. Furthermore, we extend the attack to Romulus's Nonce-based AE mode Romulus-N, and Tweakey's structural features show that it can attack with less complexity than Skinny-128-384.

Experimental and Numerical Study on the Dynamic Fracture Processes of PMMA Block by NRC Vapor Pressure Fracture Agent (NRC 증기압 암석 파쇄제에 의한 PMMA 블록의 동적 파괴 과정에 관한 실험 및 수치해석적 연구)

  • Gyeongjo Min
    • Journal of Korean Society of Disaster and Security
    • /
    • v.16 no.1
    • /
    • pp.91-103
    • /
    • 2023
  • This study aims to investigate the dynamic fracture characteristics of rocks and rock-like materials subjected to the Nonex Rock Cracker (NRC), a vapor pressure crushing agent that produces vapor pressure by instantaneously vaporizing a liquid mixture crystallized through the thermite reaction. Furthermore, the study seeks to develop an analytical technique for predicting the fracture pattern. A dynamic fracture test was performed on a PMMA block, an artificial brittle material, using the NRC. High-speed cameras and dynamic pressure gauges were employed to capture the moment of vapor pressure generation and measure the vapor pressure-time history, respectively. The 2-dimensional Dynamic Fracture Process Analysis (2D DFPA) was used to simulate the fracture process caused by the vapor pressure, with the applied pressure determined based on the vapor pressure-time history. The proposed analytical method was used to examine various fracture patterns with respect to granite material and high-performance explosives.

An Encryption Algorithm Based on Light-Weight SEED for Accessing Multiple Objects in RFID System (RFID 시스템에서 다중 객체를 지원하기 위한 경량화된 SEED 기반의 암호화 알고리즘)

  • Kim, Ji-Yeon;Jung, Jong-Jin
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.41-49
    • /
    • 2010
  • Recently, RFID systems are spreading in various industrial areas faster but cause some serious problems of information security because of its unstable wireless communication. Moreover, traditional RFID systems have a restriction that one tag per each application object. This restriction deteriorates their usability because it is difficult to distinguish many tags without some kind of effort. Therefore, efficient information sharing of objects based on information security has to be studied for more spreading of RFID technologies. In this paper, we design a new RFID tag structure for supporting multiple objects which can be shared by many different RFID applications. We also design an encryption/decryption algorithm to protect the identifying information of objects stored in our tag structure. This algorithm is a light revision of the existing SEED algorithm which can be operated in RFID tag environment. To evaluate the performance of our algorithm, we measure the encryption and decryption times of this algorithm and compare the results with those of the original SEED algorithm.

Comparative Study of PSO-ANN in Estimating Traffic Accident Severity

  • Md. Ashikuzzaman;Wasim Akram;Md. Mydul Islam Anik;Taskeed Jabid;Mahamudul Hasan;Md. Sawkat Ali
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.95-100
    • /
    • 2023
  • Due to Traffic accidents people faces health and economical casualties around the world. As the population increases vehicles on road increase which leads to congestion in cities. Congestion can lead to increasing accident risks due to the expansion in transportation systems. Modern cities are adopting various technologies to minimize traffic accidents by predicting mathematically. Traffic accidents cause economical casualties and potential death. Therefore, to ensure people's safety, the concept of the smart city makes sense. In a smart city, traffic accident factors like road condition, light condition, weather condition etcetera are important to consider to predict traffic accident severity. Several machine learning models can significantly be employed to determine and predict traffic accident severity. This research paper illustrated the performance of a hybridized neural network and compared it with other machine learning models in order to measure the accuracy of predicting traffic accident severity. Dataset of city Leeds, UK is being used to train and test the model. Then the results are being compared with each other. Particle Swarm optimization with artificial neural network (PSO-ANN) gave promising results compared to other machine learning models like Random Forest, Naïve Bayes, Nearest Centroid, K Nearest Neighbor Classification. PSO- ANN model can be adopted in the transportation system to counter traffic accident issues. The nearest centroid model gave the lowest accuracy score whereas PSO-ANN gave the highest accuracy score. All the test results and findings obtained in our study can provide valuable information on reducing traffic accidents.

Performance Comparison of Autoencoder based OFDM Communication System with Wi-Fi

  • Shiho Oshiro;Takao Toma;Tomohisa Wada
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.5
    • /
    • pp.172-178
    • /
    • 2023
  • In this paper, performance of autoencoder based OFDM communication systems is compared with IEEE 802.11a Wireless Lan System (Wi-Fi). The proposed autoencoder based OFDM system is composed of the following steps. First, one sub-carrier's transmitter - channel - receiver system is created by autoencoder. Then learning process of the one sub-carrier autoencoder generates constellation map. Secondly, using the plural sub-carrier autoencoder systems, parallel bundle is configured with inserting IFFT and FFT before and after the channel to configure OFDM system. Finally, the receiver part of the OFDM communication system was updated by re-learning process for adapting channel condition such as multipath channel. For performance comparison, IEEE802.11a and the proposed autoencoder based OFDM system are compared. For channel estimation, Wi-Fi uses initial long preamble to measure channel condition. but Autoencoder needs re-learning process to create an equalizer which compensate a distortion caused by the transmission channel. Therefore, this autoencoder based system has basic advantage to the Wi-Fi system. For the comparison of the system, additive random noise and 2-wave and 4-wave multipaths are assumed in the transmission path with no inter-symbol interference. A simulation was performed to compare the conventional type and the autoencoder. As a result of the simulation, the autoencoder properly generated automatic constellations with QPSK, 16QAM, and 64QAM. In the previous simulation, the received data was relearned, thus the performance was poor, but the performance improved by making the initial value of reception a random number. A function equivalent to an equalizer for multipath channels has been realized in OFDM systems. As a future task, there is not include error correction at this time, we plan to make further improvements by incorporating error correction in the future.

Design of Face with Mask Detection System in Thermal Images Using Deep Learning (딥러닝을 이용한 열영상 기반 마스크 검출 시스템 설계)

  • Yong Joong Kim;Byung Sang Choi;Ki Seop Lee;Kyung Kwon Jung
    • Convergence Security Journal
    • /
    • v.22 no.2
    • /
    • pp.21-26
    • /
    • 2022
  • Wearing face masks is an effective measure to prevent COVID-19 infection. Infrared thermal image based temperature measurement and identity recognition system has been widely used in many large enterprises and universities in China, so it is totally necessary to research the face mask detection of thermal infrared imaging. Recently introduced MTCNN (Multi-task Cascaded Convolutional Networks)presents a conceptually simple, flexible, general framework for instance segmentation of objects. In this paper, we propose an algorithm for efficiently searching objects of images, while creating a segmentation of heat generation part for an instance which is a heating element in a heat sensed image acquired from a thermal infrared camera. This method called a mask MTCNN is an algorithm that extends MTCNN by adding a branch for predicting an object mask in parallel with an existing branch for recognition of a bounding box. It is easy to generalize the R-CNN to other tasks. In this paper, we proposed an infrared image detection algorithm based on R-CNN and detect heating elements which can not be distinguished by RGB images.