1 / 76

Resource Distribution in Multiple Attacks Against a Single Target

Resource Distribution in Multiple Attacks Against a Single Target. Author: Gregory Levitin ,Kjell Hausken Risk Analysis, Vol. 30, No. 8, 2010. Agenda. Introduction & Background Problem Description (Goal) The model Assumption Target vulnerability(V) Expenditure(E) Resource Distribution

forbes
Download Presentation

Resource Distribution in Multiple Attacks Against a Single Target

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Resource Distribution in Multiple Attacks Against a Single Target Author: Gregory Levitin,KjellHausken Risk Analysis, Vol. 30, No. 8, 2010

  2. Agenda • Introduction & Background • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  3. Introduction & Background • It has been common to consider a nonstrategic attacker , either by assuming a fixed attack or a fixed attack probability. • Bier et al. (1) assume that a defender allocates defense to a collection of locations while an attacker chooses a location to attack.

  4. Introduction & Background • In this article, we consider a target(object) that a defender seeks to protect and an attacker seeks to destroy through multiple sequential attacks. • The defender tries to keep the object undestroyed in each attack launched by the attacker.The phenomenon is modeled as a contest between a defender and an attacker.

  5. Introduction & Background • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  6. Problem Description • Basic definitions: • Vulnerability:Probability of target destruction by the attacker. • Effort:Amount of intentional force aimed at destruction or protection of a system element (in this article, it is measured as the amount of attacker’s resource allocated to each attack and amount of defender’s resource allocated to defense)

  7. Problem Description • 1. Whether the attacker should allocate its entire resource into one large attack or distribute it among several attacks.

  8. Problem Description • 1. Whether the attacker should allocate its entire resource into one large attack or distribute it among several attacks. One large attack Attack strategy Several attacks

  9. Problem Description

  10. Problem Description One large attack Attack strategy Even Resource Distribution Several attacks Geometric Resource Distribution

  11. Problem Description • 2.Whether geometrically increasing or decreasing resource distribution into a fixed number of sequential attacks is more beneficial than equal resource distribution One large attack Attack strategy Even Resource Distribution Several attacks Geometrically increasing Geometric Resource Distribution Geometrically decreasing

  12. Problem Description • 3.How the optimal attack strategy depends on the contest intensity(m). • Two objectives: • 1.To maximize the target vulnerability(V). • 2.To minimize the expected attacker resource expenditure(E).

  13. Problem Description • 3.How the optimal attack strategy depends on the contest intensity(m). Optimal attack straregy One large attack Attack strategy Even Resource Distribution Several attacks Geometrically increasing Geometric Resource Distribution Geometrically decreasing

  14. Introduction • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  15. The model- Assumption • Assumption: • (1) We consider a target (single target) that a defender seeks to protect and an attacker seeks to destroy through multiple sequential attacks. • (2)Both the defender and the attacker have limited resources. • (3)The attacker can observe the outcome of each attack and stop the sequence of attacks when the target is destroyed. • (4)The attacker distributes its resource over time.

  16. The model- Assumption • Assumption: • (5)We model the common case that the protection is static and cannot be changed over time. • Target is destroyed->The protection is destroyed. • Target is not destroyed->the protection remains in place also for the subsequent attack. • (6) We assume that the defender uses the same protection during the series of K attacks and allocates its entire resource into this protection.

  17. Introduction & Background • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  18. Target vulnerability(V) • For any single attack, the vulnerability of a target is determined by a contest between the defender exerting effort t and the attacker exerting effort T in this attack. ->Contest success function

  19. Target vulnerability(V) • Contest success function T :Attacker’s effort to attack a target. t :Defender’s effort to protect a target. m: Attacker-defender contest intensity. :The attack success probability.

  20. Target vulnerability(V) • Contest success function • Two factors influence the : • 1.The relation between the resources(t/T) in each attack. • 2.Contest intensity m .

  21. Target vulnerability(V) • 1.The relation between the resources(t/T) in each attack. • If the attacker exerts high effort(T>t), it is likely to win the contest that gives high vulnerability. • If the defender exerts high effort(T<t), it is likely to win the contest that gives low vulnerability.

  22. Target vulnerability(V) • 2.Contest intensity m : Measures whether the agents’ efforts have low or high impact on the target vulnerability

  23. Target vulnerability(V) • According to assumption (6), We assume that the defender uses the same protection during the series of K attacks and allocates its entire resource into this protection: t=r • NOMENCLATURE t :Defender’s effort to protect a target r :Defender’s resource

  24. Target vulnerability(V) • On the contrary, the attacker distributes its entire resource R among K attacks such that the resource allocated to attack • NOMENCLATURE R :Attacker’s resource :Attacker’s effort (resource used) in the th attack K :Number of consecutive attacks

  25. Target vulnerability(V) • The success probability of the th attack according to Contest success function is: • The probability that the target survives in th attacks is:

  26. Target vulnerability(V) • The probability that the target survives all K attacks is: • Thus, the target vulnerability in K attacks is:

  27. Expenditure(E) • According to assumption (3), The attacker can observe the outcome of each attack and stop the sequence of attacks when the target is destroyed. • If the target is destroyed in the attack, the attacker spends the resource:

  28. Expenditure(E) • NOMENCLATURE T : attacker’s effort (resource used) in the attack(for even resource distribution T ≡ T) • If the probability that the target is destroyed in the th attack is ,the expected attacker’s resource expenditure can be obtained as:

  29. Expenditure(E) If the target is destroyed in the th attack , the resource attacker spends .

  30. Expenditure(E) The expected attacker’s resource expenditure when target is destroyed .

  31. Expenditure(E) The probability that the target survives all K attacks.

  32. Expenditure(E) The expected attacker’s resource expenditure when after K attacks the attacker fails to destroy the target.

  33. Expenditure(E) • The expected attacker’s resource expenditure can be obtained as: • We will present the expected resource expenditure as a fraction of the total of attacker’s resource(R):

  34. Introduction & Background • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  35. Even Resource Distribution-V • The attacker can choose the number of attacks K and distribute its resource evenly among the attacks such that T = R/K and the probability of target destruction in any attack is: =K/R *r = 1/T *r=r/T

  36. Even Resource Distribution-V • The target vulnerability is: Even resource distribution ->1- are equal in all K attacks,so

  37. Even Resource Distribution-V • Parameter values exist where the derivative in Equation (6) is negative, but it is often positive.

  38. Even Resource Distribution-V • Example: • Negative: (m = 2, R = r)

  39. Even Resource Distribution-V • Example: • Positive: (m = 0 ; m=1,R=r )

  40. Even Resource Distribution-V • m = 0 ,V increases concavely from 0 to 1 as a function of K and the attacker benefits from unlimitedly increasing the number of attacks. • In realistic situations, the number of attacks is limited by time constraints by limited minimal cost of a single attack, etc. Therefore, the upper limit of K always exists.

  41. Even Resource Distribution-V • Fig. 1 presents the target vulnerability as a function of the contest intensity m for different K and r/R.

  42. Even Resource Distribution-V • It can be seen that the smaller the contest intensity(m), the more beneficial it is to increase the number of attacks.

  43. Even Resource Distribution-E • If the target is destroyed in the th attack, the probability of this event is: The probability that the target survives in all -1 attacks. The probability that the target is destroyed.

  44. Even Resource Distribution-E • The attacker spends the resource T =R/K* . * T

  45. Even Resource Distribution-E R/T* * R/K* * R

  46. Even Resource Distribution-E • Fig. 2 presents the expected attacker’s resource expenditure as a function of the contest intensity m for different r/R.

  47. Introduction & Background • Problem Description (Goal) • The model • Assumption • Target vulnerability(V) • Expenditure(E) • Resource Distribution • Even Resource Distribution(V,E) • Geometric Resource Distribution(V,E) • Numerical simulations • Conclusion

  48. Geometric Resource Distribution-V • Now we assume that the attacker can change the amount of resources allocated to each of the K attacks. • To model the resource distribution, we use the geometric progression since it is simple and flexible.

  49. Geometric Resource Distribution-V • Assume that the attacker allocates effort to the first attack and changes the effort according to the geometric progression.

  50. Geometric Resource Distribution-V • The parameter q(Attack effort variation factor) determines the strategy of effort variation through the K sequential attacks:

More Related