JZJianting Zhang

Jianting Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jianting Zhang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Five Minutes of DDoS Brings down Tor: DDoS Attacks on the Tor Directory Protocol and Mitigations

    by Zhongtang Luo, Jianting Zhang, Akshat Neerati, Aniket Kate

    The Tor network offers network anonymity to its users by routing their traffic through a sequence of relays. A group of nine directory authorities maintains information about all available relay nodes using a distributed directory protocol. We observe that the current protocol makes a strong synchrony assumption, which makes it vulnerable to natural as well as adversarial non-synchronous communication scenarios over the Internet. In this paper, we show that it is possible to cause a failure in the Tor directory protocol by targeting a majority of the authorities for only five minutes using a well-executed distributed denial-of-service (DDoS) attack. We demonstrate this attack in a controlled environment and show that it is cost-effective for as little as $53.28 per month to disrupt the protocol and to effectively bring down the entire Tor network. To mitigate this problem, we consider the popular partial synchrony assumption that ensures protocol security even when the network delays are large and unknown initially. We design a new Tor directory protocol that leverages a standard partial-synchronous consensus protocol to solve this problem, while also proving its security. We have implemented a prototype in Rust, demonstrating comparable performance to the current protocol.


  • RapidSnail: Improve Scalability of Blockchain Under High Contention Workload

    by Junyi Wen, Wuhui Chen, Jianting Zhang, Xiao Chen, Ting Cai, Hong-Ning Dai, Zibin Zheng

    The Execute-Order-Validate (EOV) framework has been used to improve the scalability of blockchains by concurrently executing transactions. However, the EOV framework also poses a critical performance issue. Specifically, when multiple transactions access the same data, only one of them can be committed eventually while the others are aborted due to the strong concurrency control restriction. This inefficiency makes the EOV framework far from practicality since there always exist hotspot variables that can be frequently accessed in real-world scenarios, such as the Fungible Token (FT) and Non-Fungible Token (NFT) online marketplace. In this paper, we propose RapidSnail, a novel EOV framework that enables transactions to execute based on the uncommitted data to reduce the transaction abort rate in such scenarios with hotspot variables. We first propose a new read-write set representation and a concurrency execution schedule algorithm in the execution phase to maintain the concurrent efficiency. Then we propose an effect-based conflict graph construction algorithm in the order phase to handle the conflict transactions based on the new read-write set. Finally, we propose a concurrent commitment schedule algorithm to adopt the new read-write set to validate the transactions concurrently in the validation phase. Our experiment results show that RapidSnail increases the throughput by at least 4$\mathbf{\times}$ compared to the state-of-the-art EOV framework under high contention workload. More specifically, RapidSnail reduces the abort rate by 50%, and achieves at least 4$\mathbf{\times}$ speedup in the order phase and 2.94$\mathbf{\times}$ speedup in the validation phase over the existing EOV frameworks.

  • Scaling Blockchain via Dynamic Sharding

    by Jianting Zhang, Zicong Hong, Xiaoyu Qiu, Wuhui Chen, Yufeng Zhan, Song Guo

    Sharding is considered a promising solution for scaling blockchain systems. However, most existing sharding systems have not considered the dynamics of the environment when making a sharding strategy, including the change of pending transactions, the leaving and joining of participants, and malicious attacks, which could cause performance instability and security issues. To address it, in this paper, we propose an intelligent and efficient dynamic sharding technology to advance the blockchain system performance and security. We first propose a formal and general evaluation framework for blockchain sharding in a dynamic environment, and conclude an optimization target for the system performance and security. To achieve a long-term benefit for the optimization target, a deep reinforcement learning (DRL)-based sharding approach has been proposed to intelligently make optimal sharding strategies. Next, we propose an adaptive resharding protocol to efficiently reduce the overhead introduced by dynamic sharding. Our experimental results illustrate that our proposed dynamic sharding in a simulation testbed can achieve 2.8 times transactions per second compared to traditional static sharding systems, and guarantee high security in a dynamic environment.


  • Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching

    by Junyuan Liang, Peiyuan Yao, Wuhui Chen, Zicong Hong, Jianting Zhang, Ting Cai, Min Sun, Zibin Zheng

    Sharding is a promising solution to scale blockchain by separating the system into multiple shards to process transactions in parallel. However, due to state separation and shard isolation, it is still challenging to efficiently support smart contracts on a blockchain sharding system where smart contracts can interact with each other, involving states maintained by multiple shards. Specifically, existing sharding systems adopt a costly multi-step collaboration mechanism to execute smart contracts, resulting in long latency and low throughput. This paper proposes SPARROW, a blockchain sharding protocol achieving one-step execution for smart contracts. To break shard isolation, inspired by non-local hotspot data caching in traditional databases, we propose a new idea of inter-shard caching, allowing a shard to prefetch and cache frequently accessed contract states of other shards. The miner can thus use the inter-shard cache to pre-execute a pending transaction, retrieve all its contract invocations, and commit it to multiple shards in one step. Particularly, we first propose a speculative dispersal cache synchronisation mechanism for efficient and secure cache synchronization across shards in Byzantine environments. Then, we propose a multi-branch exploration mechanism to solve the rollback problem during the optimistic one-step execution of contract invocations with dependencies. We also present a series of conflict resolution mechanisms to decrease the rollback caused by inherent transaction conflicts. We implement prototypes for SPARROW and existing sharding systems, and the evaluation shows that SPARROW improves the throughput by 2.44× and reduces the transaction latency by 30% compared with the existing sharding systems.


  • SmartChain: A Dynamic and Self-Adaptive Sharding Framework for IoT Blockchain

    by Ting Cai, Wuhui Chen, Jianting Zhang, Zibin Zheng

    Sharding technologies allow the Internet of Things (IoT) to deploy blockchains in large-scale applications with good scalability. However, conventional sharding strategies in IoT blockchain are highly restricted because most IoT devices are dynamic and heterogeneous. They fail to partition and reconfigure shards with a fine-balanced tradeoff between throughput and security. Therefore, we propose SmartChain, which is a dynamic and self-adaptive sharding framework devised for making sharding decisions on the IoT blockchain featured with dynamics and heterogeneity. Specifically, we elaborate on how SmartChain performs reconfiguration and provide a quantitative analysis of shard performance. We then formulate the long-term tradeoff of throughput and security as a Markov decision process. Considering the nature of time-varying devices (e.g., amount of computing power, location), we develop a Transferable Proximal Policy Optimization (PPO) with Demonstrations algorithm, namely TPPOD, to help quickly reconfigure shards when the environment changes. Thus, based on current state, SmartChain can adaptively and dynamically select shard number, partition structure, and primary selection mode. Evaluations show that SmartChain enables high throughput and low risk of security, and reduces 70% of the training time averaged over baselines. Our implementation of TPPOD is 8.3 times of average system reward compared with the PPO-based sharding strategy with uniform sampling.


  • Efficient Execution of Arbitrarily Complex Cross-Shard Contracts for Blockchain Sharding

    by Jianting Zhang, Wuhui Chen, Zicong Hong, Gang Xiao, Linlin Du, Zibin Zheng

    Sharding is a promising solution to enhance the scalability of blockchain. However, previous sharding systems adopt the lock-based cross-shard protocol to exclusively handle one-shot cross-shard transactions, leading to low-efficiency executions and unavailable calls when handling complex cross-shard contracts that introduce multi-shot cross-shard transactions to invoke multiple contracts managed by different shards. In this paper, we aim to enable efficient execution of arbitrarily complex cross-shard contracts in blockchain sharding systems. First, we perform a calling-flow analysis on Ethereum contracts with more than 180 million real-world transactions and find that about $30\%$ transactions invoke complex contracts. Then, motivated by the properties of these complex contracts, we propose an off-chain execution model, called ShardCon, to achieve efficient executions for complex cross-shard contracts by decoupling the contract execution from the cross-shard consensus. Next, we introduce a cross-shard contract execution engine and a contract-driven deployment rule to the overheads introduced by off-chain executions. Moreover, to adapt to the multi-chain property of a sharding system, we introduce an off-chain state atomic commit protocol. Finally, we implement a prototype and evaluate it with concrete cross-shard contracts, showing that ShardCon can achieve more than 10x increase in throughput and 2x decrease in confirmation latency than the state-of-the-art sharding systems.


  • Enhancing Blockchain Performance via On-chain and Off-chain Collaboration

    by Wuhui Chen, Zhaoxian Yang, Jianting Zhang, Junyuan Liang, Qilin Sun, Fan Zhou


  • Open Access

    Prophet: Conflict-Free Sharding Blockchain via Byzantine-Tolerant Deterministic Ordering

    by Zicong Hong, Song Guo, Enyuan Zhou, Jianting Zhang, Wuhui Chen, Jinwen Liang, Jie Zhang, Albert Zomaya

    Sharding scales throughput by splitting blockchain nodes into parallel groups. However, different shards' independent and random scheduling for cross-shard transactions results in numerous conflicts and aborts, since cross-shard transactions from different shards may access the same account. A deterministic ordering can eliminate conflicts by determining a global order for transactions before processing, as proved in the database field. Unfortunately, due to the intertwining of the Byzantine environment and information isolation among shards, there is no trusted party able to predetermine such an order for cross-shard transactions. To tackle this challenge, this paper proposes Prophet, a conflict-free sharding blockchain based on Byzantine-tolerant deterministic ordering. It first depends on untrusted self-organizing coalitions of nodes from different shards to pre-execute cross-shard transactions for prerequisite information about ordering. It then determines a trusted global order based on stateless ordering and post-verification for pre-executed results, through shard cooperation. Following the order, the shards thus orderly execute and commit transactions without conflicts. Prophet orchestrates the pre-execution, ordering, and execution processes in the sharding consensus for minimal overhead. We rigorously prove the determinism and serializability of transactions under the Byzantine and sharded environment. An evaluation of our prototype shows that Prophet improves the throughput by $3.11\times$ and achieves nearly no aborts on 1 million Ethereum transactions compared with state-of-the-art sharding.


  • Dynamic Sharding: A Trade-OFF Between Security and Scalability

    by Jianting Zhang, Zicong Hong, Xiaoyu Qiu, Yufeng Zhan, Song Guo, Wuhui Chen


  • Benzene: Scaling Blockchain With Cooperation-Based Sharding

    by Zhongteng Cai, Junyuan Liang, Wuhui Chen, Zicong Hong, Hong-Ning Dai, Jianting Zhang, Zibin Zheng

    Sharding has been considered as a prominent approach to enhance the limited performance of blockchain. However, most sharding systems leverage a non-cooperative design, which lowers the fault tolerance resilience due to the decreased mining power as the consensus execution is limited to each separated shard. To this end, we present Benzene, a novel sharding system that enhances the performance by cooperation-based sharding while defending the per-shard security. Firstly, we establish a double-chain architecture for function decoupling. This architecture separates transaction-recording functions from consensus-execution functions, thereby enabling the cross-shard cooperation during consensus execution while preserving the concurrency nature of sharding. Secondly, we design a cross-shard block verification mechanism leveraging Trusted Execution Environment (TEE), via which miners can verify blocks from other shards during the cooperation process with the minimized overheads. Finally, we design a voting-based consensus protocol for cross-shard cooperation. Transactions in each shard are confirmed by all shards that simultaneously cast votes, consequently achieving an enhanced fault tolerance and lowering the confirmation latency. We implement Benzene and conduct both prototype experiments and large-scale simulations to evaluate the performance of Benzene. Results show that Benzene achieves superior performance than existing sharding/non-sharding blockchain protocols. In particular, Benzene achieves a linearly-improved throughput with the increased number of shards (e.g., 32,370 transactions per second with 50 shards) and maintains a lower confirmation latency than Bitcoin (with more than 50 shards). Meanwhile, Benzene maintains a fixed fault tolerance at 1/3 even with the increased number of shards.