19,310 research outputs found
Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary's Characteristics
In this paper we investigate the problem of designing a spectrum scanning
strategy to detect an intelligent Invader who wants to utilize spectrum
undetected for his/her unapproved purposes. To deal with this problem we model
the situation as two games, between a Scanner and an Invader, and solve them
sequentially. The first game is formulated to design the optimal (in maxmin
sense) scanning algorithm, while the second one allows one to find the optimal
values of the parameters for the algorithm depending on parameters of the
network. These games provide solutions for two dilemmas that the rivals face.
The Invader's dilemma consists of the following: the more bandwidth the Invader
attempts to use leads to a larger payoff if he is not detected, but at the same
time also increases the probability of being detected and thus fined.
Similarly, the Scanner faces a dilemma: the wider the bandwidth scanned, the
higher the probability of detecting the Invader, but at the expense of
increasing the cost of building the scanning system. The equilibrium strategies
are found explicitly and reveal interesting properties. In particular, we have
found a discontinuous dependence of the equilibrium strategies on the network
parameters, fine and the type of the Invader's award. This discontinuity of the
fine means that the network provider has to take into account a human/social
factor since some threshold values of fine could be very sensible for the
Invader, while in other situations simply increasing the fine has minimal
deterrence impact. Also we show how incomplete information about the Invader's
technical characteristics and reward (e.g. motivated by using different type of
application, say, video-streaming or downloading files) can be incorporated
into scanning strategy to increase its efficiency.Comment: This is the last draft version of the paper. Revised version of the
paper was published in EAI Endorsed Transactions on Mobile Communications and
Applications, Vol. 14, Issue 5, 2014, doi=10.4108/mca.2.5.e6. arXiv admin
note: substantial text overlap with arXiv:1310.724
Game Theory Meets Network Security: A Tutorial at ACM CCS
The increasingly pervasive connectivity of today's information systems brings
up new challenges to security. Traditional security has accomplished a long way
toward protecting well-defined goals such as confidentiality, integrity,
availability, and authenticity. However, with the growing sophistication of the
attacks and the complexity of the system, the protection using traditional
methods could be cost-prohibitive. A new perspective and a new theoretical
foundation are needed to understand security from a strategic and
decision-making perspective. Game theory provides a natural framework to
capture the adversarial and defensive interactions between an attacker and a
defender. It provides a quantitative assessment of security, prediction of
security outcomes, and a mechanism design tool that can enable
security-by-design and reverse the attacker's advantage. This tutorial provides
an overview of diverse methodologies from game theory that includes games of
incomplete information, dynamic games, mechanism design theory to offer a
modern theoretic underpinning of a science of cybersecurity. The tutorial will
also discuss open problems and research challenges that the CCS community can
address and contribute with an objective to build a multidisciplinary bridge
between cybersecurity, economics, game and decision theory
- …