Lei Xie

Lei Xie

Auto-generated profile, based on publicly available information

Lei Xie

Zhejiang Sci-Tech University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
3 December 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
DZDongming Zhang
Dongming Zhang
LXLei Xie
Lei Xie
YTYu Tao
Yu Tao
ZLZhe Liu
Zhe Liu
With the rapid growth of blockchain-based Non-Fungible Tokens (NFTs), data trading has evolved to incorporate NFTs for ownership verification. However, the NFT ecosystem faces significant challenges in copyright protection, particularly when malicious buyers slightly modify the purchased data and remint it as a new NFT, infringing upon the original owner’s rights. In this paper, we propose a copyright-preserving data trading protocol to address this challenge. First, we introduce the Merkle Feature Tree (MFT), an enhanced version of the traditional Merkle Tree that incorporates an AI-powered feature layer above the data layer. Second, we design a copyright challenge phase during the trading process, which recognizes the data owner with highly similar feature vectors and earlier on-chain timestamp as the legitimate owner. Furthermore, to achieve efficient and low-gas feature vector similarity computation on blockchain, we employ Locality-Sensitive Hashing (LSH) to compress high-dimensional floating-point feature vectors into single uint256 integers. Experiments across multiple image feature extraction models show that LSH maintains a high F1 score after compression, effectively supporting similarity-based copyright challenges. Experimental results on the Ethereum Sepolia testnet demonstrate NMFT’s scalability with sublinear growth in gas consumption while maintaining stable latency.

16 April 2026 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YTYu Tao
Yu Tao
LZlu zhou
lu zhou
LXLei Xie
Lei Xie
DZDongming Zhang
Dongming Zhang
XLXinyu Lei
Xinyu Lei
ZLZhe Liu
Zhe Liu
Blockchain sharding improves scalability but suffers from two critical performance bottlenecks during shard reconfiguration: TPS-degradation from ledger synchronization conflicts and Zero-TPS from transaction processing disruptions during key generation. This paper proposes Shardora, a blockchain sharding system that addresses these limitations through two-dimensional parallelism. First, Shardora introduces parallelized dual committee node shuffling that decouples ledger synchronization from transaction processing, eliminating TPS-degradation. A dynamic reputation model ensures security during shuffling. Second, Shardora implements pipelined key pre-generation to avoid Zero-TPS issue. Furthermore, its position-preserving incremental key generation minimizes resource conflicts, maintaining a continuously high TPS during key generation. We prove that Shardora offers theory-guaranteed security. We implement Shardora prototype and deploy it on Alibaba Cloud. Experimental results demonstrate that Shardora addresses the limitations by significantly reducing the overhead of both ledger synchronization and key generation, which shows 90%+ improvement over state-of-the-art sharding schemes. In addition, Shardora shows its superior performance in large-scale network, achieving 31911 TPS in LAN and 8729 TPS in WAN. The code of Shardora is publicly available on GitHub.