Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Dynamic Games for Network SecurityDynamic Security Games with Extra Information

Dynamic Games for Network Security: Dynamic Security Games with Extra Information [In the previous chapter, we have reviewed existing applications of SG in addressing different dynamic security problems. Nonetheless, most existing works assume equal knowledgeable defender and attacker, whereas, in practice, the defender and the attacker are likely to hold different information about the ongoing security rivalries. Conventional SG based methods developed in existing literature do not fit well to such dynamic security games with information asymmetry. To achieve the best possible defense in such scenarios, new techniques that can adequately manage the information asymmetry are needed. In this chapter, we will focus on scenarios where the defender has extra information and present two novel algorithms, termed minimax-PDS and WoLF-PDS, to solve the corresponding dynamic security games with extra information. After establishing the theoretical basis, we will provide two exemplary applications to illustrate how these two new algorithms can be leveraged to handle dynamic security games with extra information. The first application is concerned with anti-jamming and the second application is concerned with a cloud-based security game.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Dynamic Games for Network SecurityDynamic Security Games with Extra Information

Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/dynamic-games-for-network-security-dynamic-security-games-with-extra-upj2hoIU0S
Publisher
Springer International Publishing
Copyright
© The Author(s) 2018
ISBN
978-3-319-75870-1
Pages
25 –42
DOI
10.1007/978-3-319-75871-8_3
Publisher site
See Chapter on Publisher Site

Abstract

[In the previous chapter, we have reviewed existing applications of SG in addressing different dynamic security problems. Nonetheless, most existing works assume equal knowledgeable defender and attacker, whereas, in practice, the defender and the attacker are likely to hold different information about the ongoing security rivalries. Conventional SG based methods developed in existing literature do not fit well to such dynamic security games with information asymmetry. To achieve the best possible defense in such scenarios, new techniques that can adequately manage the information asymmetry are needed. In this chapter, we will focus on scenarios where the defender has extra information and present two novel algorithms, termed minimax-PDS and WoLF-PDS, to solve the corresponding dynamic security games with extra information. After establishing the theoretical basis, we will provide two exemplary applications to illustrate how these two new algorithms can be leveraged to handle dynamic security games with extra information. The first application is concerned with anti-jamming and the second application is concerned with a cloud-based security game.]

Published: Mar 1, 2018

Keywords: Security Game; Dynamic Security; Extra Information; Relative Performance Gain; Timeslot

There are no references for this article.