4 research outputs found

    Π›ΠΎΠ³ΠΈΠΊΠΎ-вСроятностный ΠΏΠΎΠ΄Ρ…ΠΎΠ΄ Π² Π·Π°Π΄Π°Ρ‡Π°Ρ… бСзопасности структурно-слоТных систСм

    Get PDF
    Π‘Ρ‚Π²ΠΎΡ€Π΅Π½ΠΎ Π½ΠΎΠ²Ρƒ Π½Π°ΡƒΠΊΠΎΠ²Ρƒ ΠΊΠΎΠ½Ρ†Π΅ΠΏΡ†Ρ–ΡŽ, Π½ΠΎΠ²Ρ– ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΈ Π°Π½Π°Π»Ρ–Π·Ρƒ Ρ‚Π° управління бСзпСкою структурно-складних систСм (Π‘Π‘Π‘). ΠŸΠΎΠ±ΡƒΠ΄ΠΎΠ²Π°Π½ΠΎ Π»ΠΎΠ³Ρ–ΠΊΠΎ-ймовірнісні ΠΌΠΎΠ΄Π΅Π»Ρ–, Ρ‰ΠΎ Π΄ΠΎΠ·Π²ΠΎΠ»ΡΡŽΡ‚ΡŒ Ρ„ΠΎΡ€ΠΌΠ°Π»Ρ–Π·ΡƒΠ²Π°Ρ‚ΠΈ опис Π·Π°Π΄Π°Ρ‡ Π±Π΅Π·ΠΏΠ΅ΠΊΠΈ Π‘Π‘Π‘ Ρ‚Π° Π·Π°Π±Π΅Π·ΠΏΠ΅Ρ‡ΠΈΡ‚ΠΈ Ρ”Π΄ΠΈΠ½Ρƒ ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΎΠ»ΠΎΠ³Ρ–Ρ‡Π½Ρƒ Π±Π°Π·Ρƒ для Ρ—Ρ… розв’язання. Π—Π°ΠΊΠ»Π°Π΄Π΅Π½ΠΎ Π½Π°ΡƒΠΊΠΎΠ²Ρ– основи для ΠΏΠΎΠ±ΡƒΠ΄ΠΎΠ²ΠΈ Π½ΠΎΠ²ΠΎΠ³ΠΎ класу комплСксних систСм захисту Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–Ρ—. Π—Π°ΠΏΡ€ΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ Π½ΠΎΠ²Ρ– ΠΌΠΎΠ΄Π΅Π»Ρ–, ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΈ Ρ‚Π° Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΈ ΠΊΡ–Π±Π΅Ρ€Π½Π΅Ρ‚ΠΈΡ‡Π½ΠΎΠ³ΠΎ захисту Π½Π° основі Π»ΠΎΠ³Ρ–ΠΊΠΎ-імовірнісного ΠΏΡ–Π΄Ρ…ΠΎΠ΄Ρƒ, які Π·Π°ΡΡ‚ΠΎΡΠΎΠ²ΡƒΡŽΡ‚ΡŒΡΡ для Π²ΠΈΡ€Ρ–ΡˆΠ΅Π½Π½Ρ Π·Π°Π΄Π°Ρ‡ Π°Π½Π°Π»Ρ–Π·Ρƒ захищСності Ρ‚Π° синтСзу Π·Π°Ρ…ΠΈΡ‰Π΅Π½ΠΈΡ… Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–ΠΉΠ½ΠΎ-ΠΊΠΎΠΌΡƒΠ½Ρ–ΠΊΠ°Ρ†Ρ–ΠΉΠ½ΠΈΡ… систСм. ΠŸΠΎΠ±ΡƒΠ΄ΠΎΠ²Π°Π½ΠΎ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΈ (ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»ΡŒΠ½Ρ– Ρ‚Π° ΡΡƒΠ±ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»ΡŒΠ½Ρ–) ΠΏΠ°Ρ€Π°ΠΌΠ΅Ρ‚Ρ€ΠΈΡ‡Π½ΠΎΠ³ΠΎ Ρ‚Π° структурного синтСзу систСм ΠΊΡ–Π±Π΅Ρ€Π½Π΅Ρ‚ΠΈΡ‡Π½ΠΎΠ³ΠΎ захисту Π· використанням ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ–Π² Π½Π΅Π»Ρ–Π½Ρ–ΠΉΠ½ΠΎΠ³ΠΎ програмування, Ρ‚Π΅ΠΎΡ€Ρ–Ρ— прийняття Ρ€Ρ–ΡˆΠ΅Π½ΡŒ Ρ‚Π° Ρ–Π³Ρ€ΠΎΠ²ΠΎΠ³ΠΎ ΠΏΡ–Π΄Ρ…ΠΎΠ΄Ρƒ. Π ΠΎΠ·Ρ€ΠΎΠ±Π»Π΅Π½ΠΎ ΠΎΠΏΡ‚ΠΈΠΌΡ–Π·ΠΎΠ²Π°Π½Ρ– Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΈ Π°ΡƒΡ‚Π΅Π½Ρ‚ΠΈΡ„Ρ–ΠΊΠ°Ρ†Ρ–Ρ— Ρ– Ρ†ΠΈΡ„Ρ€ΠΎΠ²ΠΎΠ³ΠΎ підпису Π² ΠΊΡ€ΠΈΠΏΡ‚ΠΎΠΌΠΎΠ΄ΡƒΠ»Ρ– структурно-складної Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–ΠΉΠ½ΠΎΡ— систСми. Π‘Ρ‚Π²ΠΎΡ€Π΅Π½ΠΎ Π½ΠΎΠ²Ρ– ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΈ Π°Π½Π°Π»Ρ–Π·Ρƒ структури складних систСм, планування СкспСримСнту – тСстування захищСності складної систСми, ΠΎΡ†Ρ–Π½ΡŽΠ²Π°Π½Π½Ρ Ρ‚Π° корСгування Π²ΠΏΠ»ΠΈΠ²Ρƒ людського Ρ„Π°ΠΊΡ‚ΠΎΡ€Ρƒ Π½Π° ΠΉΠΎΠ³ΠΎ Ρ€Π΅Π·ΡƒΠ»ΡŒΡ‚Π°Ρ‚ΠΈ. Π ΠΎΠ·Ρ€ΠΎΠ±Π»Π΅Π½Ρ– ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΈ Ρ‚Π° ΠΌΠΎΠ΄Π΅Π»Ρ– Π±Π΅Π·ΠΏΠ΅ΠΊΠΈ Π‘Π‘Π‘ ΠΏΠΎΠΊΠ»Π°Π΄Π΅Π½ΠΎ Π² основу Π΄Π²ΠΎΡ… Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–ΠΉΠ½ΠΈΡ… Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³Ρ–ΠΉ Ρ‚Π° Π²Ρ–Π΄ΠΏΠΎΠ²Ρ–Π΄Π½ΠΈΡ… комплСксів ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠ½ΠΈΡ… ΠΌΠΎΠ΄ΡƒΠ»Ρ–Π²: «Автоматизованого проСктування Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–ΠΉΠ½ΠΎ-ΠΊΠΎΠΌΡƒΠ½Ρ–ΠΊΠ°Ρ†Ρ–ΠΉΠ½ΠΈΡ… систСм» Ρ‚Π° «БистСма ΠΌΠΎΠ½Ρ–Ρ‚ΠΎΡ€ΠΈΠ½Π³Ρƒ ΡΠΎΡ†Ρ–Π°Π»ΡŒΠ½ΠΈΡ… ΠΌΠ΅Ρ€Π΅ΠΆ NetMonitorΒ». КомплСкс «АвтоматизованС проСктування Ρ–Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†Ρ–ΠΉΠ½ΠΎ-ΠΊΠΎΠΌΡƒΠ½Ρ–ΠΊΠ°Ρ†Ρ–ΠΉΠ½ΠΈΡ… систСм» - Ρƒ стадії ΠΌΠ°ΠΊΠ΅Ρ‚Π½ΠΈΡ… ΠΏΡ€ΠΎΠΏΠΎΠ·ΠΈΡ†Ρ–ΠΉ. Π”Ρ€ΡƒΠ³ΠΈΠΉ комплСкс - БистСма Β«NetMonitorΒ», Π±ΡƒΠ»ΠΎ ΠΊΠΎΠΌΠ΅Ρ€Ρ†Ρ–Π°Π»Ρ–Π·ΠΎΠ²Π°Π½ΠΎ (Π½Π° конкурсній основі Π²ΠΈΠ³Ρ€Π°Π½ΠΎ Ρ–Π½Π²Π΅ΡΡ‚ΠΈΡ†Ρ–ΡŽ обсягом 1 ΠΌΠ»Π½.Π³Ρ€Π½.)Created new science concept, new methods of analysis and control in the field of security of complex systems. Constructed new logical-probabilistic models allows to formalize the description of complex systems security problems and ensure a unified methodological framework for its solution. Created new scientific approaches for constructing a new class of complex information security systems. The new models, methods and algorithms of cyber security based on logical and probabilistic approach were proposed and used for solving security analysis and synthesis of protected information and communication systems. Created algorithms (optimal and suboptimal) of parametric and structural synthesis of cyber security with using methods of nonlinear programming, decision theory and game approach. Developed optimized algorithms of authentication and digital signature in complex information system. Created new methods of analyzing the structure of complex systems, design of experiment - testing complex system of protection, evaluating and correcting human factor influence on the results. Prepared improved sample of basic software system for automated design and safety assessment of complex systems. Examples of the developed models, methods and algorithms in practice, cyber security.Π‘ΠΎΠ·Π΄Π°Π½Π° новая научная концСпция, Π½ΠΎΠ²Ρ‹Π΅ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹ Π°Π½Π°Π»ΠΈΠ·Π° ΠΈ управлСния Π±Π΅Π·ΠΎΠΏΠ°ΡΠ½ΠΎΡΡ‚ΡŒΡŽ структурно-слоТных систСм (Π‘Π‘Π‘). ΠŸΠΎΡΡ‚Ρ€ΠΎΠ΅Π½Ρ‹ Π»ΠΎΠ³ΠΈΠΊΠΎ-вСроятностныС ΠΌΠΎΠ΄Π΅Π»ΠΈ, ΠΏΠΎΠ·Π²ΠΎΠ»ΡΡŽΡ‰ΠΈΠ΅ Ρ„ΠΎΡ€ΠΌΠ°Π»ΠΈΠ·ΠΎΠ²Π°Ρ‚ΡŒ описаниС Π·Π°Π΄Π°Ρ‡ бСзопасности Π‘Π‘Π‘ ΠΈ ΠΎΠ±Π΅ΡΠΏΠ΅Ρ‡ΠΈΡ‚ΡŒ Π΅Π΄ΠΈΠ½ΡƒΡŽ ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΎΠ»ΠΎΠ³ΠΈΡ‡Π΅ΡΠΊΡƒΡŽ Π±Π°Π·Ρƒ для ΠΈΡ… Ρ€Π΅ΡˆΠ΅Π½ΠΈΡ. Π—Π°Π»ΠΎΠΆΠ΅Π½Ρ‹ Π½Π°ΡƒΡ‡Π½Ρ‹Π΅ основы для построСния Π½ΠΎΠ²ΠΎΠ³ΠΎ класса комплСксных систСм Π·Π°Ρ‰ΠΈΡ‚Ρ‹ ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΈ. ΠŸΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ‹ Π½ΠΎΠ²Ρ‹Π΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ, ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹ ΠΈ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΡ‹ кибСрнСтичСской Π·Π°Ρ‰ΠΈΡ‚Ρ‹ Π½Π° основС Π»ΠΎΠ³ΠΈΠΊΠΎ-вСроятностного ΠΏΠΎΠ΄Ρ…ΠΎΠ΄Π°, ΠΊΠΎΡ‚ΠΎΡ€Ρ‹Π΅ ΠΏΡ€ΠΈΠΌΠ΅Π½ΡΡŽΡ‚ΡΡ для Ρ€Π΅ΡˆΠ΅Π½ΠΈΡ Π·Π°Π΄Π°Ρ‡ Π°Π½Π°Π»ΠΈΠ·Π° защищСнности ΠΈ синтСза Π·Π°Ρ‰ΠΈΡ‰Π΅Π½Π½Ρ‹Ρ… ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎ-ΠΊΠΎΠΌΠΌΡƒΠ½ΠΈΠΊΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… систСм. ΠŸΠΎΡΡ‚Ρ€ΠΎΠ΅Π½Ρ‹ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΡ‹ (ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»ΡŒΠ½Ρ‹Π΅ ΠΈ ΡΡƒΠ±ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»ΡŒΠ½Ρ‹Π΅) парамСтричСского ΠΈ структурного синтСза систСм кибСрнСтичСской Π·Π°Ρ‰ΠΈΡ‚Ρ‹ с использованиСм ΠΌΠ΅Ρ‚ΠΎΠ΄ΠΎΠ² Π½Π΅Π»ΠΈΠ½Π΅ΠΉΠ½ΠΎΠ³ΠΎ программирования, Ρ‚Π΅ΠΎΡ€ΠΈΠΈ принятия Ρ€Π΅ΡˆΠ΅Π½ΠΈΠΉ ΠΈ ΠΈΠ³Ρ€ΠΎΠ²ΠΎΠ³ΠΎ ΠΏΠΎΠ΄Ρ…ΠΎΠ΄Π°. Π Π°Π·Ρ€Π°Π±ΠΎΡ‚Π°Π½Ρ‹ ΠΎΠΏΡ‚ΠΈΠΌΠΈΠ·ΠΈΡ€ΠΎΠ²Π°Π½Π½Ρ‹Π΅ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΡ‹ Π°ΡƒΡ‚Π΅Π½Ρ‚ΠΈΡ„ΠΈΠΊΠ°Ρ†ΠΈΠΈ ΠΈ Ρ†ΠΈΡ„Ρ€ΠΎΠ²ΠΎΠΉ подписи Π² ΠΊΡ€ΠΈΠΏΡ‚ΠΎΠΌΠΎΠ΄ΡƒΠ»Π΅ структурно-слоТной ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎΠΉ систСмы. Π‘ΠΎΠ·Π΄Π°Π½Ρ‹ Π½ΠΎΠ²Ρ‹Π΅ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹ Π°Π½Π°Π»ΠΈΠ·Π° структуры слоТных систСм, ΠΏΠ»Π°Π½ΠΈΡ€ΠΎΠ²Π°Π½ΠΈΠ΅ экспСримСнта - тСстированиС защищСнности слоТной систСмы, ΠΎΡ†Π΅Π½ΠΊΠΈ ΠΈ ΠΊΠΎΡ€Ρ€Π΅ΠΊΡ‚ΠΈΡ€ΠΎΠ²ΠΊΠΈ влияния чСловСчСского Ρ„Π°ΠΊΡ‚ΠΎΡ€Π° Π½Π° Π΅Π³ΠΎ Ρ€Π΅Π·ΡƒΠ»ΡŒΡ‚Π°Ρ‚Ρ‹. Π Π°Π·Ρ€Π°Π±ΠΎΡ‚Π°Π½Π½Ρ‹Π΅ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹ ΠΈ ΠΌΠΎΠ΄Π΅Π»ΠΈ бСзопасности Π‘Π‘Π‘ ΠΏΠΎΠ»ΠΎΠΆΠ΅Π½ΠΎ Π² основу Π΄Π²ΡƒΡ… ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ ΠΈ ΡΠΎΠΎΡ‚Π²Π΅Ρ‚ΡΡ‚Π²ΡƒΡŽΡ‰ΠΈΡ… комплСксов ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠΌΠ½Ρ‹Ρ… ΠΌΠΎΠ΄ΡƒΠ»Π΅ΠΉ: «Автоматизированного проСктирования ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎ-ΠΊΠΎΠΌΠΌΡƒΠ½ΠΈΠΊΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… систСм» ΠΈ «БистСма ΠΌΠΎΠ½ΠΈΡ‚ΠΎΡ€ΠΈΠ½Π³Π° ΡΠΎΡ†ΠΈΠ°Π»ΡŒΠ½Ρ‹Ρ… сСтСй NetMonitorΒ». КомплСкс «АвтоматизированноС ΠΏΡ€ΠΎΠ΅ΠΊΡ‚ΠΈΡ€ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎ-ΠΊΠΎΠΌΠΌΡƒΠ½ΠΈΠΊΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… систСм» - Π² стадии ΠΌΠ°ΠΊΠ΅Ρ‚Π½Ρ‹Ρ… ΠΏΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΈΠΉ. Π’Ρ‚ΠΎΡ€ΠΎΠΉ комплСкс - систСма Β«NetMonitorΒ», Π±Ρ‹Π»ΠΎ ΠΊΠΎΠΌΠΌΠ΅Ρ€Ρ†ΠΈΠ°Π»ΠΈΠ·ΠΈΡ€ΠΎΠ²Π°Π½ΠΎ (Π½Π° конкурсной основС выгорания инвСстиции объСмом 1 ΠΌΠ»Π½.Π³Ρ€Π½.

    A Utility-Based Reputation Model for Grid Resource Management System

    Get PDF
    In this paper we propose extensions to the existing utility-based reputation model for virtual organizations (VOs) in grids, and present a novel approach for integrating reputation into grid resource management system. The proposed extensions include: incorporation of statistical model of user behaviour (SMUB) to assess user reputation; a new approach for assigning initial reputation to a new entity in a VO; capturing alliance between consumer and resource; time decay and score functions. The addition of the SMUB model provides robustness and dynamics to the user reputation model comparing to the policy-based user reputation model in terms of adapting to user actions. We consider a problem of integrating reputation into grid scheduler as a multi-criteria optimization problem. A non-linear trade-off scheme is applied to form a composition of partial criteria to provide a single objective function. The advantage of using such a scheme is that it provides a Pareto-optimal solution partially satisfying criteria with corresponding weights. Experiments were run to evaluate performance of the model in terms of resource management using data collected within the EGEE Grid-Observatory project. Results of simulations showed that on average a 45 % gain in performance can be achieved when using a reputation-based resource scheduling algorithm

    Reputation Revision Method for Selecting Cloud Services Based on Prior Knowledge and a Market Mechanism

    Get PDF
    The trust levels of cloud services should be evaluated to ensure their reliability. The effectiveness of these evaluations has major effects on user satisfaction, which is increasingly important. However, it is difficult to provide objective evaluations in open and dynamic environments because of the possibilities of malicious evaluations, individual preferences, and intentional praise. In this study, we propose a novel unfair rating filtering method for a reputation revision system. This method uses prior knowledge as the basis of similarity when calculating the average rating, which facilitates the recognition and filtering of unfair ratings. In addition, the overall performance is increased by a market mechanism that allows users and service providers to adjust their choice of services and service configuration in a timely manner. The experimental results showed that this method filtered unfair ratings in an effective manner, which greatly improved the precision of the reputation revision system
    corecore