International Journal of Computer Network and Information Security @ijcnis
Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1148
Comprehensive Methods of Evaluation of Distance Learning System Functioning
Статья научная
Given recent events, training during quarantine can only take place remotely. To ensure quality training, communication must be seamless. To do this, the network must function smoothly. The solution to this problem is functionally stable networks that allow uninterrupted transmission of information due to redundancy. An important issue is the definition of redundancy. To solve this problem, the article considers the method of synthesis of the structure of the distance learning system. The method of synthesis of network structure used for providing distance learning by the criterion of maximum functional stability on the basis of the introduction of correcting communication lines is offered. With this method, you can develop tools for self-recovery of distributed software, taking into account the characteristics of disparate computer resources through the use of redundancy. This will allow you to develop functionally stable software systems, significantly reduce the recovery time of such systems after or in the event of possible failures. To increase the efficiency of the developed method, the mathematical model of the hyper network based on two hypergraphs was improved, which allows taking into account different requirements for the quality of the network.
Бесплатно
Comprehensive Methods of Evaluation of Efficiency of Distance Learning System Functioning
Статья научная
The current pace of development of information technology has created the preconditions for the emergence of a wide range of tools for providing educational services using distance learning technologies. This is confirmed by the intensification of the use of distance learning systems in the conditions of sanitary and epidemiological restrictions and the need for acute cost savings. The existing scientific and methodological apparatus for studying the quality of functioning of distance learning systems is mostly based on approaches to separate assessment of the effectiveness of their elements and the relevant quality indicators. This limits the ability to take into account important factors in the decision-making process and requires comprehensive consideration of the contributions of relevant subsystems to the functioning of the distance learning system. In order to solve this problem, the article presents a comprehensive methodology for assessing the effectiveness of distance learning system, based on methods of probability theory and hierarchy analysis and describes the patterns of influence on the effectiveness of distance learning system of importance and contributions of its subsystems. Comparative analysis of the data obtained by monitoring and forecasting performance indicators based on the proposed method, shows an increase in the reliability of the assessment within 15-18%, which in contrast to the existing reduction of standard deviation of performance indicators by an average of 26% and ensures the adequacy of the results within certain assumptions and hypotheses. In such conditions, the choice of an appropriate option for the construction of the DN system is ensured by the reliability of the forecast of the results of its operation in the range of 82-85%, which is high enough to make appropriate decisions. The value of this study lies in the possibility of using the tested scientific and methodological apparatus in forecasting the outcome of the system and saving material, financial and human resources in the process of implementing the relevant recommendations in practice. This fact makes it possible to eliminate limitations in the practice of building distance learning systems and creates a new opportunity to cover a wider range of factors that affect the quality of operation.The application of this technique makes it possible to predict the results of the joint operation of the relevant subsystems of the distance learning system, taking into account their contribution to the overall result.
Бесплатно
Comprehensive Study of Selective Forwarding Attack in Wireless Sensor Networks
Статья научная
Sensor networks are becoming closer towards wide-spread deployment so security issues become a vital concern. Selective forwarding attack is one of the harmful attacks against sensor networks and can affect the whole sensor network communication. The variety of defense approaches against selective forwarding attack is overwhelming. In this paper we have described all the existing defensive schemes according to our best knowledge against this attack along with their drawbacks, thus providing researchers a better understanding of the attack and current solution space. This paper also classifies proposed schemes according to their nature and defense. Nature of scheme classifies into Distributed and Centralized. Defense of scheme classifies into detection and prevention.
Бесплатно
Статья научная
The use of wireless sensor networks has been increasing tremendously in the past decades mainly because of its applications in military, medicine, under water survey and various other fields. Depending on the applications the sensor nodes are placed in different areas and the data sensed will be sent to the base station. The process of transmitting and receiving data sensed by the sensor nodes continues till the sensors have battery life. This leads to generate data redundancy and reduces efficiency of the network. In order to overcome the limitations faced by the wireless sensor networks, the fusion of data known as data aggregation is introduced. In data aggregation, the data sensed by the various nodes are aggregated and sent to the base station as a single data packet. In this paper, a brief review on various data aggregation methods, challenges and issues are addressed. In addition to this, performance parameters of various data fusion methods to measure the efficiency of the network are discussed. The design of single aggregator models are easy compared to the multiple aggregator models. However, the security to most of the data fusion schemes is provided by using message authentication code. It also uses public keys and symmetric to achieve end to end or hop by hop encryptions.
Бесплатно
Computation of Pheromone Values in AntNet Algorithm
Статья научная
In this paper, we discuss the basic routing technique of ants and study the change in pheromone values at each node. Also the optimal paths can then be computed based on the shortest cumulative pheromone count between source and destination nodes. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. The ants or control packets collect information about the network conditions and are used to update and maintain the routing tables. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. A version of ant routing protocol called AntNet has been implemented to work within the network simulator ns-2. Routing tables and Pheromone tables have been computed for each node in the network. On the basis of these tables we have tried to compute the shortest and most optimal path between source node and destination node.
Бесплатно
Computational Independence in the Design of Cryptographic Protocols
Статья научная
Statistical independence of instances of primitives and protocols is a clear-cut approach for guaranteeing protection against harmful interactions in concurrent and multi-execution environment. Therefore it is surprising that computational indistinguishability of independence from dependence between two or several random variables received no attention since the introduction of classic binary pseudorandom sequences. In this work we propose the use of the notion of computational independence (CI) in the analysis and design of provably secure cryptographic protocols. We generalize the classic result on equivalence of unpredictability and CI to general non-binary random variables. An application of this result is the use of unpredictability-based standard secure primitives in supporting the achievement of CI. This work is inherently related to Canetti's universal composition framework [4], [5].
Бесплатно
Computer security and software watermarking based on return-oriented programming
Статья научная
Applications of computer security issues are limited to the operating systems and gadgets used within the computers and all other devices integrated with supercomputers. With the growing number of users, software developers face the software piracy which could affect the computer systems. Currently, the major problem for computers in the different industries is software piracy. Despite many computer security techniques, we have proposed a software watermark design based on return-oriented programming (ROP). Here, the new design of the software watermark is considered as a method in which secure Hash algorithm plays an important role to enhance the performance of the computer security. In this method, we focused on gadgets analysis gadgets categories and a large number of gadgets. In this analysis, we selected Sjeng benchmark and ROP with different approaches. As a theoretical result, resilience and stealthy are compared with existing results. This approach can be useful to improve the application of the computer security laws with legal procedures depended on the proposed computer security algorithms and analysis.
Бесплатно
Conceptual model of national intellectucal system for children safety in internet environment
Статья научная
The article presents a conceptual model for the national intellectual system aiming the safety provision of the children in Internet environment. The structucal components and work principles of the proposed model are explained. This model employs web-analytics, data sanitization (cleaning) technology, expert systems, text mining, clustering and classification methods, content filtering and etc. to protect children from harmful information in virtual environment. By using data sanitization methods, the study presents a conceptual model for obtaining more important, useful and age-corresponding information from internet resources and preventing harmful information.
Бесплатно
Congestion Control in 4G Wireless Networks Using Coalition Game
Статья научная
In 4G-domain multi home mobile host (MH) will have access to different wireless networks. In this 4G wireless networks real time applications are initiated to support services like VOIP, videoconference. These applications use RTP over UDP. These protocols are unresponsive to congestion events. Our proposed congestion management scheme minimizes congestion level in 4G domains using coalition game. Its main objective is to decide target networks for handoff with minimum congestion level. Our mechanism is based on the coalition game formation. It aims at maximizing the utilization of the resources available and meeting QoS requirement of users as much as possible. This will reduce congestion level with vertical handoff initiation.
Бесплатно
Статья научная
The main intention of this paper is focus on mechanism for reducing congestion in the network by free resources to set accurate rates and priority data needs. If two nodes send their packets in the shortest path to the parent node in a crowded place, a source node must prioritize the data and uses data that have lower priorities of a suitable detour nodes consisting of low or non- active consciously. The proposed algorithm is applied to the nodes near the base station (which convey more traffic) after the congestion detection mechanism detected the congestion. Obtained results from simulation test done by NS-2 simulator demonstrate the innovation and validity of proposed method with better performance in comparison with CCF, PCCP and DCCP protocols.
Бесплатно
Constraint Based Periodicity Mining in Time Series Databases
Статья научная
The search for the periodicity in time-series database has a number of application, is an interesting data mining problem. In real world dataset are mostly noisy and rarely a perfect periodicity, this problem is not trivial. Periodicity is very common practice in time series mining algorithms, since it is more likely trying to discover periodicity signal with no time limit. We propose an algorithm uses FP-tree for finding symbol, partial and full periodicity in time series. We designed the algorithm complexity as O (kN), where N is the length of input sequence and k is length of periodic pattern. We have shown our algorithm is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both synthetic and real data from different domains have shown our algorithms' time efficient and noise-resilient feature. A comparison with some current algorithms demonstrates the applicability and effectiveness of the proposed algorithm.
Бесплатно
Construction for searchable encryption with strong security guarantees
Статья научная
We present a construction for searchable symmetric encryption (SSE). We consider a wide range of attacks and hardness assumptions and fulfill the strongest security requirements. The "standard" privacy requirement against searchable encryption is message indistinguishability under an adaptively chosen keyword attack (IND-CKA2). We consider to protect the data and the keyword(s) together, i.e. privacy of the data is not considered as a separate problem (as the latter is typical in research papers). Beside the CKA model, we consider also the adaptively chosen trapdoor attack (CTA). Against active attacks (such as swapping attack) we add integrity protection for the (data, keyword) pair. By guaranteeing existential unforgeability (EU) for trapdoor keys we give protection against Keyword Guessing Attack (KGA). Attacks via searching for patterns in the database is prevented by randomized keyword encryption and trapdoor generation. Our construction is secure in the standard model of computation assuming bilinear groups with the widely used Symmetric eXternal Diffie Hellmann (SXDH) assumption.
Бесплатно
Container-to-fog Service Integration using the DIS-LC Algorithm
Статья научная
Containers have newly emerged as a potential way to encapsulate and execute programs. In contrast to virtual machines, each container does not have its own kernel and instead shares the host systems. Containers on the other hand are more lightweight, need fewer data to be sent between network nodes and boot up faster than VM. This makes containers a feasible choice, particularly for hosting and extending the services across the fog computing architecture. The major purpose of this paper is to describe the Distributed Intelligent Scheduling based Lightweight Container algorithm (DIS-LC), which is a revolutionary way for container to fog-services integration and resource optimization. In this proposed algorithm is compared to the least connection algorithm, round-robin algorithm and Ant Colony Optimization-based Light Weight Container (ACO-LWC). Operating cost and traffic cost are used to validate the suggested algorithm. Fog node running costs are divided into two categories: CPU and memory. When compared to current algorithms, quantitative research demonstrates that the proposed DIS-LC scheme gets the greatest performance in terms of all metrics. This demonstrate the algorithm is efficient. Finally, the performance of containerized services and resource management systems is evaluated using the iFogSim simulator.
Бесплатно
Статья научная
Conventional approaches for adapting security enforcement in the face of attacks rely on administrators to make policy changes that will limit damage to the system. Paradigm shifts in the capabilities of attack tools demand supplementary strategies that can also adjust policy enforcement dynamically. We extend the current research by proposing an approach for integrating real-time security assessment data into access control systems. Critical application scenarios are tested to examine the impact of using risk data in policy evaluation and enforcement.
Бесплатно
Context-Sensitive Grammars and Linear-Bounded Automata
Статья научная
Linear-bounded automata (LBA) accept context-sensitive languages (CSLs) and CSLs are generated by context-sensitive grammars (CSGs). So, for every CSG/CSL there is a LBA. A CSG is converted into normal form like Kuroda normal form (KNF) and then corresponding LBA is designed. There is no algorithm or theorem for designing a linear-bounded automaton (LBA) for a context-sensitive grammar without converting the grammar into some kind of normal form like Kuroda normal form (KNF). I have proposed an algorithm for this purpose which does not require any modification or normalization of a CSG.
Бесплатно
Contextual Risk-based Decision Modeling for Vehicular Networks
Статья научная
A vehicular ad hoc network (VANET) is the emerging technology that allows the drivers to keep the road safety throughout the journey. In VANETs, vehicles can collaborate with each other by exchanging the messages. When these messages are incorrect, drivers will have to face many serious problems which include traffic congestion and minor to fatal road accidents. Therefore, drivers need a method which provides the correct decision using risk analysis calculated from the vehicle context. For this purpose, we propose a new contextual risk-based decision methodology for vehicular networks. This methodology can be used to provide robust and reliable decisions.
Бесплатно
Controlling Information Flows in Net Services with Low Runtime Overhead
Статья научная
This paper presents the information flow control model NetIFC to prevent information leakage when a net service is being executed. NetIFC offers the following features: (1) it blocks at least statements as possible and (2) it reduces runtime overhead. To achieve the first feature, NetIFC strictly controls output statements because only output may leak information. To achieve the second feature, NetIFC is executed in parallel with a service in different sites to monitor the service. This monitoring style substantially reduce runtime overhead when comparing with embedding a model in a net service.
Бесплатно
Cooperative MAC Protocol based on Best Data Rate (CMAC-DR)
Статья научная
As wireless signals are broadcast in nature, which implies that, a broadcast communication purposive to a predetermined destination may be received by a non-intended intermediate station. Cooperative transference, which employ interposed stations to pass on the eavesdropped data to attain the contrast gains, has a substantial capability to revamp the channeling effectiveness in wireless systems. In this it is evident that having cooperation amid stations in a wireless systems can accomplish higher throughput with enhanced network lifetime. Proffered work bestows a model for medium access layer called Cooperative MAC protocol based on optimal Data Rate (CMAC-DR). In the proffered work, stations with more data rate aid stations having lesser data rate in their communication by redirecting their congestion. In CMAC-DR model, utilizing the conveyance of eavesdropped information, potential helper stations with more data rate Send out Helper Ready To Send (HRTS), the stations with less data rate maintains a table, called Co-op table of potential helper stations, that can aid in its transmissions. During communication, the source station with low data rate chooses either transmitting by the way of a helper station, so that it lowers the end to end transference delay and increases the throughput or opt only direct transmission, if no potential helper is found or if CMAC-DR becomes an overhead. By analyzing varied simulated scenarios, CMAC-DR evaluates the elevation in the overall network lifetime, throughput and minimization of delay. The CMAC-DR protocol is unambiguous and in accordant with legacy 802.11 also when compared to this, we find improved performance in terms of delay throughput and network lifetime since data rate is considered as relay selection condition.
Бесплатно
Статья научная
This paper presents a new technique for copyright protection of images using integer wavelet transform (IWT), singular value decomposition (SVD) and Arnold transform. We divide the cover image into four sub-images by picking alternate pixels from consecutive rows and columns and embed the copyright mark into the sub-image having the largest sum of singular values. The embedding is done by modifying singular values of the IWT coefficients of the selected sub-image. The use of Arnold transform and SVD increases security and robustness against geometric and several signals processing attacks, while IWT provides computational efficiency. We compare the performance of our technique with state-of-the-art-methods. The experimental results show that the proposed technique is more imperceptible and achieves higher security and robustness against various signal processing (filtering, compression, noise addition, histogram equalization and motion blur) and geometrical (cropping, resizing, rotation) attacks.
Бесплатно
Статья научная
In many cases side channel attacks complexity are estimated by considering attack simulations only. Regarding this estimations, parameters of cryptographic devices are set so the attack is infeasible. This work shows that this approach to secure cryptographic equipment can be dangerous because real attacks can be much better than expected according to simulations. This observation is presented on very generic Correlation Power Attack using Hamming Distance Power Model. This attack is aimed against integer multiplier implemented in FPGA. In cryptography, an integer multiplier power consumption can sometimes be exploited to reveal a secret. Very often it is in asymmetric cryptography that is used in PKI as a fundamental building block. As an example, there are DSA and its various derivations.
Бесплатно
