9 January 2020 in IEEE Access
Moving target defense (MTD) has recently emerged as a game-changer in the confrontation between cyberattack and defense. MTD mechanism constantly and randomly changes the system configurations to create uncertainty of the attack surface against cyber-adversaries. To date, researches on the evaluation of MTD techniques either focused on analyzing the effectiveness of MTD or studying the system performance loss due to the use of MTD. The impact on job/service running on the protected system is always ignored. In this paper, we propose an SRN (Stochastic reward net) based analytical modeling approach to investigate how MTD techniques influence the job running on protected system from the perspective of job finish time. The SRN model developed in this paper captures the behaviors of both the adversary and the job execution process. Furthermore, we carry out numerical analysis to study the impact of different system parameters on job finish time and other evaluation metrics. The results in this paper can help defenders choose a better MTD configuration to complete the job execution as soon as possible.
7 May 2020 in IEEE Access
The fifth generation (5G) technology offers a set of security services in order to provide secure communication to a large number of various devices. 5G Authentication and Key Agreement (5G-AKA) authentication service acts as the first step of securing the 5G network communication. This paper aims to quantitatively analyze the dependability of 5G-AKA authentication service. We develop the continuous-time Markov chain (CTMC) models to capture the operational details of the 5G-AKA authentication services when facing the service failure. We also derive formulas for calculating metrics of interest, including Defects Per Million (DPM), authentication service’s first restoration time from failure and total cost of ownership (TCO). Extensive numerical analysis is applied to investigate the impact of parameters on the evaluation metrics.
30 January 2024 in IEEE Internet of Things Journal
Recently, big data has seen explosive growth in the Internet of Things (IoT). Multi-layer FL (MFL) based on cloud-edge-end architecture can promote model training efficiency and model accuracy while preserving IoT data privacy. This paper considers an improved MFL, where edge layer devices own private data and can join the training process. iMFL can improve edge resource utilization and also alleviate the strict requirement of end devices, but suffers from the issues of Data Reconstruction Attack (DRA) and unacceptable communication overhead. This paper aims to address these issues with iMFL. We propose a Privacy Amplification scheme on iMFL (PA-iMFL). Differing from standard MFL, we design privacy operations in end and edge devices after local training, including three sequential components, local differential privacy with Laplace mechanism, privacy amplification subsample, and gradient sign reset. Benefitting from privacy operations, PA-iMFL reduces communication overhead and achieves privacy-preserving. Extensive results demonstrate that against State-Of-The-Art (SOTA) DRAs, PA-iMFL can effectively mitigate private data leakage and reach the same level of protection capability as the SOTA defense model. Moreover, due to adopting privacy operations in edge devices, PA-iMFL promotes up to 2.8 × communication efficiency than the SOTA compression method without compromising model accuracy.
4 December 2017 in The Computer Journal
Analyzing the survivability of a cloud service is critical as the application or service migration from local to cloud is an irresistible trend. However, former research on cloud service or virtual system (VS) availability and/or reliability was only carried out from the perspective of steady state. This paper aims to analyze the survivability of the cloud service after a service breakdown occurrence by presenting a model and the closed-form solutions with the use of continuous-time Markov chain. The service breakdown may be caused by virtual machine (VM) and/or VM monitor (VMM) bugs or software rejuvenation and/or host failures and NAS (Network Area Storage) failures. In order to improve the cloud service survivability, the VS applies two techniques: VM failover and VM live-migration. Through the model proposed and the survivability metrics defined in this paper, we are able to quantitatively assess the system survivability while providing insights into the investment efforts in system recovery strategies. In order to study the impact of key parameters on system survivability, this paper also provides a parameter sensitivity analysis through numerical experiments.
15 July 2024 in IEEE Transactions on Services Computing
GHOST, like the longest-chain protocol, is a chain selection protocol and its capability in resisting selfish mining attack has been validated in imperfect (delay-existing-) blockchains of Bitcoin and its variants (Bitcoin-like). This paper explores an analytical-model-based approach to investigate the impact of stubborn mining attack in imperfect GHOST Bitcoin-like blockchains. We first quantify chain dynamics based on Markov chain process and then derive the formulas of miner revenue and system throughput. We also propose a new metric, “Hazard Index”, which can be used to evaluate attack threat severity and also assist the adversary in determining whether it is profitable to conduct an attack. The experiment results show that 1) An adversary with more than 30% computing power can get huge profit and extremely downgrade system throughput by launching stubborn mining attack. 2) An adversary should not launch stubborn mining attack if it has less than 25% computing power. 3) Stubborn mining attack causes more damage than selfish mining attack under GHOST. Our work provides insight into stubborn mining attack and is helpful in designing countermeasures.
21 December 2023 in IEEE Transactions on Network Science and Engineering
Bitcoin is the largest Proof-of-Work (PoW) public blockchain but is vulnerable to various attacks like stubborn mining attack, which greatly downgrades both system throughput and benefits malicious miners (attackers). The existing works assume miners receive new blocks immediately after block generation, which is away from reality. This paper aims to quantify the stubborn mining attack severity in an imperfect Bitcoin network in which there exists block receiving delay. In this paper, we first develop an analytic model to capture blockchain dynamics, and then derive formulas of both relative revenue and system throughput, which are applied to study attack severity. Experiment results validate our quantitative analysis method and show that imperfect networks favor attackers. Moreover, the results recommend a blockchain system to be composed of small mining pools to get fair revenue distribution, and minimize its network delay and fork probability to get high TPS.