Nowadays, network security defense based on game theory mostly used complete information or static game model. In order to get closer to the actual network and defend actively, we proposed a network attack-defense gam...
详细信息
ISBN:
(纸本)9781785610899
Nowadays, network security defense based on game theory mostly used complete information or static game model. In order to get closer to the actual network and defend actively, we proposed a network attack-defense game model based on signaling game, which was modeled in a dynamic and incomplete way. We improved the attack-defense strategies quantitative method of the completed static game model to meet the needs of the network signaling game model. Moreover, we put forward an active defense strategy selecting algorithm to select optimal defense strategy for different characters of defender. At last, we analyzed and proved the feasibility and validity of the model and method through a network example.
In cloud computing, the resources of service are widely distributed, complex and fickle. The trust relationship between service entities is hard to establish and maintain with high uncertainty. The characteristics of ...
详细信息
ISBN:
(纸本)9781785610899
In cloud computing, the resources of service are widely distributed, complex and fickle. The trust relationship between service entities is hard to establish and maintain with high uncertainty. The characteristics of randomness and fuzziness of services could not be responded by traditional trust evaluation approach comprehensively, a service trust evaluation method based on weighted multi-attribute cloud was proposed. Time decay factor was introduced to reflect the timeliness of trust-and multi-attribute trust cloud was used to refine the evaluation granularity. In order to prevent conspiracy to defraud and malicious attacks, the reliability and weight of recommender were confirmed by similarity of evaluation. The trust rating could be confirmed by cloud similarity calculation, which could provide security decisions for the user's services selection. Simulation results show that this method can improve the success rate of services interaction obviously, and be applied to service trust evaluation under cloud computing environment.
Aiming at the clustering problems in selected features and the shortcomings that fuzzy C- means clustering is sensitive to initial value and easy to fall into local optimum, a new fuzzy subspace clustering algorithm b...
详细信息
ISBN:
(纸本)9781785610899
Aiming at the clustering problems in selected features and the shortcomings that fuzzy C- means clustering is sensitive to initial value and easy to fall into local optimum, a new fuzzy subspace clustering algorithm based on improved firefly algorithms is proposed. Based on fuzzy C-means clustering algorithm, the algorithm uses a method of calculating feature weighting in reliability-based k-means algorithm, and combines with the global search capability of firefly algorithm to search for all the subspace. An objective function is designed to evaluate the clustering results and feature-dimension included in subspace, and it is used to improve the search formula of firefly algorithm. Experimental results show that the proposed algorithm can effectively converge to the global optimal solution, and has good clustering effect and noise immunity.
In order to assess network security threats better, we model the attacker's and defender's behavior based on attackdefense graph from the perspective of both attacker and defender, which lays the foundation of...
详细信息
ISBN:
(纸本)9781785610899
In order to assess network security threats better, we model the attacker's and defender's behavior based on attackdefense graph from the perspective of both attacker and defender, which lays the foundation of the further research for the scientific and precise information security threat assessment. Due to the existing problems of generating traditional attack-defense graph (e.g. explosion of state space, and the large-scale and complex generation of attack-defense graph), we in this paper propose a method for generating attack-defense graph based on state reduction, then we model the behavior of attacker and defender in network security. Finally, the method and the model proposed in this paper are proved to be scientific and effective within a typical network scenario.
The method based on index system is a typical quantitative method for information security risk assessment. But, because of the complexity of the safety-related factors, during the process ofbuilding its index system,...
详细信息
ISBN:
(纸本)9781785610899
The method based on index system is a typical quantitative method for information security risk assessment. But, because of the complexity of the safety-related factors, during the process ofbuilding its index system, it will inevitably produce some irrelevant and redundant indicators index, thereby resulting in the deviation of the assessment results. To solve this problem, this paper proposes a new analysis method named SGCAM (Sobol and Gray relational clustering Comprehensive Analysis Method) based on Sobol based global sensitivity analysis method and gray relational clustering analysis method. Using this method, we can cut irrelevant indicators, merge redundant indicators, and optimize the index system ultimately.
To the active-basis-choice decoy-state quantum-key-distribution systems with detector efficiency mismatch, we present a modified attack strategy, which is based on the faked states attack, with quantum nondemolition m...
详细信息
To the active-basis-choice decoy-state quantum-key-distribution systems with detector efficiency mismatch, we present a modified attack strategy, which is based on the faked states attack, with quantum nondemolition measurement ability to restress the threat of detector efficiency mismatch. Considering that perfect quantum nondemolition measurement ability doesn't exist in real life, we also propose a practical attack strategy using photon number resolving detectors. Theoretical analysis and numerical simulation results show that, without changing the channel, our attack strategies are serious threats to decoy-state quantum-key-distribution systems. The eavesdropper may get some information about the secret key without causing any alarms. Besides, the lower bound of detector efficiency mismatch to run our modified faked states attack successfully with perfect quantum nondemolition measurement ability is also given out, which provides the producers of quantum-key-distribution systems with a reference and can be treated as the approximate secure bound of detector efficiency mismatch in decoy-state quantum-key-distribution systems.
Current intrusion detection systems are mostly for detecting external attacks, but sometimes the internal staff may bring greater harm to organizations in information security. Traditional insider threat detection met...
详细信息
We search for gravitational-wave (GW) transients associated with fast radio bursts (FRBs) detected by the Canadian Hydrogen Intensity Mapping Experiment Fast Radio Burst Project, during the first part of the third obs...
详细信息
Junk code increase manual analysis difficulty in reverse engineering, and seriously disturb the automatic analysis process of ant code obfuscating, so find a junk code removing method has a great significance in the f...
Junk code increase manual analysis difficulty in reverse engineering, and seriously disturb the automatic analysis process of ant code obfuscating, so find a junk code removing method has a great significance in the field of reverse engineering. Based on this, aiming at the problem that the executable context-dependent junk code is difficult to remove automatically, this paper proposes a junk code removing method based on idle register slicing, through analyzing data dependencies between instructions, get all the idle register of all instruction in code block, slice the code block by idle registers respectively, remove all the junk code in the slice instruction. Experiments show that, this method can remove embedded executable junk code rapidly and accurately, improve the efficiency of reverse engineering.
暂无评论