Hao Hu

Hao Hu

Auto-generated profile, based on publicly available information

Hao Hu

Information Engineering University, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 May 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HHHao Hu
Hao Hu
Yuling LiuYuling Liu
Yuling Liu
CCChen Chen
Chen Chen
HZHongqi Zhang
Hongqi Zhang
YLYi Liu
Yi Liu
At present, there are many techniques for cyber security defense such as firewall, intrusion detection and cryptography. Despite decades of studies and experiences on this issue, there still exists a problem that we always pay great attention to technology while overlooking strategy. In the traditional warfare, the level of decision-making and the formulation of optimal strategies have a great effect on the warfare result. Similarly, the timeliness and quality of decision-making in cyber attack-defense also make great significance. Since the attackers and defenders are oppositional, the selection of optimal defense strategy with the maximum payoff is difficult. To solve this problem, the stochastic evolutionary game model is utilized to simulate the dynamic adversary of cyber attack-defense. We add the parameter λ to the Logit Quantal Response Dynamics (LQRD) equation to quantify the cognitive differences of real-world players. By calculating the evolutionary stable equilibrium, the best decision-making approach is proposed, which makes a balance between defense cost and benefit. Cases studies on ransomware indicate that the proposed approach can help the defender predict possible attack action, select the related optimal defense strategy over time, and gain the maximum defense payoff.

27 December 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
Jinglei TanJinglei Tan
Jinglei Tan
HJHui Jin
Hui Jin
HHHao Hu
Hao Hu
RHRuiqin Hu
Ruiqin Hu
HZHongqi Zhang
Hongqi Zhang
HZHengwei Zhang
Hengwei Zhang
The limitations of the professional knowledge and cognitive capabilities of both attackers and defenders mean that moving target attack-defense conflicts are not completely rational, which makes it difficult to select optimal moving target defense strategies difficult for use in real-world attack-defense scenarios. Starting from the imperfect rationality of both attack-defense, we construct a Wright-Fisher process-based moving target defense strategy evolution model called WF-MTD. In our method, we introduce rationality parameters to describe the strategy learning capabilities of both the attacker and the defender. By solving for the evolutionarily stable equilibrium, we develop a method for selecting the optimal defense strategy for moving targets and describe the evolution trajectories of the attack-defense strategies. Our experimental results in our example of a typical network information system show that WF-MTD selects appropriate MTD strategies in different states along different attack paths, with good effectiveness and broad applicability. In addition, compared with no hopping strategy, fixed periodic route hopping strategy, and random periodic route hopping strategy, the route hopping strategy based on WF-MTD increase defense payoffs by 58.7%, 27.6%, and 24.6%, respectively.

29 May 2018 in IEEE Access
Verified
Journal Article
Open access
HHHao Hu
Hao Hu
YLYuling Liu
Yuling Liu
HZHongqi Zhang
Hongqi Zhang
RPRuixuan Pan
Ruixuan Pan
The issue of selecting the optimal defense strategy in the dynamic adversarial network is difficult. To solve this problem, we start from the realistic bounded rationality of both the attacker and the defender. Firstly, we build the Bayesian attack-defense evolutionary game model combining with incomplete information game scenario. Specifically, we convert the uncertainty of the strategy payoffs of attackers and defenders to the uncertainty of their related types. Meanwhile, both the set of player types and the set of game strategies can be expanded to n in our model. Furthermore, we improve the replicator dynamics equation by adding the selecting intensity factor to depict the noise effect. This reflects the randomness of decision-making for players due to their bounded learning capacities. In this way, the static analysis in the traditional game is extended as a dynamic process. On this basis, we summarize the evolutions of different player types with different strategies. Finally, by calculating the evolutionary stable equilibrium, we give the algorithm of selecting optimal defense strategy and depict the evolutionary track of this strategy selected by the defender with time going by. Our method provides decision support for the network proactive defense towards moderate security. Moreover, the dynamic analysis efficiency of defense decision-making is improved and the predicting ability of the defense situation is enhanced. Experimental results verify the scientificity and availability of the proposed model and method.

8 May 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YLYi Liu
Yi Liu
HZHongqi Zhang
Hongqi Zhang
DCDexian Chang
Dexian Chang
HHHao Hu
Hao Hu
Emerging technologies such as network function virtualization (NFV) and software defined networking (SDN) provide a promising way to implement service function chain (SFC), a chain-ordered set of network functions, to support heterogeneous network services through a shared substrate network. A major challenge in this respect is the SFC embedding with respect to constraints of physical resources. Furthermore, for practical purposes, SFC embedding across multiple domains becomes essential. This challenge is referred to as the cross-domain SFC embedding problem, which is intractable due to various reasons, such as the confidentiality of intra-domain information and the domain’s local autonomy. In this paper, we propose GDM, a general distributed method for cross-domain SFC embedding. Besides preserving the privacy and autonomy of domains, GDM guarantees fair competition among domains while balancing loads among domains. It first partitions SFC by utilizing an algorithm that can be instantiated to support different embedding goals. Then it allows domains to embed their assigned segments following their policies. Finally, to improve the capability of the whole substrate network to accommodate more SFCs, it implements domain-level load balancing by migrating the deployed VNFs while avoiding excessive influence on the SFC embedding solution. Evaluation results demonstrate that our method performs better in improving acceptance ratio and optimizing domains’ embedding goals compared to the existing methods, and it has better scalability.

1 January 2017 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
HHHao Hu
Hao Hu
HZHongqi Zhang
Hongqi Zhang
YLYuling Liu
Yuling Liu
YWYongwei Wang
Yongwei Wang
Multistep attack prediction and security situation awareness are two big challenges for network administrators because future is generally unknown. In recent years, many investigations have been made. However, they are not sufficient. To improve the comprehensiveness of prediction, in this paper, we quantitatively convert attack threat into security situation. Actually, two algorithms are proposed, namely, attack prediction algorithm using dynamic Bayesian attack graph and security situation quantification algorithm based on attack prediction. The first algorithm aims to provide more abundant information of future attack behaviors by simulating incremental network penetration. Through timely evaluating the attack capacity of intruder and defense strategies of defender, the likely attack goal, path, and probability and time-cost are predicted dynamically along with the ongoing security events. Furthermore, in combination with the common vulnerability scoring system (CVSS) metric and network assets information, the second algorithm quantifies the concealed attack threat into the surfaced security risk from two levels: host and network. Examples show that our method is feasible and flexible for the attack-defense adversarial network environment, which benefits the administrator to infer the security situation in advance and prerepair the critical compromised hosts to maintain normal network communication.

2 August 2018 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
HHHao Hu
Hao Hu
Yuling LiuYuling Liu
Yuling Liu
HZHongqi Zhang
Hongqi Zhang
YZYuchen Zhang
Yuchen Zhang
Network security metrics allow quantitatively evaluating the overall resilience of networked systems against attacks. From this aim, security metrics are of great importance to the security-related decision-making process of enterprises. In this paper, we employ absorbing Markov chain (AMC) to estimate the network security combining with the technique of big data correlation analysis. Specifically, we construct the model of AMC using a large amount of alert data to describe the scenario of multistep attacks in the real world. In addition, we implement big data correlation analysis to generate the transition probability matrix from alert stream, which defines the probabilities of transferring from one attack action to another according to a given scenario before reaching one of some attack targets. Based on the probability reasoning, two metric algorithms are designed to estimate the attack scenario as well as the attackers, namely, the expected number of visits (ENV) and the expected success probability (ESP). The superiority is that the proposed model and algorithms assist the administrator in building new scenarios, prioritizing alerts, and ranking them.