International Journal of Computer Network and Information Security @ijcnis
Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1157
Статья научная
Wireless links are characterized by high error rates and intermittent connectivity. TCP congestion control has been developed on the assumption that network congestion is the only cause for packet loss. Upon detecting a packet loss, TCP drops its transmit window resulting in an unnecessary reduction of end-to-end throughput which results in suboptimal performance.The sender has to be made aware by some feedback mechanism that some of the losses reported are not due to congestion. The Active Queue Management algorithms (AQM) are used to reduce congestion, and in this paper, we have analysed four AQM algorithms, Random Early Deduction (RED), Wireless Explicit Congestion Notification (WECN), Queue Management Backward Congestion Control Algorithm (QMBCCA) and its enhanced version Extended Queue Management Backward Congestion Control Algorithm (EQMBCCA). WECN, QMBCCA & EQMBCCA algorithms make use of feedback mechanisms. WECN gives feedback using the CE bit. QMBCCA and EQMBCCA make use of ISQ notifications and also the CE bit whenever the average queue size crosses minimum threshold value. EQMBCCA reduces the reverse ISQ traffic by introducing a configurable intermediate threshold value IntThres. The comparison is made in terms of Delay, HTTP packet loss percentage and fairness for FTP flows in a wireless environment. It is found that the performance of EQMBCCA is almost equal to that of QMBCCA and better than RED and WECN.
Бесплатно
Extending the WSN lifetime by Dividing the Network Area into a Specific Zones
Статья научная
LEACH protocol is considered the best in the WSN protocols in extending the network lifetime and reduces energy loss, but LEACH suffers from the problem of the correct distribution of the nodes correlation with CHs. In this paper, we propose an improved protocol called LEACH-Z(LEACH zones), this protocol improves the distribution of clusters by making the clusters near the base station(BS) large(greater number of nodes) and the clusters are far from BS small(lesser number of nodes), where divides the network area to parts(zones), be part of a larger when close to the BS in addition to preventing the election of CHs in the region far from the BS and thus conserve energy this means that the nodes will remain alive as long as possible, this makes nodes gather more information. The results proved that the LEACH-Z is better than the original LEACH and more optimizations to reduce energy consumption.
Бесплатно
Статья научная
This paper presents, a low power 128-bit Advanced Encryption Standard (AES) algorithm based on a novel asynchronous self-timed architecture for encryption of audio signals. An asynchronous system is defined as one where the transfers of information between combinatorial blocks without a global clock signal. The self-timed architectures are asynchronous circuits which perform their function based on local synchronization signals called hand shake, independently from the other modules. This new architecture reduced spikes on current consumption and only parts with valid data are working, and also this design does not need any clock pulse. A combinational logic based Rijndael S-Box implementation for the Substitution Byte transformation in AES is proposed, its low area occupancy and high throughput therefore proposed digital design leads to reduction in power consumption. Mix-columns transformation is implemented only based on multiply-by-2 and multiply-by-3 modules with combinational logic. The proposed novel asynchronous self-timed AES algorithm is modeled and verified using FPGA and simulation results from encryption of sound signals is presented, until original characteristics are preserved anymore and have been successfully synthesized and implemented using Xilinx ISE V7.1 and Virtex IV FPGA to target device Xc4vf100. The achieved power consumption is 283 mW in clock frequency of 100 MHz.
Бесплатно
FPGA Implementation of Secure Force (64-Bit) Low Complexity Encryption Algorithm
Статья научная
Field-Programmable Gate Arrays (FPGAs) have turned out to be a well-liked target for implementing cryptographic block ciphers, a well-designed FPGA solution can combine some of the algorithmic flexibility and cost efficiency of an equivalent software implementation with throughputs that are comparable to custom ASIC designs. The recently proposed Secure Force (SF) shows good results in terms of resource utilization compared to older ciphers. SF appears as a promising choice for power and resource constrained secure systems and is well suited to an FPGA implementation. In this paper we explore the design decisions that lead to area/delay tradeoffs in a full loop-unroll implementation of SF-64 on FPGA. This work provides hardware characteristics of SF along with implementation results that are optimal in terms of throughput, latency, power utilization and area efficiency.
Бесплатно
Fast Vertical Handover Algorithm for Vehicular Communication: A Holistic Approach
Статья научная
Next generation vehicular communication environment will consist of heterogeneous radio access networks (RAN). For seamless connectivity, vertical handover is a mandatory requirement. A novel context aware vertical handover algorithm is presented here. TOPSIS (Technique for Order Preference by Similarity to Ideal Solution), which is a multi criteria decision making (MCDM) tool, is used for the development of algorithm and MATLAB/SIMULINK is used as simulation platform. The optimum network is selected, based on multiple factors such as network traffic load, velocity of mobile station, data rate, usage cost and initial delay of network, among the available networks such as WiMax, WLAN and UMTS. This algorithm has been tested by simulating a virtual road traffic scenario. Variations in optimum RAN selection with vehicle speed keeping network traffic load constant and RAN selection with network traffic load keeping vehicle speed constant are shown graphically. The proposed algorithm is very simple yet powerful compared to the existing VHO algorithms and hence requires less execution time.
Бесплатно
Fast and Efficient Design of a PCA-Based Hash Function
Статья научная
We propose a simple and efficient hash function based on programmable elementary cellular automata. Cryptographic hash functions are important building blocks for many cryptographic protocols such as authentication and integrity verification. They have recently brought an exceptional research interest, especially after the increasing number of attacks against the widely used functions as MD5, SHA-1 and RIPEMD, causing a crucial need to consider new hash functions design and conception strategies. The proposed hash function is built using elementary cellular automata that are very suitable for cryptographic applications, due to their chaotic and complex behavior derived from simple rules interaction. The function is evaluated using several statistical tests, while obtained results demonstrate very admissible cryptographic proprieties such as confusion, diffusion capability and high sensitivity to input changes. Furthermore, the hashing scheme can be easily implemented through software or hardware, and provides very competitive running performances.
Бесплатно
Статья научная
This article considers the method of analyze potentially vulnerable places during development of topology for fault-tolerant systems based on using betweenness coefficient. Parameters of different topological organizations using De Bruijn code transformation are observed. This method, assessing the risk for possible faults, is proposed for other topological organizations that are analyzed for their fault tolerance and to predict the consequences of simultaneous faults on more significant fragments of this topology.
Бесплатно
Feature Based Audio Steganalysis (FAS)
Статья научная
Taxonomy of audio signals containing secret information or not is a security issue addressed in the context of steganalysis. A cover audio object can be converted into a stego-audio object via different steganographic methods. In this work the authors present a statistical method based audio steganalysis technique to detect the presence of hidden messages in audio signals. The conceptual idea lies in the difference of the distribution of various statistical distance measures between the cover audio signals and their denoised versions i.e. stego-audio signals. The design of audio steganalyzer relies on the choice of these audio quality measures and the construction of two-class classifier based on KNN (k nearest neighbor), SVM (support vector machine) and two layer Back Propagation Feed Forward Neural Network (BPN). Experimental results show that the proposed technique can be used to detect the small presence of hidden messages in digital audio data. Experimental results demonstrate the effectiveness and accuracy of the proposed technique.
Бесплатно
Feature Selection for Modeling Intrusion Detection
Статья научная
Feature selection is always beneficial to the field like Intrusion Detection, where vast amount of features extracted from network traffic needs to be analysed. All features extracted are not informative and some of them are redundant also. We investigated the performance of three feature selection algorithms Chi-square, Information Gain based and Correlation based with Naive Bayes (NB) and Decision Table Majority Classifier. Empirical results show that significant feature selection can help to design an IDS that is lightweight, efficient and effective for real world detection systems.
Бесплатно
FileSyncer: Design, Implementation, and Performance Evaluation
Статья научная
With the pervasiveness of information technology, one of the growing trends today is a phenomenon which can be termed one-user-to-many-computing-devices. In many cases, the need to manage information across multiple electronic devices and storage media arises. The challenge therefore is finding a file synchronization system that can effectively replicate files across these different devices. This paper presents the design, implementation, and evaluation of FileSyncer, a rapid and efficient file synchronization tool that, in addition to the traditional synchronization capabilities, supports manual update selection and mechanism to revert a synchronization process back to the last previous state. The system employs last modified time, file size and CRC checksum for update detection and to ensure integrity of synchronized files. The synchronization times of the system for files of different sizes were compared with those of four existing file synchronization systems. Results showed increased efficiency in terms of time taken by FileSyncer to complete a synchronization operation with increase in file size compared to the other systems. In the future, we plan to release FileSyncer to the open source community for further development.
Бесплатно
Finding K Shortest Paths in a Network Using Genetic Algorithm
Статья научная
With the advent of new applications, different service needs come up. These needs could be in the form of reliability in delivering data, capacity amount in a particular range and certain amount of permissible delay. In order to provide high Quality of service to Networks, it is essential to provide a path between a given source and multiple destinations which satisfy certain constraints. For a domain catering to high QoS, there is a request of resources with certain constraints by all the applications. Speed and Scalability which are not flexible in terms of Network size and Topology are the basic issues to be considered here. Multimedia applications in general make use of k shortest paths whenever communication is to be carried out between a single source and one or more than one destination. In this paper, a genetic algorithm is used, which helps in determination of k shortest paths from a source node to more than one destination node, with bandwidth constraint. The algorithm makes use of the connection matrix as well as link bandwidth for determination of k shortest paths. The significance of using K shortest paths in a network is to increase Throughput and Packet delivery ratio.
Бесплатно
Finding Optimal Routes in Internal Routing Networks based on a Modified Dijkstra’s Algorithm
Статья научная
Modern communication networks face significant challenges due to the constant growth of traffic volumes and the need to effectively manage network resources. Standard routing protocols based on finding a single shortest path can lead to uneven load distribution and limit the overall throughput. One of the promising approaches to solving these problems is multi-path routing, which allows the use of multiple available paths for data transmission. In this paper, we propose a modification of the Dijkstra’s algorithm that extends the classical approach to find a set of optimal routes in a single algorithm run. The developed modification allows forming not only the main tree of shortest paths, but also additional trees of alternative routes, saving them based on certain conditions.
Бесплатно
Finding and Mitigating a Vulnerability of the Color Wheel PIN Protocol
Статья научная
There is an increasing usage in the banking sector of Smartphones enabled with Near Field Communication (NFC), to improve the services offered for the customers. This usage requires a security enhancement of the systems that employ this technology like the Automated Teller Machines (ATMs). One example is the Color Wheel Personal Identification Number (CWPIN) security protocol designed to authenticate users on ATMs using NFC enabled smartphones without typing the PIN code directly. CWPIN has been compared in the literature to several other protocols and was considered easier to use, more cost-effective and more resistant to various attacks on ATMs such as card reader skimming, keylogger injection, shoulder surfing, etc. Nevertheless, we demonstrate in this paper that CWPIN is vulnerable to the multiple video recordings intersection attack. We do so through concrete examples and a thorough analysis that reveals a high theoretical probability of attack success. A malicious party can use one or two hidden cameras to record the ATM and smartphone screens during several authentication sessions, then disclose the user's PIN code by intersecting the information extracted from the video recordings. In a more complex scenario, these video recordings could be obtained by malware injected into the ATM and the user's smartphone to record their screens during CWPIN authentication sessions. Our intersection attack requires a few recordings, usually three or four, to reveal the PIN code and can lead to unauthorized transactions if the user's smartphone is stolen. We also propose a mitigation of the identified attack through several modifications to the CWPIN protocol and discuss its strengths and limitations.
Бесплатно
Flat-Top Ring-Shaped Cell Design for High-Altitude Platform Communications
Статья научная
In this paper, a new design for ring-shaped cells is introduced where to improve the power distribution and carrier-to-interference ratio (CIR) over the cell area. The designed cell has flat-top radiation pattern with minimal ripples in the service area while the out-of-cell area has lower radiation levels. The new design utilizes two weighting functions applied to a vertical linear array; the first is responsible for the flat-top design and the second smoothes the pattern and reduces the sidelobe levels. The resulted power pattern has a uniform distribution over the cell stripe with as small as 0.25 dB ripples and a uniform CIR values greater than 43 dB within the cells which reduces the burden of power control and increases the immunity to propagation problems.
Бесплатно
Flow-aware Segment Routing in SDN-enabled Data Center Networks
Статья научная
The underlying objective of segment routing is to avoid maintenance of the per-flow state at forwarding devices. Segment routing (SR) enables the network devices to minimize their forwarding table size by generalizing the forwarding rules and making them applicable to multiple flows. In existing works, optimizing the trade-off between segment length and the number of co-flows sharing the segment is considered the key to determining optimal segment endpoints. However, the flow characteristics like the lifetime of flows, and dynamically altering routing paths are critical and impact the performance of SR. Ideally, network flows considered for SR are expected to persist for a longer duration and adhere to static routing paths. But our analysis of flow characteristics at a typical data center reveals that the majority of flows are short-lived. Also, network flows are subject to alter their routing paths frequently for several reasons. Considering short-lived flows and flows that dynamically alter their routing paths may lead to choosing unstable segment endpoints. Hence, it is necessary to study the flow characteristics for determining more stable segment endpoints. In this paper, the authors implemented the SR technique considering the flow characteristics at an SDN-enabled data center and the results show a significant improvement with respect to the stability of segment endpoints.
Бесплатно
Статья научная
In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources of virtual machines. Load balancing in the CC environment is one of the analytical approaches utilized to ensure indistinguishable workload distribution and effective utilization of resources. This is because only by ensuring effective balance of dynamic workload results in higher user satisfaction and optimal allocation of resource, therefore improve cloud application performance. Moreover, a paramount objective of load balancing is task scheduling because surges in the number of clients utilizing cloud lead to inappropriate job scheduling. Hence, issues encircling task scheduling has to be addressed. In this work a method called, Ford Fulkerson and Newey West Regression-based Dynamic Load Balancing (FF-NWRDLB) in CC environment is proposed. The FF-NWRDLB method is split into two sections, namely, task scheduling and dynamic load balancing. First, Ford Fulkerson-based Task Scheduling is applied to the cloud user requested tasks obtained from Personal Cloud Dataset. Here, employing Ford Fulkerson function based on the flow of tasks, energy-efficient task scheduling is ensured. The execution of asymmetrical scientific applications can be smoothly influenced by an unbalanced workload distribution between computing resources. In this context load balancing signifies as one of the most significant solution to enhance utilization of resources. However, selecting the best accomplishing load balancing technique is not an insignificant piece of work. For example, selecting a load balancing model does not work in circumstances with dynamic behavior. In this context, a machine learning technique called, Newey West Regression-based dynamic load balancer is designed to balance the load in a dynamic manner at run time, therefore ensuring accurate data communication. The FF-NWRDLB method has been compared to recent algorithms that use the markov optimization and the prediction scheme to achieve load balancing. Our experimental results show that our proposed FF-NWRDLB method outperforms other state of the art schemes in terms of energy consumption, throughput, delay, bandwidth and task scheduling efficiency in CC environment.
Бесплатно
Forensics Investigation of Web Application Security Attacks
Статья научная
Nowadays, web applications are popular targets for security attackers. Using specific security mechanisms, we can prevent or detect a security attack on a web application, but we cannot find out the criminal who has carried out the security attack. Being unable to trace back an attack, encourages hackers to launch new attacks on the same system. Web application forensics aims to trace back and attribute a web application security attack to its originator. This may significantly reduce the security attacks targeting a web application every day, and hence improve its security. The aim of this paper is to carry out a detailed overview about the web application forensics. First, we define the web applications forensics, and we present a taxonomic structure of the digital forensics. Then, we present the methodology of a web application forensics investigation. After that, we illustrate the forensics supportive tools for a web application forensics investigation. After that, we present a detailed presentation of a set of the main considered web application forensics tools. Finally, we provide a comparison of the main considered web application forensics tools.
Бесплатно
Forensics image acquisition process of digital evidence
Статья научная
For solving the crimes committed on digital materials, they have to be copied. An evidence must be copied properly in valid methods that provide legal availability. Otherwise, the material cannot be used as an evidence. Image acquisition of the materials from the crime scene by using the proper hardware and software tools makes the obtained data legal evidence. Choosing the proper format and verification function when image acquisition affects the steps in the research process. For this purpose, investigators use hardware and software tools. Hardware tools assure the integrity and trueness of the image through write-protected method. As for software tools, they provide usage of certain write-protect hardware tools or acquisition of the disks that are directly linked to a computer. Image acquisition through write-protect hardware tools assures them the feature of forensic copy. Image acquisition only through software tools do not ensure the forensic copy feature. During the image acquisition process, different formats like E01, AFF, DD can be chosen. In order to provide the integrity and trueness of the copy, hash values have to be calculated using verification functions like SHA and MD series. In this study, image acquisition process through hardware-software are shown. Hardware acquisition of a 200 GB capacity hard disk is made through Tableau TD3 and CRU Ditto. The images of the same storage are taken through Tableau, CRU and RTX USB bridge and through FTK imager and Forensic Imager; then comparative performance assessment results are presented.
Бесплатно
Formal Verification of Congestion Control Algorithm in VANETs
Статья научная
A Vehicular Ad-Hoc Networks (VANETs) is the technology that uses moving cars as nodes in a network to create a mobile network. VANETs turn every participating car into a wireless router, allowing cars of each other to connect and create a network with a wide range. VANETs are developed for enhancing the driving safety and comfort of automotive users. The VANETs can provide wide variety of service such as Intelligent Transportation System (ITS) e.g. safety applications. Many of safety applications built in VANETs are required real-time communication with high reliability. One of the main challenges is to avoid degradation of communication channels in dense traffic network. Many of studies suggested that appropriate congestion control algorithms are essential to provide efficient operation of the network. However, most of congestion control algorithms are not really applicable to event-driven safety messages. In this paper we propose congestion control algorithm as solution to prevent congestion in VANETs environment. We propose a complete validation method and analyse the performance of our congestion control algorithms for event-driven safety messages in difference congested scenarios. The effectiveness of the proposed congestion control algorithm is evaluated through the simulation using Veins simulator.
Бесплатно
Formal Verification of NTRUEncrypt Scheme
Статья научная
In this paper we explore a mechanized verification of the NTRUEncrypt scheme, with the formal proof system Isabelle/HOL. More precisely, the functional correctness of this algorithm, in its reduced form, is formally verified with computer support. We show that this scheme is correct what is a necessary condition for the usefulness of any cryptographic encryption scheme. Besides, we present a convenient and application specific formalization of the NTRUEncrypt scheme in the Isabelle/HOL system that can be used in further study around the functional and security analysis of NTRUEncrypt family.
Бесплатно
