This paper investigates infinite horizon repeated security games with one defender and multiple attacker types.The incomplete information brings uncertainty of attackers’behaviour for the defender.Under the uncertain...This paper investigates infinite horizon repeated security games with one defender and multiple attacker types.The incomplete information brings uncertainty of attackers’behaviour for the defender.Under the uncertainty of attackers’behaviours,we take the worst-case analysis to minimise the defender’s regret w.r.t.each attacker type.We wish to keep the regret especially small w.r.t.one attacker type,at the cost of modest additional overhead compared to others.The tradeoff among the objectives requires us to build a Multi-Objective Repeated SecurityGame(MORSG)model.To parameterise the regret Pareto frontier,we combine the different weight vectors with different objectives and build a linear programming approach.By running the Q-iteration procedure on linear programming for each weight vector,the optimal regret Pareto frontier can be computed.We also propose an approximate approach to approximate it.The approximation analysis proves the effectiveness of the approximation approach.展开更多
We introduce a general multi-defender Stackelberg security game where multiple independent defenders jointly protect a same set of targets from being attacked by a common attacker.In the game,Strong Stackelberg Equili...We introduce a general multi-defender Stackelberg security game where multiple independent defenders jointly protect a same set of targets from being attacked by a common attacker.In the game,Strong Stackelberg Equilibrium is fundamentally problematic,because the notion of‘break-ing ties in defender’s favour’is no longer well defined,as we must specify which defender will receive the favour.To address this issue,we define a new equilibrium concept under a newly defined tie-breaking rule.We characterise Logit Stackelberg Multi-Defender Equilibrium,corre-sponding to a logit tie-breaking rule,as well as an equivalent Nash Equilibrium among defenders,and exhibit algorithms for computing the equilibrium solutions.We find that Logit Stackelberg Multi-Defender Equilibrium and its’equivalent Nash Equilibrium may not exist,which motivates us to find an approximate equilibrium.We design a revised exclusion algorithm to find the approximateε-Nash Equilibrium in which no defender gains more thanεby deviating.展开更多
Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertain...Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertainty causing issues to licensed users,business models for licensed service providers.Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum,offer improved coverage and capacity of networks,enhance network security and reduce energy consumption.With wireless virtualization,wireless networks'physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations(MVNOs).Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers(WIPs),virtualized wireless networks are vulnerable to a multitude of attacks,including jamming attacks and eavesdropping attacks.This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users,and eavesdroppers aim to reduce secrecy rates.Specifically,we consider a virtual wireless network where MVNO users'job is to improve their Signal to Interference plus Noise Ratio(SINR)while the jammers target to collectively enhance their Jammer Received Signal Strength(JRSS),and an eavesdropper's goal is to reduce the overall secrecy rate.Numerical results have demonstrated that the proposed game strategies are effective(in terms of data rate,secrecy rate and latency)against such attackers compared to the traditional approaches.展开更多
With a formidable antiterrorism team, Beijing's top cops are ready to deal with any security incidents that might take place during the 2008 Olympics. This assurance was given by Lu Shimin, Deputy Director General...With a formidable antiterrorism team, Beijing's top cops are ready to deal with any security incidents that might take place during the 2008 Olympics. This assurance was given by Lu Shimin, Deputy Director General of the Beijing Public Security Bureau, at a展开更多
基金The paper is supported by theNationalNatural Science Foundation of China[grant nos 61572095,61877007].
文摘This paper investigates infinite horizon repeated security games with one defender and multiple attacker types.The incomplete information brings uncertainty of attackers’behaviour for the defender.Under the uncertainty of attackers’behaviours,we take the worst-case analysis to minimise the defender’s regret w.r.t.each attacker type.We wish to keep the regret especially small w.r.t.one attacker type,at the cost of modest additional overhead compared to others.The tradeoff among the objectives requires us to build a Multi-Objective Repeated SecurityGame(MORSG)model.To parameterise the regret Pareto frontier,we combine the different weight vectors with different objectives and build a linear programming approach.By running the Q-iteration procedure on linear programming for each weight vector,the optimal regret Pareto frontier can be computed.We also propose an approximate approach to approximate it.The approximation analysis proves the effectiveness of the approximation approach.
基金supported by the National Natural Science Foun-dation of China[grant numbers 61572095,61877007]Department of Science and Technology of Shanxi Province[grant numbers 20210302124303,202203021222251].
文摘We introduce a general multi-defender Stackelberg security game where multiple independent defenders jointly protect a same set of targets from being attacked by a common attacker.In the game,Strong Stackelberg Equilibrium is fundamentally problematic,because the notion of‘break-ing ties in defender’s favour’is no longer well defined,as we must specify which defender will receive the favour.To address this issue,we define a new equilibrium concept under a newly defined tie-breaking rule.We characterise Logit Stackelberg Multi-Defender Equilibrium,corre-sponding to a logit tie-breaking rule,as well as an equivalent Nash Equilibrium among defenders,and exhibit algorithms for computing the equilibrium solutions.We find that Logit Stackelberg Multi-Defender Equilibrium and its’equivalent Nash Equilibrium may not exist,which motivates us to find an approximate equilibrium.We design a revised exclusion algorithm to find the approximateε-Nash Equilibrium in which no defender gains more thanεby deviating.
基金This work was supported in part by the US NSF under grants CNS 1650831 and HRD 1828811by the U.S.Department of Homeland Security under grant DHS 2017-ST-062-000003by the DoE's National Nuclear Security Administration(NNSA)Award#DE-NA0003946.
文摘Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertainty causing issues to licensed users,business models for licensed service providers.Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum,offer improved coverage and capacity of networks,enhance network security and reduce energy consumption.With wireless virtualization,wireless networks'physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations(MVNOs).Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers(WIPs),virtualized wireless networks are vulnerable to a multitude of attacks,including jamming attacks and eavesdropping attacks.This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users,and eavesdroppers aim to reduce secrecy rates.Specifically,we consider a virtual wireless network where MVNO users'job is to improve their Signal to Interference plus Noise Ratio(SINR)while the jammers target to collectively enhance their Jammer Received Signal Strength(JRSS),and an eavesdropper's goal is to reduce the overall secrecy rate.Numerical results have demonstrated that the proposed game strategies are effective(in terms of data rate,secrecy rate and latency)against such attackers compared to the traditional approaches.
文摘With a formidable antiterrorism team, Beijing's top cops are ready to deal with any security incidents that might take place during the 2008 Olympics. This assurance was given by Lu Shimin, Deputy Director General of the Beijing Public Security Bureau, at a
