An attack graph is a data structure representing how an attacker can chain together multiple attacks to expand their influence within a network (often in an attempt to reach some set of goal states). Restricting attack graph size is vital for the execution of high degree polynomial analysis algorithms. However, we find that the most widely-cited and recently-used ‘condition/exploit’ attack grap...

Given the topology of a network, characterized by an undirected graph, we consider the following game situation: a network manager is choosing (as communication infrastructure) a spanning tree of the graph, and an attacker is trying to disrupt the communication tree by attacking one link of the network. Attacking a link has a certain cost for the attacker who also has the option of not attackin...

Attack graph is a well-known representation for computer security vulnerabilities, which captures how malicious activities can lead to a system compromise. A key weakness in the attack graph representation is that it scales poorly, particularly in large domains where the graph needs to enumerate both user and system interactions. One way to address this problem is to translate the attack graph ...

Many data mining tasks rely on graphs to model relational structures among individuals (nodes). Since are often sensitive, there is an urgent need evaluate the privacy risks in graph data. One famous attack against analysis models inversion attack, which aims infer sensitive training dataset and leads great concerns. Despite its success grid-like domains, directly applying attacks non-grid doma...

Success or failure of attacks on high-security systems, such as hacker attacks on sensitive data, depend on various situational conditions, including the timing and success chances of single attack steps, and concurrent countermeasures of the defender. With the existing stateof-the-art modelling tools for attack scenarios, comprehensive considerations of these conditions have not been possible....

We describe the optimal placement of intrusion detection system (IDS) sensors and prioritization of IDS alarms, using attack graph analysis. Our attack graphs predict the various possible ways of penetrating a network to reach critical assets. In particular, automated analysis of network configuration and attacker exploits provides an attack graph showing all possible paths to critical assets. ...

The main objective of the study conducted in this article is to introduce a new algorithm encryption and decryption sensitive message after transforming it into binary message. Our proposed based on particular graph constructed algebraically from quadratic residues. We have exploited Paley an abstract way such bit according other bits by intermidiate neighborhood vertex. strong regularity graph...

The approach to network security analysis is suggested. It is based on simulation of malefactor’s behavior, generating attack graph and calculating different security metrics. The graph represents all possible attack scenarios taking into account network configuration, security policy, malefactor’s location, knowledge level and strategy. The security metrics describe computer network security a...