TECHNIQUE OF OPTIMAL AUDIT PLANNING FOR INFORMATION SECURITY MANAGEMENT SYSTEM

Complication of information security management systems leads to the necessity of improving the scientific and methodological apparatus for these systems auditing. Planning is an important and determining part of information security management systems auditing. Efficiency of audit will be defined by the relation of the reached quality indicators to the spent resources. Thus, there is an important and urgent task of developing methods and techniques for optimization of the audit planning, making it possible to increase its effectiveness. The proposed technique gives the possibility to implement optimal distribution for planning time and material resources on audit stages on the basis of dynamics model for the ISMS quality. Special feature of the proposed approach is the usage of a priori data as well as a posteriori data for the initial audit planning, and also the plan adjustment after each audit event. This gives the possibility to optimize the usage of audit resources in accordance with the selected criteria. Application examples of the technique are given while planning audit information security management system of the organization. The result of computational experiment based on the proposed technique showed that the time (cost) audit costs can be reduced by 10-15% and, consequently, quality assessments obtained through audit resources allocation can be improved with respect to well-known methods of audit planning

GRAPH-BASED POST INCIDENT INTERNAL AUDIT METHOD OF COMPUTER EQUIPMENT

Graph-based post incident internal audit method of computer equipment is proposed. The essence of the proposed solution consists in the establishing of relationships among hard disk damps (image), RAM and network. This method is intended for description of information security incident properties during the internal post incident audit of computer equipment. Hard disk damps receiving and formation process takes place at the first step. It is followed by separation of these damps into the set of components. The set of components includes a large set of attributes that forms the basis for the formation of the graph. Separated data is recorded into the non-relational database management system (NoSQL) that is adapted for graph storage, fast access and processing. Damps linking application method is applied at the final step. The presented method gives the possibility to human expert in information security or computer forensics for more precise, informative internal audit of computer equipment. The proposed method allows reducing the time spent on internal audit of computer equipment, increasing accuracy and informativeness of such audit. The method has a development potential and can be applied along with the other components in the tasks of users’ identification and computer forensics

MOVING PERSON IDENTIFICATION IN VIDEO SURVEILLANCE SYSTEMS

The paper deals with an approach for a moving person identifying in video surveillance systems. The proposed solution consists of two successive stages. Selecting of a moving human from all other moving objects in a video stream takes place at the first stage. Human identification based on facial image takes place at the second stage. Detection of a human’s movement is performed via representation of the original video stream in a form of time series. Mathematical apparatus of a singular spectrum is applied for that purpose. The presence of motion is determined by analyzing the periodic components of time series constructed from color and brightness data of the original components of initial video stream. Identification of a person based on his facial image is done through representation of a facial image via two-dimensional matrix with the subsequent application of immune computing mathematical apparatus. Then the binding energy is calculated which shows similarity between the input facial image and faces stored in the training set. The proposed solution for a problem of a moving person’s identifying gives the opportunity to work with low quality video stream having a high level of noise or compression artifacts after encoding. The advantage of the method is implementation simplicity. Unlike traditional methods of computer vision, the proposed method does not require significant computational burden due to simple numerical operations. This method does not require pre-filtering of video images, therefore its performance speed is significantly increased

INFORMATION SECURITY RISKS OPTIMIZATION IN CLOUDY SERVICES ON THE BASIS OF LINEAR PROGRAMMING

The paper discusses theoretical aspects of secure cloud services creation for information processing of various confidentiality degrees. A new approach to the reasoning of information security composition in distributed computing structures is suggested, presenting the problem of risk assessment as an extreme problem of decisionmaking. Linear programming method application is proved to minimize the risk of information security for given performance security in compliance with the economic balance for the maintenance of security facilities and cost of services. An example is given to illustrate the obtained theoretical results

TRUST AND REPUTATION MODEL DESIGN FOR OBJECTS OF MULTI-AGENT ROBOTICS SYSTEMS WITH DECENTRALIZED CONTROL

