Strategic Attack &amp; Defense in Security Diffusion Games

Waniek, Marcin; Michalak, Tomasz P.; Alshamsi, Aamena

doi:10.1145/3357605

Cited by 6 publications

(4 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Minimum-cost SAT-solvers were used by Huang et al to distill critical parts of attack graphs, which are used for preparing defenses [25]. Other approaches, such as the use of diffusion games [26], have also been proposed for hardening the security of networks. In this work, our focus is on producing real-time security plans using methods to parallelize attack graph analysis and security improvement planning.…”

Section: Related Workmentioning

confidence: 99%

On Parallel Real-Time Security Improvement Using Mixed-Integer Programming

et al. 2021

View full text Add to dashboard Cite

Network security defenses evolve, responding to real-time attack incidents, modifying the underlying topology, or reallocating defense systems across the network. The present work emphasizes reducing the time to compute new optimal reallocations of defense systems, responding to emerging realtime remote attacks. The proposed heuristic method utilizes parallel processing by slicing the underlying graphical model representing the network topology, solving in parallel multiple mixed-integer programming problems corresponding to the created subgraphs, and producing an estimate of the optimal defense. The parallelized method to compute a new defense enables producing a response, in real-time, before remote attackers compromise a target machine in the network. Our prototype tool to compute a new defense, the high-performance security analyzer, has a speedup of at least 20 over solving the original problem using a serial algorithm, and with an insignificant difference between the performance of the (computed in parallel) approximately optimal defense and the (serially computed) optimal defense. A major conclusion is that further speedups will come from parallel integer programming algorithms rather than from graph partitioning.

show abstract

Section: Related Workmentioning

confidence: 99%

On Parallel Real-Time Security Improvement Using Mixed-Integer Programming

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The attacker applied a node capture attack [7,8,9] through confiscating few vertices over WSN to use vertices information maliciously. The information about routing strategies, cipher keys and cipher text are to be utilized spitefully by attacker [10,11,12].…”

Section: Introductionmentioning

confidence: 99%

HHOA_NCA – a Harris Hawk Optimization Algorithm (HHOA) on best possible Node Capture Attack (NCA) in Future WSN for Improving the Security of Ubiquitous Computing Intelligent System

Khare,

Gupta,

Shukla

2023

Preprint

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) is exceedingly predisposed to quite a lot of complex attacks due to confine resource deployment in big network communiqué vicinity. The adversary initiates a node capture attack to future WSN for snatching the private data from ubiquitous computing intelligent system through confiscating vertices (sensor nodes) for cooperating full network. We develop a Harris Hawk Optimization Algorithm for Node Capture Attack (HHOA_NCA) to identify the vertices in ubiquitous computing having higher seizing chance by attack over future network system. HHOA_NCA applies on function sensor node participation with multi objectives such as sensor node key contribution through links, sensor node contribution, sensor node energy cost, distance between sensor nodes and sensor node velocity. Key contribution is the number of keys utilized by vertices. The contribution of sensor nodes is evaluated as the association among all paths and vertices. Sensor node energy cost is obtained on the basis of energy expenditure for packet transmission through vertices over WSN. The distance between two sensor nodes is evaluated using neighbourhood degree. The velocity is measured by the stability time of a sensor node. Simulation is performed in MATLAB 2019a environment and experimental outcomes represent the greater performance of HHOA_NCA based on compromised traffic fraction, power utilization cost, attacking rounds and complexity over future WSN. The results of simulation for ubiquitous computing show that the HHOA_NCA obtains better results than MA, PCA, FGA, MREA, GA, ACO, PSO, FiRAO-PG and FFOA for single and multipath routing based on all performance factors over future network system.

show abstract

“…In real life, players do not necessarily use large-scale policy sets to find the best strategies. The calculation results of the above methods are the best, but the blocker and the spreader are more likely to use representative typical strategies to get effective results quickly [27,34].…”

Section: Introductionmentioning

confidence: 99%

An Adversarial Dynamic Game to Controlling Information Diffusion under Typical Strategies on Online Social Networks

et al. 2022

View full text Add to dashboard Cite

The diffusion of negative information, such as rumours, misinformation and computer viruses on Online Social Networks (OSNs), may lead to serious losses and consequences. And there are always some rational malicious spreaders, who strategically spread negative information. Therefore, how to control the information diffusion of the malicious spreader is a great challenge. In recent years, some studies have analyzed the controlling problem which belongs to the issue of influence blocking maximization (IBM) from the perspective of the large-scale strategy set on the game theory. However, the aforementioned methods cannot timely solve the controlling diffusion problem on high-speed OSNs. In this study, we achieve the purpose of effectively controlling diffusion on OSNs by blocking information under typical strategies. Based on the existing two-player Stackelberg zero-sum game model and evaluation methods of node’s importance on the network, we analyze the typical strategic dynamic game in which the blocker moves first and the spreader moves later on scale-free networks with different power exponent. Experimental results show that the absolute dominance strategy of the blocker is Leader Rank with 90.16% probability. And using Leader Rank can be relatively effective against malicious spreaders with 98.33% probability. When the power exponent of the network is smaller, it is more conducive to blocking information dissemination with fewer seed nodes.

show abstract

Strategic Attack & Defense in Security Diffusion Games

Cited by 6 publications

References 41 publications

On Parallel Real-Time Security Improvement Using Mixed-Integer Programming

On Parallel Real-Time Security Improvement Using Mixed-Integer Programming

HHOA_NCA – a Harris Hawk Optimization Algorithm (HHOA) on best possible Node Capture Attack (NCA) in Future WSN for Improving the Security of Ubiquitous Computing Intelligent System

An Adversarial Dynamic Game to Controlling Information Diffusion under Typical Strategies on Online Social Networks

Contact Info

Product

Resources

About