Xiaoting Li

Xiaoting Li

Auto-generated profile, based on publicly available information

Xiaoting Li

Department of Information Center, Zhejiang University, Hangzhou, Zhejiang, 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
11 March 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Open access
LHLongbo Han
Longbo Han
GHGengran Hu
Gengran Hu
XLXiaoting Li
Xiaoting Li
FXFeifei Xia
Feifei Xia
SWShengbao Wang
Shengbao Wang
LYLIN YOU
LIN YOU
As a part of blockchain's infrastructure, the construction of Merkle trees typically relies on secure hash functions, such as SHA256. However, traditional blockchain systems face dual threats: quantum vulnerabilities in hash functions (e.g., Grover's algorithm reduces collision resistance) and inefficiencies in large-scale data verification. To address these challenges, we propose a parameter-hopping Merkle tree framework integrating a pseudo-random number generator (PRNG) with lattice-based cryptography. Our design ensures adaptive security through dynamic basis vector generation. This lattice-based structure offers flexibility in accommodating messages of varying sizes, supports distributed data storage, and enables efficient verification and querying of large-scale information streams. Key contributions include: a). A provably secure hash chain constructed via a family of extended-message-domain lattice-based hash functions (LBHFs), supporting arbitrary-length inputs. b). A variable-parameter Merkle tree protocol enabling efficient distributed data storage and query verification, with proof sizes optimized for P2P networks. c) A trusted data management prototype validated in a cloud storage scenario. Experimental results indicate that our blockchain infrastructure achieves enhanced security while maintaining high efficiency.

24 February 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
LHLongbo Han
Longbo Han
XLXiaoting Li
Xiaoting Li
LYLIN YOU
LIN YOU
GHGengran Hu
Gengran Hu
FXFeifei Xia
Feifei Xia
MGMin Guo
Min Guo
Vehicular ad hoc networks (VANETs) require authentication mechanisms that simultaneously deliver privacy, accountability, and timely cross-domain synchronization. The existing schemes struggle to balance unlinkable anonymity with effective tracing. They are also vulnerable to future quantum adversaries and rely on slow and costly revocation workflows. We present ZebraCPA, a decentralized conditional privacy-preserving authentication (CPPA) framework that combines lattice-based traceable ring signatures (TRSs) with zero-knowledge (ZK) proofs and a consortium blockchain. Our TRS design removes linkability tags and embeds a tracing trapdoor only recoverable by the authorized auditors. It naturally extends to threshold tracing for multiauditor settings. To avoid the plaintext key escrow, ZebraCPA leverages the additively homomorphic property of the commitments to support the ciphertext-only key updates by the vehicles, preventing the catastrophic key leakage at authorities. A hierarchical blockchain layer provides fast, consistent synchronization of active-key status across regions. The experiments show $1.7\times $ – $7.0\times $ speedups over state-of-the-art baselines in signing/verification while retaining an anonymity-set size of N = 10. The network-level simulations further indicate that ZebraCPA reduces an average packet delay (APD) by 30.7%–61.6% compared with the baselines under moderate traffic densities. Moreover, the security of ZebraCPA is validated through our informal analysis under the Dolev-Yao model. Overall, ZebraCPA achieves postquantum security, strong anonymity with conditional traceability, and practical deployment efficiency for VANETs, outperforming the existing solutions in terms of both latency and robustness.