22 January 2024 in IEEE Transactions on Computers
Processing sensitive data and deploying well-designed Intellectual Property (IP) cores on remote Field Programmable Gate Array (FPGA) are prone to private data leakage and IP theft. One effective solution is constructing Trusted Execution Environment (TEE) and its secure boot process on FPGA-SoC (FPGA System on Chip). This paper aims to establish Secure Runtime Customizable TEE (SrcTEE) on FPGA-SoC through the design of a novel secure boot scheme and the design of the following three components: 1) CrloadIP, which enforces access control on TEE applications deploying IP at runtime such that SrcTEE can alleviate threats from unauthorized TEE applications and then SrcTEE can be adjusted dynamically and securely; 2) CexecIP, which not only enables the execution of newly-installed IP cores without modifying the operating system of FPGA-SoC TEE, but also prevents insider attacks from executing IPs in SrcTEE; 3) CremoAT, which can provide the newly-measured SrcTEE state and establish a secure communication path between remote verifiers and SrcTEE. Our secure boot scheme supports refreshable root trust key, and assures the authenticity and integrity of boot codes during the SrcTEE booting process. We conduct a security analysis of SrcTEE and its performance evaluation on Xilinx Zynq UltraScale+ XCZU15EG 2FFVB1156 MPSoC.
3 January 2025 in IEEE Transactions on Networking
Traditional covert transmission (CT) approaches have been hindering CT application while blockchain technology offers new avenue. Current blockchain-based CT approaches require off-chain negotiation of critical information and often overlook the dynamic updating of session keys, which increases the risk of message and key leakage. Additionally, in some approaches the covert transactions exhibit obvious characteristics that can be easily detected by third-parties. Moreover, most approaches do not address the issue of decreased reliability of message transmission in blockchain attack scenarios. Bitcoin-and Ethereum-based approaches also have the issue of transaction linkability, which can be tackled by Monero-based approaches because of the privacy protection mechanisms in Monero. However, Monero-based CT has the problem of sender repudiation. In this paper, we propose a novel $M$ onero- $B$ ased CT approach (MBCT), which enables on-chain session key dynamically updating without off-chain negotiation. MBCT can assure confidentiality of on-chain session key, non-repudiation of transmission parties, reliability of message transmission under blockchain attack, unlinkability and obscurity of covert transactions. They are achieved by the three components in MBCT, namely, a sender authentication method, a dynamically on-chain session key updating method and a state feedback method. We implement MBCT in Monero-0.18.1.0 and the experiment results demonstrate its high embedding capacity of MBCT.
3 August 2022 in Peer-to-Peer Networking and Applications
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.