International Journal of Computer Network and Information Security @ijcnis
Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1148
Statistical Hiding Fuzzy Commitment Scheme for Securing Biometric Templates
Статья научная
By considering the security flaws in cryptographic hash functions, any commitment scheme designed straight through hash function usage in general terms is insecure. In this paper, we develop a general fuzzy commitment scheme called an ordinary fuzzy commitment scheme (OFCS), in which many fuzzy commitment schemes with variety complexity assumptions is constructed. The scheme is provably statistical hiding (the advisory gets almost no statistically advantages about the secret message). The efficiency of our scheme offers different security assurance, and the trusted third party is not involved in the exchange of commitment. The characteristic of our scheme makes it useful for biometrics systems. If the biometrics template is compromised, then there is no way to use it directly again even in secure biometrics systems. This paper combines biometrics and OFCS to achieve biometric protection scheme using smart cards with renewability of protected biometrics template property.
Бесплатно
Статья научная
Represented paper is currently topical, because of year on year increasing quantity and diversity of attacks on computer networks that causes significant losses for companies. This work provides abilities of such problems solving as: existing methods of location of anomalies and current hazards at networks, statistical methods consideration, as effective methods of anomaly detection and experimental discovery of choosed method effectiveness. The method of network traffic capture and analysis during the network segment passive monitoring is considered in this work. Also, the processing way of numerous network traffic indexes for further network information safety level evaluation is proposed. Represented methods and concepts usage allows increasing of network segment reliability at the expense of operative network anomalies capturing, that could testify about possible hazards and such information is very useful for the network administrator. To get a proof of the method effectiveness, several network attacks, whose data is storing in specialised DARPA dataset, were chosen. Relevant parameters for every attack type were calculated. In such a way, start and termination time of the attack could be obtained by this method with insignificant error for some methods.
Бесплатно
Stochastic RA-Network for the Nodes Functioning Analysis in the Distributed Computer Systems
Статья научная
In the paper is described the simulating process for the situations analysis and the decisions making about the functioning of the Distributed Computer Systems (DCS) nodes on the basis of special stochastic RA-networks mechanism. There are presented the main problems in the estimations of the DCS nodes functioning parameters and there are shown that the suggested RA-networks mechanism allows simulate the data flow with the different, including the significantly different intensities, what is particularly important in for the situations analysis and the decisions making in the DCS nodes parameters dynamics control.
Бесплатно
Study and Analysis of Text Steganography Tools
Статья научная
"Maintain the security of the secret information", this words has been a great challenge in our day to day life. Sender can send messages regularly through a communication channel like Internet, draws the attention of third parties, hackers and crackers, perhaps causing attempts to break and expose the unusual messages. Steganography is a gifted region which is used for secured data transmission over any public media. Wide quantity of research work has been established by different researchers on steganography. Steganalysis is an art and science of detecting messages hidden using steganography. Some research work has also been remarked in the field of Steganalysis also. In this contribution, we have gone through steganalysis attack of some established text steganography tools.
Бесплатно
Study of 2D DOA Estimation for Uniform Circular Array in Wireless Location System
Статья научная
In this paper, the use of a uniform circular antenna arrays (UCA) for high resolution of two dimensional (2D) direction of arrivals (DOAs) estimation in wireless location system is investigated. Performance of 2D DOA estimation based on the real-valued unitary transformation MUSIC algorithm for UCA is presented, especially focusing on DOA estimation of multiple correlated signals. The determination of the number of incident signals on an antenna array is addressed in the condition of colored noise and coherent signal sources. Selected method for estimating the number of these sources is formulated based on the modified eigenvectors of the covariance matrix of the received signal at the antenna array. The calibration procedure is also presented for UCA especially. Simulation results are presented to confirm the performance analysis of algorithm, then the validations of Unitary Transformation MUSIC algorithm are performed based on the measurement data in a wireless location system.
Бесплатно
Статья научная
Long-Term Evolution (LTE) is the next generation of current mobile telecommunication networks. LTE has a new flat radio-network architecture and significant increase in spectrum efficiency. In this paper, performance analysis of robust channel estimators for Downlink Long Term Evolution-Advanced (DL LTE-A) system using three Artificial Neural Network ANN Architectures: Feed-forward neural network, Cascade-forward neural network and Layered Recurrent Neural Network (LRN) are adopted to train the constructed ANNs models separately using Back-Propagation Algorithm. The methods use the information got by the received reference symbols to estimate the total frequency response of the channel in two important phases. In the first phase, the proposed ANN based method learns to adapt to the channel variations, and in the second phase it estimates the channel matrix to improve performance of LTE. The performance of the estimation methods is evaluated by simulations in Vienna LTE-A DL Link Level Simulator. Performance of the proposed channel estimator, Layered Recurrent Neural Network is compared with traditional Least Square (LS) algorithm and ANN based other estimator like Feed-forward neural network and Cascade-forward neural network for Closed Loop Spatial Multiplexing-Single User Multi-input Multi-output (2×2 and 4×4) (CLSM-SUMIMO) in terms of throughput. Simulation result shows LRN gives better performance than other ANN based estimations methods and LS.
Бесплатно
Study of Multi-Level Cryptography Algorithm: Multi-Prime RSA and DES
Статья научная
The purpose of this study is to implement and observe parameters like time and memory for implementation of multi-level encryption using the Data Encryption Standard (DES) and a modified version of the RSA Algorithm, the multi-prime RSA. The average values are calculated for each parameter after using a different number of primes and the results have been illustrated graphically and in tabular form for clarity of conclusions. The advantages and reasoning for using this approach have also been listed in the study.
Бесплатно
Study on Supervision Mechanism in Mobile Value-added Market Based on Stackelberg Game Theory
Статья научная
Since powerful supervision on the mobile valueadded services is lacking nowadays, the mobile market goes into a tendency of being rather chaotic. This research will analyze the behavior of both the service providers and mobile operators, with game theory model to be established. Moreover, the Nash Equilibrium will also be considered which shows that the costs and extent of the mobile operator’s supervision besides the penalty for the service provider’s being caught will definitely influence the probability for service providers to violate the rules. On the other hand, the proportion of illegal gains shared by mobile operators and the penalty degree for service providers may be the main factors that affect the mobile operator’s supervision choices. At last suggestions are made on the service provider’s strategic choices.
Бесплатно
Study the One-bit Hard Combination Scheme on Cognitive Radio Users
Статья научная
This paper describes the performance of one-bit hard combination scheme of cooperative spectrum sensing for different number of cognitive radio users. We evaluate cooperative spectrum sensing by simulating OR rule as a hard combination data fusion rule. Energy detector is used to observe the presence of primary user (PU) signal. It improves the probability of detection by collaborating to detect PUs signal in cognitive radio (CR) system. Simulation result shows that the probability of missed detection is decreasing for both conventional hard combination and 1-bit hard combination scheme with OR rule correspondingly with increasing the probability of false alarm. It is shown that 1-bit scheme has much better performance than the conventional hard combination scheme. This is also shown that the probability of missed detection is decreased even though CR user is increased. Here missed detection probability is decreased when the number of user increases.
Бесплатно
Статья научная
The development of technology around us is going through a rapid and significant state that is almost causing a technological revolution, so one of the most important problems facing us in the current technological era is the management of warehouse data and the growth occurring in the volume of data that is dealt with on a daily basis, whether in terms of its storage or security, especially if the data is huge and large. Therefore, we developed a proposed model in our study that provides security in addition to storage/warehouse management. In our proposed model, the El-Gamal and GLUON functions address the security problem. In addition to supporting other security methods, such as GLUON, which is secure and fast, for encryption. Hybrid Blockchain technology is used in our proposed model to deal with the storage of this type of huge data, and also for the purpose of organizing warehouse storage. Data is exposed to intrusion or loss when using any traditional, centralized technology or when storing it in databases, so we chose the hybrid Blockchain to be an integrated fit with our proposed model, and also because it allows the distribution of data across public and private domains. Our proposed model, upon examination, shows that it effectively dealt with defending against attacks such as NotPetya, GoldenEye, WannaCry, Emotet, Trickbot, Conti, and DarkSide. In addition, the results of lightweight GLUON and El-Gamal showed that the performance analysis of our model was very successful, where the time it takes to create a block was between 0.01 ns and not more than 0.09 ns which is considered too fast for such a system that deals with a big data. As a result, we were able to gain an effective model for data repository control, security, performance, and management.
Бесплатно
Subcarrier and Power Allocation in OFDM-based Cognitive Radio Systems
Статья научная
For CR systems, where primary and CR users co-exist in adjacent bands, it is important to keep the interference introduced to the primary user (PU) band within a tolerable range. In this paper, we investigate the subcarrier and power allocation problem in CR systems, where primary and CR users co-exist in adjacent bands, while keeping the total interference introduced to the PU band below a certain threshold and the total power allocated to the CR users under a constraint. First, according to the different purposes of the resource allocation, several suboptimal subcarrier allocation algorithms are investigated, which are termed as Max-Rate, Min-Interference and Fair-Rate subcarrier allocation algorithm, separately. Further, for a given subcarrier allocation three suboptimal power allocation algorithms which have less complexity are proposed and compared to the optimal power allocation algorithm. Numerical results are obtained for the behaviors and performance of our proposed algorithms.
Бесплатно
Survey of Current Multipath Routing Protocols for Mobile AD Hoc Networks
Статья научная
A Mobile Ad hoc NETwork (MANET) is a wireless communication network with minimum physical infrastructure with diverse communication applications. Mobility and Multihopping are the main characteristics of MANET. Multipath routing protocols establish multiple routes between nodes. The construction of multiple routes should be done with minimum overhead and bandwidth consumption. The purpose of this article is to analyze the characteristics and functionality of various multipath routing protocols and to do the performance comparison between these multipath routing protocols to choose the best among them to use in large networks.
Бесплатно
Swarm Flooding Attack against Directed Diffusion in Wireless Sensor Networks
Статья научная
The objective of this paper is to study the vulnerabilities of sensor networks, design, and implement new approaches for routing attack. As one of the cornerstones of network infrastructure, routing systems are facing more threats than ever; they are vulnerable by nature and challenging to protect. We present a new attack, Swarm Flooding Attack, against Directed Diffusion based WSNs, which targets the consumption of sensors computational resources, such as bandwidth, disk space, or processor time. Two variants of swarm attack have been introduced: Bee and Ant. Both approaches are inspired from the natural swarming difference between bees and ants. In all cases, the strategy used to mount an attack is the same. An attack consists of a set of malicious user queries represented by interests that are inserted into the network. However, the two forms of attack vary in the synchronization aspects among attackers. These types of attacks are hard to defend against as illustrated. For each of the proposed attack models, we present analysis, simulation, and experimental measurements. We show that the system achieves maximal damage on system performance represented by many metrics.
Бесплатно
Symmetric Key Encryption using Iterated Fractal Functions
Статья научная
With the advancement in the network transmission media, need for secure data communication is strongly felt. Recently fractal based cryptosystem has become a topic of active research in computer network system because of its chaotic behavior. The proposed method utilizes the intrinsic relationship between Mandelbrot function and Julia function to develop a non-transitional key cryptosystem. The process starts with the formation of public key using superior Mandelbrot set with the help of few global as well as secret parameters on both sides. After exchanging public keys, both parties will generate their own private key using superior Julia set which will be same on both sides. The method is also implemented for Ishikawa iterated fractal function and subsequently carried out detailed analysis for both functions. The given cryptosystem utilizing two different iteration methods and improve the performance by increasing the encryption key up to 128 bits. As per experimental result and performance analysis, the key has large key space, high key sensitivity due to chaotic nature and efficient execution time which helps to achieve a secure communication network environment for data transmission.
Бесплатно
Synthesis of the Structure of a Computer System Functioning in Residual Classes
Статья научная
An important task of designing complex computer systems is to ensure high reliability. Many authors investigate this problem and solve it in various ways. Most known methods are based on the use of natural or artificially introduced redundancy. This redundancy can be used passively and/or actively with (or without) restructuring of the computer system. This article explores new technologies for improving fault tolerance through the use of natural and artificially introduced redundancy of the applied number system. We consider a non-positional number system in residual classes and use the following properties: independence, equality, and small capacity of residues that define a non-positional code structure. This allows you to: parallelize arithmetic calculations at the level of decomposition of the remainders of numbers; implement spatial spacing of data elements with the possibility of their subsequent asynchronous independent processing; perform tabular execution of arithmetic operations of the base set and polynomial functions with single-cycle sampling of the result of a modular operation. Using specific examples, we present the calculation and comparative analysis of the reliability of computer systems. The conducted studies have shown that the use of non-positional code structures in the system of residual classes provides high reliability. In addition, with an increase in the bit grid of computing devices, the efficiency of using the system of residual classes increases. Our studies show that in order to increase reliability, it is advisable to reserve small nodes and blocks of a complex system, since the failure rate of individual elements is always less than the failure rate of the entire computer system.
Бесплатно
SysProp: A Web-based Data Backup, Synchronization and System Administration
Статья научная
From the inception of computer based computing, preventing data loss or data corruption is considered as one of the difficult challenges. In early days, data reliability had been increased by replicating data in multiple disks, which were attached with the same system and later located inside the same network. Later, to avoid potential risk of single point of failure, the replicated data storage has been separated from the network from which the data has been originated. Thus, following the concept of peer-to-peer (P2P) networking, P2P storage system has been designed, where data has been replicated inside multiple remote peers’ redundant storages. With the advent of Cloud computing, a similar but more reliable Cloud-based storage system has been developed. Note that Cloud storages are expensive for small and medium enterprises. Moreover, users are often reluctant to store their sensitive data inside a third-party’s network that they do now own or control. In this paper, we design, develop and deploy a storage system that we named SysProp. Two widely used tools—Web applications and UNIX daemon—have been incorporated in the development process of SysProp. Our goal is to congregate benefits of different storage systems (e.g., networked, P2P and Cloud storages) in a single application. SysProp provides a remotely accessible, Web-based interface, where users have full control over their data and data is being transferred in encrypted form. Moreover, for data backup, a powerful UNIX tool, rsync has been used that synchronize data by transferring only the updated portion. Finally, SysProp is a successful demonstration of the concept that UNIX daemons can be remotely executed and controlled over the Web. Hence, this concept might be exploited to build many system administrative applications.
Бесплатно
System Design of a Trusted SoC and Detailed Analysis of its Secure State Transitions
Статья научная
According to the relevant criterion and principle for designing and evaluating various trusted computing chips, we have proposed a new trusted SoC chip, and have given the implementation of its basic functional modules. In detail, we have discussed the design of the trusted SoC security architecture and the main module functional modules such as microprocessor, cryptographic function module, security management module, input/output interface, along with the most important memory management unit. Moreover, we have discussed reliability of relevant parameters and transfer strategy for trusted root in chip development and application, together with the simulation and validation of corresponding functions. At last, we point out that one of the most important further research directions is the trusted measurement of dynamic data and software running in security environment.
Бесплатно
System Monitoring Addon Analysis in System Load Simulation
Статья научная
The complexity of interconnected devices requires constant real-time monitoring, as failure of one part can have catastrophic consequences for the entire system. Computer-information monitoring tools enable us to always be one step ahead of potential problems that may occur in a monitored network environment, whether it is a human-caused configuration or simply an element has failed or stopped working. Not only can they report potential problems, but they can also solve the problem itself. For example, if an element needs increased resources at a given time, the tool itself can recognize it and automatically increase the resource needs of that element. By setting up a monitoring system in a virtual environment, the results can be seen and through their analysis will bring an optimal solution when it comes to what agent to use. This paper presents analysis of how network monitoring agent is responding in cases when there is increased use of shared resources. Knowing this can help in choosing what agent should be used in any given environment, and with that more resources will be saved. This leads to better utilization of resources which is an important in mid-size and big setup of computer monitoring systems.
Бесплатно
Targeted Attacks Detection and Security Intruders Identification in the Cyber Space
Статья научная
The number of new cybersecurity threats and opportunities is increasing over time, as well as the amount of information that is generated, processed, stored and transmitted using ICTs. Particularly sensitive are the objects of critical infrastructure of the state, which include the mining industry, transport, telecommunications, the banking system, etc. From these positions, the development of systems for detecting attacks and identifying intruders (including the critical infrastructure of the state) is an important and relevant scientific task, which determined the tasks of this article. The paper identifies the main factors influencing the choice of the most effective method for calculating the importance coefficients to increase the objectivity and simplicity of expert assessment of security events in cyberspace. Also, a methodology for conducting an experimental study was developed, in which the goals and objectives of the experiment, input and output parameters, the hypothesis and research criteria, the sufficiency of experimental objects and the sequence of necessary actions were determined. The conducted experimental study confirmed the adequacy of the models proposed in the work, as well as the ability of the method and system created on their basis to detect targeted attacks and identify intruders in cyberspace at an early stage, which is not included in the functionality of modern intrusion detection and prevention systems.
Бесплатно
Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm
Статья научная
The problem of task assignment is one of the most fundamental among combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. A classic problem that confronts computer scientists across the globe pertaining to the effective assignment of tasks to the various processors of the system due to the intractability of the task assignment problem for more than 3 processors. Several Algorithms and methodologies have been proposed to solve the Task Assignment Problem, most of which use Graph Partitioning and Graph Matching Techniques. Significant research has also been carried out in solving the Task Assignment Problem in a parallel environment. Here we propose a modified version of iterated greedy algorithm that capitalizes on the efficacy of the Parallel Processing paradigm, minimizing the various costs along with the duration of convergence. The central notion of the algorithm is to enhance the quality of assignment in every iteration, utilizing the values from the preceding iterations and at the same time assigning these smaller computations to internal processors (i.e. parallel processing) to hasten the computation. On implementation, the algorithm was tested using Message Passing Interface (MPI) and the results show the effectiveness of the said algorithm.
Бесплатно
