Shijie Zhang

Prof. Shijie Zhang

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
7 June 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SZShijie Zhang
Shijie Zhang
JLJong-Hyouk Lee
Jong-Hyouk Lee
A double-spend attack is one of the major security issues in most blockchain systems, but it is difficult to successfully launch unless an adversary has massive computing power. In this paper, we introduce a new attack model that combines a double-spend attack with a Sybil attack in the Bitcoin network. We present analysis results that a double spending attacker can make a block propagation delay by conducting Sybil attacks and increase the probability of winning the mining race, thus successfully launching the double-spend attack. We develop the probability of success of this new attack in mathematics forms and analyze this attack model from the perspective of economics. We present the attacker's break-even point in various situations and demonstrate the effect of the proposed attack.

17 December 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SZShijie Zhang
Shijie Zhang
JLJong-Hyouk Lee
Jong-Hyouk Lee
Blockchain-based mobile edge computing (BMEC) is an innovative architecture, which is essential in the future fifth-generation (5G) network era. BMEC solves the problem of limited computing resources of devices in the mobile blockchain environment while ensuring the distributed deployment of computing resources and the traceable of transaction data. However, the blockchain technology has many security vulnerabilities, among which attacks against consensus algorithms are particularly serious, i.e., double-spend attacks, long-range attacks, selfish mining. All of these attacks can break the integrity of BMEC, allowing the correct block record to be overwritten with a false one. In this paper, we propose a group signature scheme designed for validating blocks of blockchain to address such issues. Each new block will be regarded as a valid block if it obtains a valid group aggregate signature of the group which the block creator belongs to. We describe in detail the process of authentication and key changes when mobile devices join and leave BMEC. We also provide a more efficient authentication scheme of authenticating mobile devices compared to traditional schemes in BMEC. Lastly, the security analysis is presented to prove that our proposed group signature scheme is effective.

2 May 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JNJunpei Ni
Junpei Ni
Jiang XiaoJiang Xiao
Jiang Xiao
SZShijie Zhang
Shijie Zhang
BLBo Li
Bo Li
BLBaochun Li
Baochun Li
HJHai Jin
Hai Jin
In most blockchain-based application scenarios, a complete application logic consists of multiple continuous transactions, in which the initiation of one transaction depends on the confirmation result of the previous one. This mandates that continuous transactions must be processed in the correct order. Unfortunately, existing chain-based blockchains fail to effectively support continuous transaction processing due to considerable latency in confirming continuous transactions. Recent studies shifted from chain-based blockchains to Directed Acyclic Graph (DAG) based blockchains, which reduced transaction confirmation latencies. However, DAG-based blockchains store transactions in an out-of-order manner that leads to unordered transaction processing. To address this challenge, we propose FLUID, a new DAG-based blockchain that supports continuous transaction processing while delivering high performance. The fundamental idea of FLUID is to design a transaction dependency tracking structure to ensure that continuous transactions can be processed in the correct order. FLUID utilizes a conflict resolution mechanism to provide instant confirmation and to support concurrent transaction processing with lower latencies. In addition, FLUID builds a checkpoint-based verification mechanism to achieve deterministic consensus on transaction processing results in the DAG. Extensive experiments demonstrate that our proposed FLUID can improve the throughput over state-of-the-art OHIE by $66\%$ with two orders of magnitude lower latencies.

1 April 2007
Verified
Conference Paper
Closed access
SZShijie Zhang
Shijie Zhang
JYJiong Yang
Jiong Yang
VCVenuMadhav Cheedella
VenuMadhav Cheedella
In the recent past, many exact graph mining algorithms have been developed to find frequent patterns in a graph database. However, many networks or graphs generated from biological data and other applications may be incomplete or inaccurate. Hence, it is necessary to design approximate graph mining techniques. In this paper, we will study the problem of approximate graph mining and propose an optimized solution which uses frequent trees and a spanning tree based pre-verification check in the mining process.


28 March 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
SZShijie Zhang
Shijie Zhang
Jiang XiaoJiang Xiao
Jiang Xiao
EWEnping Wu
Enping Wu
FCFeng Cheng
Feng Cheng
BLBo Li
Bo Li
HJHai Jin
Hai Jin
Directed Acyclic Graph (DAG)-based blockchain represents a paradigm shift from conventional blockchains, which has the potential to drastically improve throughput performance through concurrent storage and executions. In practice, however, existing DAG-based blockchains fail to deliver such promises, often with limited throughput, high conflicts, and security vulnerabilities under dynamic workloads. The root causes are their unawareness of the workload characteristics of different workload sizes and skewed access patterns. In this article, we propose MorphDAG, the first workload-aware DAG-based blockchain that can significantly enhance throughput without compromising security and achieve elastic scaling under realistic workloads. We derive the theoretically optimal degree of storage concurrency to achieve high throughput while retaining system security as the workload size changes, while enabling fine-grained concurrency adjustment that accommodates a Proof-of-Stake (PoS)-based consensus protocol. We develop a dual-mode transaction processing mechanism that effectively resolves the conflicts brought by skewed access. We implement a prototype of MorphDAG and evaluate under real-world workloads. Extensive evaluations demonstrate that MorphDAG improves end-to-end throughput by up to 2.3× and 2.4× over state-of-the-art DAG-based blockchain systems AdaptChain and OHIE, respectively.