The problem of mechanisms design for protection of multi-agent robotics systems from attacks of robots-saboteurs is considered. Functioning analysis of these systems with decentralized control is carried out. The type of the so-called soft attacks using interception of messages, misinformation formation and transmission to group of robots which are also realizing other actions without identified signs of invasion of robots-saboteurs. Analysis of existing information security models of the system based on the trust level computation, calculated in the process of agents’ interaction is carried out. Information security model is offered in which robots-agents produce the trust levels to each other on the basis of situation analysis emerging on a certain step of iterative algorithm with usage of onboard sensor devices. On the basis of calculated trust levels, recognition of “saboteur” objects in the group of legitimate robots-agents is done. For measure of likeness (adjacency) increase for objects from the same category (“saboteur” or “legitimate agent”), calculation algorithm for agents reputation is offered as a measure of public opinion about qualities of this or that agent-subject. Implementation alternatives of the algorithms for detection of saboteurs on the example of the basic algorithm for distribution of purposes in the group of robots are considered

POLICE OFFICE MODEL IMPROVEMENT FOR SECURITY OF SWARM ROBOTIC SYSTEMS

This paper focuses on aspects of information security for group of mobile robotic systems with swarm intellect. The ways for hidden attacks realization by the opposing party on swarm algorithm are discussed. We have fulfilled numerical modeling of potentially destructive information influence on the ant shortest path algorithm. We have demonstrated the consequences of attacks on the ant algorithm with different concentration in a swarm of subversive robots. Approaches are suggested for information security mechanisms in swarm robotic systems, based on the principles of centralized security management for mobile agents. We have developed the method of forming a self-organizing information security management system for robotic agents in swarm groups implementing POM (Police Office Model – a security model based on police offices), to provide information security in multi-agent systems. The method is based on the usage of police station network in the graph nodes, which have functions of identification and authentication of agents, identifying subversive robots by both their formal characteristics and their behavior in the swarm. We have suggested a list of software and hardware components for police stations, consisting of: communication channels between the robots in police office, nodes register, a database of robotic agents, a database of encryption and decryption module. We have suggested the variants of logic for the mechanism of information security in swarm systems with different temporary diagrams of data communication between police stations. We present comparative analysis of implementation of protected swarm systems depending on the functioning logic of police offices, integrated in swarm system. It is shown that the security model saves the ability to operate in noisy environments, when the duration of the interference is comparable to the time necessary for the agent to overcome the path between police stations

Planning of Autonomous Multi-agent Intersection

In this paper, we propose a traffic management system with agents acting on behalf autonomous vehicle at the crossroads. Alternatively to existing solutions based on usage of semiautonomous control systems with the control unit, proposed in this paper algorithm apply the principles of decentralized multi-agent control. Agents during their collaboration generate intersection plan and determinate the optimal order of road intersection for a given criterion based on the exchange of information about them and their environment. The paper contains optimization criteria for possible routes selection and experiments that perform in order to estimate the proposed model. Experiment results show that this model can significantly reduce traffic density compared to the traditional traffic management systems. Moreover, the proposed algorithm efficiency increases with road traffic density. Furthermore, the availability of control unit in the system significantly reduces the negative impact of possible failures and hacker attacks

Planning of Autonomous Multi-agent Intersection

In this paper, we propose a traffic management system with agents acting on behalf autonomous vehicle at the crossroads. Alternatively to existing solutions based on usage of semiautonomous control systems with the control unit, proposed in this paper algorithm apply the principles of decentralized multi-agent control. Agents during their collaboration generate intersection plan and determinate the optimal order of road intersection for a given criterion based on the exchange of information about them and their environment. The paper contains optimization criteria for possible routes selection and experiments that perform in order to estimate the proposed model. Experiment results show that this model can significantly reduce traffic density compared to the traditional traffic management systems. Moreover, the proposed algorithm efficiency increases with road traffic density. Furthermore, the availability of control unit in the system significantly reduces the negative impact of possible failures and hacker attacks