Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jiang Xiao has a total of 118 co-authors. Here are the top co-authors by number of shared publications:

  • Hai Jin

    Huazhong University of Science and Technology

    26 shared publications
  • Xiaohai Dai

    Huazhong University of Science and Technology

    14 shared publications
  • Bo Li

    The Hong Kong University of Science and Technology

    5 shared publications
  • Chen Yu

    School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China

    4 shared publications
  • Chenchen Li

    National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Laboratory, and the Cluster and Grid Computing Laboratory, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China

    4 shared publications
  • Hai Jin

    Clusters and Grid Computing Lab, National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab, Wuhan, China

    4 shared publications

Latest Publications

  • Open Access

    Turbo: Optimistic Execution Framework for Low-Latency Cross-Chain Transactions

    by Yifan Zhou, Jiang Xiao, Enping Wu, Hai Jin

    Cross-chain transaction plays a pivotal role in enhancing decentralized applications by enabling interactions and executing local transactions across multiple blockchain systems. However, existing methods on its execution often suffer from high latency, primarily due to the sequential order-validate-execute paradigm, where each local transaction is processed only after the preceding ones are committed. This sequential approach slows down the process as it requires sequential commitment steps on involved blockchains. To address these challenges, we propose Turbo, a novel framework that enhances cross-chain transaction execution by adopting an optimistic execution paradigm. Turbo optimizes latency by concurrently ordering transactions without strict dependency sequences and employing advanced validation techniques to ensure sequence consistency. We implemented Turbo on top of the Cosmos network and conducted extensive experimentation. The results demonstrate its practicality in handling cross-chain transaction execution with low latency, marking a substantial improvement over the state-of-the-art.


  • Open Access

    PlainDAG: A Low-Latency Asynchronous DAG BFT Protocol With Best-Effort Broadcast

    by Yifan Zhou, Jiang Xiao, Xiaohai Dai, Hai Jin

    Broadcast primitives like Reliable Broadcast (RBC) are integral to Directed Acyclic Graph (DAG)-based asynchronous Byzantine Fault Tolerant (BFT) protocols. Despite recent advancements, these protocols often suffer from high latency due to the inherent three communication rounds in RBC. To mitigate this latency, we propose employing Best-Effort Broadcast (BBC) for message dissemination, which requires only one communication round. However, leveraging BBC poses challenges in constructing a DAG-based ledger and ensuring consistent commitment in the face of contradictory blocks. In this paper, we introduce PlainDAG, a low-latency and secure asynchronous DAG-based BFT protocol that eschews complex broadcast primitives. Instead, it achieves lower latency by simplifying broadcast and committing with a larger quorum of votes. Our approach addresses the integrity, agreement, and totality properties lacking in BBC compared to RBC, thus ensuring correctness. Key to the design of PlainDAG is the introduction of an Integral Reference field in blocks, which references previously committed blocks and facilitates voting among contradictory blocks. Additionally, we devise a block query scheme to retrieve missing blocks. Theoretical analysis demonstrates the generalized design applicability of PlainDAG for asynchronous DAG-based BFTs, with the best-case latency of 2 communication rounds and practical resilience. Experimental results underscore the superiority of PlainDAG over state-of-the-art asynchronous DAG-based protocols in latency, while achieving comparable throughput performance.


  • Open Access

    Lasagne: A Suite of High-Profit Arbitrage Strategies for Blockchain-Based Decentralized Exchanges

    by Yifei Liang, Xiaohai Dai, Chenchen Li, Minrui Wu, Jiang Xiao, Keke Gai, Hai Jin

    Sandwich arbitrage is a popular strategy for blockchain-based decentralized exchange (DEX) users to facilitate decentralized token exchanges and make profits. However, conventional Sandwich arbitrage only focuses on one big-deal transaction and executes arbitrary actions within an intrablock, leading to a huge loss of profit opportunities. In this article, we present Lasagne, a novel high-profit arbitrage strategy that allows the exploration of profit opportunities from multiple small-deal transactions across interblocks. Specifically, Lasagne involves a suite of novel strategies: fishing, bundle, and grid, each of which is tailored to a liquidity pool with diverse transaction frequencies and skewness. The experimental results demonstrate the superiority of Lasagne over a state-of-the-art sandwich in terms of feasibility and effectiveness.


  • Open Access

    Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput

    by Xiaohai Dai, Chaozheng Ding, Wei Li, Jiang Xiao, Bolin Zhang, Chen Yu, Albert Y. Zomaya, Hai Jin

    Asynchronous Byzantine Fault Tolerant (BFT) consensus protocols have garnered significant attention with the rise of blockchain technology. A typical asynchronous protocol is designed by executing sequential instances of the Asynchronous Common Sub-seQuence (ACSQ). The ACSQ protocol consists of two primary components: the Asynchronous Common Subset (ACS) protocol and a block sorting mechanism, with the ACS protocol comprising two stages: broadcast and agreement. However, current protocols encounter three critical issues: high latency arising from the execution of the agreement stage, latency instability due to the integral-sorting mechanism, and reduced throughput caused by block discarding. To address these issues,we propose Falcon, an asynchronous BFT protocol that achieves low latency and enhanced throughput. Falcon introduces a novel broadcast protocol, Graded Broadcast (GBC), which enables a block to be included in the ACS set directly, bypassing the agreement stage and thereby reducing latency. To ensure safety, Falcon incorporates a new binary agreement protocol called Asymmetrical Asynchronous Binary Agreement (AABA), designed to complement GBC. Additionally, Falcon employs a partial-sorting mechanism, allowing continuous rather than simultaneous block committing, enhancing latency stability. Finally, we incorporate an agreement trigger that, before its activation, enables nodes to wait for more blocks to be delivered and committed, thereby boosting throughput. We conduct a series of experiments to evaluate Falcon, demonstrating its superior performance.

  • Open Access

    FlexIM: Efficient and Verifiable Index Management in Blockchain

    by Binhong Li, Licheng Lin, Shijie Zhang, Jianliang Xu, Jiang Xiao, Bo Li, Hai Jin

    Blockchain-based query with its traceability and data provenance has become increasingly popular and widely adopted in numerous applications. Yet existing index-based query approaches are only efficient under static blockchain query workloads where the query attribute or type must be fixed. It turns out to be particularly challenging to construct an efficient index for dynamic workloads due to prohibitively long construction time and excessive storage consumption. In this paper, we present FlexIM, the first efficient and verifiable index management system for blockchain dynamic queries. The key innovation in FlexIM is to uncover the inherent characteristics of blockchain, i.e., data distribution and block access frequency, and then to optimally choose the index by utilizing reinforcement learning technique under varying workloads. In addition, we enhance and facilitate verifiability with low storage overhead by leveraging Root Merkle Tree (RMT) and Bloom Filter Merkle Tree (BMT). Our comprehensive evaluations demonstrate that FlexIM outperforms the state-of-the-art blockchain query mechanism, vChain+, by achieving a 26.5% speedup while consuming 94.2% less storage, on average, over real-world Bitcoin datasets.


  • HeX: Encrypted Rich Queries With Forward and Backward Privacy Using Trusted Hardware

    by Haotian Wu, Zhe Peng, Jiang Xiao, Lei Xue, Chenhao Lin, Sai-Ho Chung

    Dynamic searchable symmetric encryption (DSSE) schemes empower data owners to outsource their encrypted data to clouds while retaining the ability to update or search on it. Despite a lot of efforts devoted in recent years, there are still several challenges that have not been well addressed. Firstly, the confidentiality of data might be compromised if forward privacy and backward privacy cannot be ensured. Secondly, only the traditional single keyword-file search has attracted tremendous attention, while other popular queries like Boolean queries and range queries are not fully investigated. Lastly, how to solve these problems on untrusted servers that may deviate from pre-defined protocols is also challenging. In this paper, aiming to tackle the above problems, we propose a novel DSSE scheme named HeX based on Trusted Execution Environment (TEE) that supports rich queries on untrusted servers while guaranteeing forward and backward privacy. We achieve strong forward and backward security by designing a deferred obfuscating read-write technique atop the bitmap index. We further extend the basic scheme to realize Boolean queries and range queries by reducing them to basic keyword queries. Strict theoretical analysis is conducted to prove the security of HeX, and extensive evaluations illustrate its efficiency and practicality.


  • Open Access

    Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFT

    by Xiaohai Dai, Zhengxuan Guo, Jiang Xiao, Guanxiong Wang, Yifei Liang, Chen Yu, Hai Jin

    Asynchronous Byzantine Fault Tolerance (BFT) consensus protocols are gaining attention for their resilience against network attacks. Among them, Multi-valued Byzantine Agreement (MVBA) protocols play a critical role, which accepts input values from each replica and returns a consistent output. The state-of-the-art MVBA protocol, sMVBA, has a good-case latency of $6\delta$ and an expected bad-case latency of $12\delta$, with $\delta$ representing the network delay. Additionally, sMVBA exhibits a communication of $O(n^{2})$ in both good and bad cases. Although it outperforms other MVBA protocols, sMVBA still lags behind partially-synchronous counterparts. For instance, PBFT achieves a good-case latency of $3\delta$, and HotStuff boasts a good-case communication of $O(n)$. This paper introduces a novel MVBA protocol, Pako, aiming for performance comparable to partially-synchronous protocols. Pako leverages an existing MVBA protocol as a black box and introduces an additional view with an optimistic path to commit values efficiently. Two Pako variants, Pako1 and Pako2, provide a trade-off between latency and communication. To be more specific, Pako1 achieves a good-case latency of $3\delta$ with $O(n^{2})$ communication, while Pako2 reduces the communication to $O(n)$ with a slightly higher good-case latency of $5\delta$. A series of experiments demonstrate Pako's significant outperformance of counterparts.


  • Open Access

    Remora: A Low-Latency DAG-Based BFT Through Optimistic Paths

    by Xiaohai Dai, Wei Li, Guanxiong Wang, Jiang Xiao, Haoyang Chen, Shufei Li, Albert Y. Zomaya, Hai Jin

    Standing as a foundational element within blockchain systems, the Byzantine Fault Tolerant (BFT) consensus has garnered significant attention over the past decade. The introduction of a Directed Acyclic Directed (DAG) structure into BFT consensus design, termed DAG-based BFT, has emerged to bolster throughput. However, prevalent DAG-based protocols grapple with substantial latency issues, suffering from a latency gap compared to non-DAG protocols. For instance, leading-edge DAG-based protocols named GradedDAG and BullShark exhibit a good-case latency of $4$ and $6$ communication rounds, respectively. In contrast, the non-DAG protocol, exemplified by PBFT, attains a latency of $3$ rounds in favorable conditions. To bridge this latency gap, we propose Remora, a novel DAG-based BFT protocol. Remora achieves a reduced latency of $3$ rounds by incorporating optimistic paths. At its core, Remora endeavors to commit blocks through the optimistic path initially, facilitating low latency in favorable situations. Conversely, in unfavorable scenarios, Remora seamlessly transitions to a pessimistic path to ensure liveness. Various experiments validate Remora's feasibility and efficiency, highlighting its potential as a robust solution in the realm of BFT consensus protocols.


  • Open Access

    UHA: An Intelligent Uncertainty Map Based Hierarchical Attention Network System for Building Segmentation

    by Liezhuo Zhang, Xianwei Lv, Chen Yu, Jiang Xiao, Kai Liu, Hai Jin

    Satellite images are becoming increasingly high quality with the advancement of high-resolution remote sensing technology. Benefited from the development of deep learning, object segmentation for the high-resolution satellite images has achieved significant improvements in recent years. However, for buildings with multiple scales and almost straight edges in satellite images, the current segmentation methods usually struggle to achieve relatively good results. In this paper, we propose an Uncertainty map based Hierarchical Attention network system (UHA) for building segmentation. UHA aims to capture the information about low-confidence areas of the building's straight edges and improve the segmentation prediction step by step by a hierarchical structure network with three decoder branches. Specifically, we first generate uncertainty maps from the sigmoid prediction maps of the segmentation network. Based on the uncertainty maps, we design an attention module where a transform function transforms the uncertainty maps into attention maps. And then, we introduce the attention module to adjacent branches of the hierarchical network to guide the latter branch by the previous branch, which improves the prediction ability of the following branch smoothly. Finally, we conduct comprehensive experiments that show the proposed system can significantly improve the performance upon baselines by a large margin.