MLMingzhe Li

Mingzhe Li

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mingzhe Li has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • BriDe Arbitrager: Enhancing Arbitrage in Ethereum 2.0 via Bribery-Enabled Delayed Block Production

    by Hulin Yang, Mingzhe Li, Jin Zhang, Alia Asheralieva, Qingsong Wei, Siow Mong Rick Goh

    The advent of Ethereum 2.0 has introduced significant changes, particularly the shift to Proof-of-Stake consensus. This change presents new opportunities and challenges for arbitrage. Amidst these changes, we introduce BriDe Arbitrager, a novel tool designed for Ethereum 2.0 that leverages Bribery-driven attacks to Delay block production and increase arbitrage gains. The main idea is to allow malicious proposers to delay block production by bribing validators/proposers, thereby gaining more time to identify arbitrage opportunities. Through analysing the bribery process, we design an adaptive bribery strategy. Additionally, we propose a Delayed Transaction Ordering Algorithm to leverage the delayed time to amplify arbitrage profits for malicious proposers. To ensure fairness and automate the bribery process, we design and implement a bribery smart contract and a bribery client. As a result, BriDe Arbitrager enables adversaries controlling a limited ($\lt 1/4$) fraction of the voting powers to delay block production via bribery and arbitrage more profit. Extensive experimental results based on Ethereum historical transactions demonstrate that BriDe Arbitrager yields an average of 8.78 ETH (16,687.88 USD) daily profits. Furthermore, our approach does not trigger any slashing mechanisms and remains effective even under Proposer Builder Separation and other potential mechanisms will be adopted by Ethereum.

  • Atomic Smart Contract Interoperability With High Efficiency via Cross-Chain Integrated Execution

    by Chaoyue Yin, Mingzhe Li, Jin Zhang, You Lin, Qingsong Wei, Siow Mong Rick Goh

    With the development of Ethereum, numerous blockchains compatible with Ethereum’s execution environment (i.e., Ethereum Virtual Machine, EVM) have emerged. Developers can leverage smart contracts to run various complex decentralized applications on top of blockchains. However, the increasing number of EVM-compatible blockchains has introduced significant challenges in cross-chain interoperability, particularly in ensuring efficiency and atomicity for the whole cross-chain application. Existing solutions are either limited in guaranteeing overall atomicity for the cross-chain application, or inefficient due to the need for multiple rounds of cross-chain smart contract execution. To address this gap, we propose IntegrateX, an efficient cross-chain interoperability system that ensures the overall atomicity of cross-chain smart contract invocations. The core idea is to deploy the logic required for cross-chain execution onto a single blockchain, where it can be executed in an integrated manner. This allows cross-chain applications to perform all cross-chain logic efficiently within the same blockchain. IntegrateX consists of a cross-chain smart contract deployment protocol and a cross-chain smart contract integrated execution protocol. The former achieves efficient and secure cross-chain deployment by decoupling smart contract logic from state, and employing an off-chain cross-chain deployment mechanism combined with on-chain cross-chain verification. The latter ensures atomicity of cross-chain invocations through a 2PC-based mechanism, and enhances performance through transaction aggregation and fine-grained state lock. We implement a prototype of IntegrateX. Extensive experiments demonstrate that it reduces up to 61.2% latency compared to the state-of-the-art baseline while maintaining low gas consumption.


  • SpiralShard: Highly Concurrent and Secure Blockchain Sharding via Linked Cross-Shard Endorsement

    by You Lin, Mingzhe Li, Jin Zhang

    Blockchain sharding improves the scalability of blockchain systems by partitioning the whole blockchain state, nodes, and transaction workloads into different shards. However, existing blockchain sharding systems generally suffer from a small number of shards, resulting in limited concurrency. The main reason is that existing sharding systems require large shard sizes to ensure security. To enhance the concurrency of blockchain sharding securely, we propose SpiralShard. The intuition is to allow the existence of some shards with a larger fraction of malicious nodes (i.e., corrupted shards), thus reducing shard sizes. SpiralShard can configure more and smaller shards for higher concurrency at the same network size. To ensure security with the existence of corrupted shards, we propose the Linked Cross-shard Endorsement (LCE) protocol. According to our LCE protocol, the blocks of each shard are sequentially verified and endorsed (via intra-shard consensus) by a group of shards before being finalized. As a result, a corrupted shard can eliminate forks with the help of the other shards. We implement SpiralShard based on Harmony and conduct extensive evaluations. Experimental results show that, compared with Harmony, SpiralShard achieves around $19\times $ throughput gain under a large network size with 4,000+ nodes.


  • SP-Chain: Boosting Intrashard and Cross-Shard Security and Performance in Blockchain Sharding

    by Mingzhe Li, You Lin, Wei Wang, Jin Zhang

    A promising way to overcome the scalability limitations of the current blockchain is to use sharding, which is to split the transaction processing among multiple, smaller groups of nodes. A well-performing blockchain sharding system requires both high performance and high security in both intra- and cross-shard perspectives. However, existing protocols either have issues in protecting security or tradeoff great performance for security. In this article, we propose SP-Chain, a blockchain sharding system with enhanced security and performance for both intra- and cross-shard perspectives. For the intrashard aspect, we design a pipelined two-phase concurrent voting scheme to provide high system throughput and low transaction confirmation latency. Moreover, we propose an efficient unbiased leader rotation scheme to ensure high performance under malicious behavior. For the cross-shard aspect, a proof-assisted efficient cross-shard transaction processing mechanism is proposed to guard cross-shard transactions with low overhead. We implement SP-Chain based on Harmony, and evaluate its performance via large-scale deployment. Extensive evaluations suggest that SP-Chain can process more than 10000 tx/s under malicious behaviors with a confirmation latency of 7.6 s in a network of 4000 nodes.


  • Open Access

    Towards Efficient and Deposit-Free Blockchain-Based Spatial Crowdsourcing

    by Mingzhe Li, Wei Wang, Jin Zhang

    Spatial crowdsourcing leverages the widespread use of mobile devices to outsource tasks to a crowd of users based on their geographical location. Despite its growing popularity, current crowdsourcing systems often suffer from a lack of transparency, centralization, and other security issues. Blockchain technology has revolutionized this sector with its potential for decentralization, security, and transparency. However, existing blockchain-based crowdsourcing systems often overlook efficient task assignment mechanisms and expose users to potential losses due to the obligatory deposit payments to smart contracts, which might be vulnerable or untrustworthy. This article proposes EDF-Crowd, an E fficient and D eposit- F ree blockchain-based spatial crowdsoucing framework, to address these challenges. EDF-Crowd introduces an efficient, customizable task assignment mechanism based on smart contracts, operating periodically and batch-wise. We also design a fair compensation mechanism to compensate users for the extra overhead caused by invoking certain smart contracts. More importantly, we propose a series of linkage protocols. By linking users’ back-and-forth actions, EDF-Crowd can regulate user behavior without requiring users to deposit. The versatility of EDF-Crowd also allows its application to generic crowdsourcing systems with minimal modifications. We implement EDF-Crowd based on the EOS blockchain. Extensive evaluations show that EDF-Crowd achieves high task assignment efficiency and low cost.


  • Top Cited Papers

    LB-Chain: Load-Balanced and Low-Latency Blockchain Sharding via Account Migration

    by Mingzhe Li, Wei Wang, Jin Zhang

    Blockchain sharding has been increasingly used to improve blockchain systems’ performance, in which a blockchain is split into multiple smaller, disjoint shards. In practice, however, sharding can only achieve limited throughput and latency improvement, especially for the user-perceived transaction confirmation delay. The performance degradation is believed to be caused by the cross-shard transactions. However, we show, through comprehensive system deployment and measurement studies, that the main culprit is the imbalanced transaction load on different blockchain shards. To address this problem, we propose a novel sharding system, called LB-Chain, which dynamically balances the transaction load on different shards by periodically migrating active accounts from heavily-loaded shards to less-loaded ones. We have implemented a prototype of LB-Chain, and evaluated its performance through large-scale blockchain deployment using real-world transaction traces. Extensive experiments confirm that LB-Chain significantly boosts sharding performance, reducing the transaction confirmation delays by up to 90% while increasing the transaction throughput by more than 10%. The delay difference between different accounts is also reduced dramatically, leading to improved fairness in the system.


  • Open Access

    Keywords and Instances: A Hierarchical Contrastive Learning Framework Unifying Hybrid Granularities for Text Generation

    by Mingzhe Li, XieXiong Lin, Xiuying Chen, Jinxiong Chang, Qishen Zhang, Feng Wang, Taifeng Wang, Zhongyi Liu, Wei Chu, Dongyan Zhao, et al.

    Contrastive learning has achieved impressive success in generation tasks to militate the "exposure bias" problem and discriminatively exploit the different quality of references. Existing works mostly focus on contrastive learning on the instance-level without discriminating the contribution of each word, while keywords are the gist of the text and dominant the constrained mapping relationships. Hence, in this work, we propose a hierarchical contrastive learning mechanism, which can unify hybrid granularities semantic meaning in the input text. Concretely, we first propose a keyword graph via contrastive correlations of positive-negative pairs to iteratively polish the keyword representations. Then, we construct intra-contrasts within instance-level and keyword-level, where we assume words are sampled nodes from a sentence distribution. Finally, to bridge the gap between independent contrast levels and tackle the common contrast vanishing problem, we propose an inter-contrast mechanism that measures the discrepancy between contrastive keyword nodes respectively to the instance distribution. Experiments demonstrate that our model outperforms competitive baselines on paraphrasing, dialogue generation, and storytelling tasks.

  • Open Access

    Towards Efficient and Deposit-Free Blockchain-Based Spatial Crowdsourcing

    by Mingzhe Li, Wei Wang, Jin Zhang

    Spatial crowdsourcing emerges as a new computing paradigm that enables mobile users to accomplish spatio- temporal tasks in order to solve human-intrinsic problems. Existing crowdsourcing systems critically use centralized servers for interacting with workers and making task assignment decisions. These systems are hence susceptible to issues such as the single point of failure and the lack of operational transparency. Prior work, therefore, turns to blockchain-based decentralized crowdsourcing systems, yet still suffers from problems of lacking efficient task assignment scheme, requiring a deposit to an untrusted system, low block generation speed, and high transaction fees. To address these issues, we design a blockchain-based decentralized framework for spatial crowdsourcing, which we call SC-EOS. Our system does not rely on any trusted servers, while providing efficient and user-customizable task assignment , low monetary cost, and fast block generation. More importantly, it frees users from making a deposit into an untrusted system . Our framework can also be extended and applied to generic crowdsourcing systems. We implemented the proposed system on the EOS blockchain. Trace-driven evaluations involving real users show that our system attains the comparable task assignment performance against a clairvoyant scheme. It also achieves 10 × cost savings than an Ethereum-based implementation.

  • Incentivizing WiFi-Based Multilateration Location Verification

    by Mingzhe Li, Wei Wang, Jin Zhang, Qian Zhang

    Due to the proliferation of WiFi devices and the high verification precision, researchers have shown interests in WiFi-based multilateration location verification (WMLV), where multiple WiFi APs (also known as verifiers) verify the location information claimed by a prover. However, it is a high expenditure for any single location-based service provider to deploy densely covered WiFi facilities. Incentivizing independent WiFi owners to corporately verify location information is thus a feasible solution to this plight, yet none of the previous research has taken this into consideration. To this point, we design a double auction-based incentive mechanism for WMLV, which motivates the participation of both provers and verifiers. More importantly, we consider practical situations, where the provers have various verification precision requirements, and different number of verifiers are required by different provers. The proposed double auction mechanism achieves desirable economical properties, including truthfulness, individual rationality, computational efficiency, budget balance, and nonnegative social welfare. The desired properties are validated through both theoretical analysis and extensive simulations.


  • Toward Privacy-Preserving Task Assignment for Fully Distributed Spatial Crowdsourcing

    by Mingzhe Li, Jingrou Wu, Wei Wang, Jin Zhang

    With the proliferation of human-carried mobile devices, spatial crowdsourcing has emerged as a transformative system, where requesters outsource their spatiotemporal tasks to a set of workers who are willing to perform the tasks at the specified locations. However, in order to make efficient assignments, the existing spatial crowdsourcing system usually requires workers and/or tasks to expose their locations, which raises a significant concern of compromising location privacy. In addition, traditional spatial crowdsourcing systems employ a centralized server to manage the information of workers and tasks. Such a centralized design does not scale to a large number of workers/tasks, making the server easily a bottleneck. In this article, we present an online framework for assigning tasks to workers without compromising the location privacy in a fully distributed manner. Our system protects the location privacy of both workers and tasks through homomorphic encryption. We further propose a novel wait-and-decide mechanism and a proportional-backoff mechanism to increase the number of assigned tasks. Extensive experiments on real-world data sets illustrate that our proposed system achieves a large number of task assignments in an efficient and privacy-preserving manner.