Tianxiu Xie

Tianxiu Xie

Auto-generated profile, based on publicly available information

Tianxiu Xie

Beijing Institute of Technology

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
27 March 2024 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
SWShuo Wang
Shuo Wang
ZZZijian Zhang
Zijian Zhang
The metaverse, as an emerging technical term, conceptually aims to construct a virtual digital space that runs parallel to the physical world. Due to human behaviors and interactions being represented in the virtual world, security in the metaverse is a challenging issue in which the traditional centralized service model is one of the threat sources. To conquer the obstacle caused by centralized computing, blockchain-based solutions are potential problem-solving methods. However, it is difficult for a single blockchain to support large-scale data and business services in the metaverse, due to the scalability restrictions. Moreover, multi-chain settings also encounter the interoperability issues. In this work, we propose a Relay chain and Asynchronous consensus-based Consortium blockchain cross-Chain model, which realizes message transmission and cross-chain transactions in multiple chains by adopting the relay chain and cross-chain gateways. All nodes of the application chains and the relay chain execute cross-chain transactions in sequence and reach a consensus on transactions at any transmission delay. Our experiment evaluations demonstrate that our approach performs well in atomicity, security, and functionality (cross-chain transactions), such that the performance of blockchain scalability in the metaverse can be improved, compared with the traditional relay chain schemes.

10 April 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
KDKai Ding
Kai Ding
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
JYJing Yu
Jing Yu
SWShuo Wang
Shuo Wang
Weizhi MengWeizhi Meng
Weizhi Meng
Blockchain-based decentralized identity (DID) technology provides a more secure and efficient paradigm for identity verification. However, along with the promotion of applications, data storage of DID has gradually become one of the restrictions for the implementation due to the dramatically increasing size of the distributed ledger, and the issue becomes more complicated when considering the diversity of practical conditions and interoperability. In this article, we propose a scalable on-chain-off-chain storage for decentralized identity (SCOOP) scheme to minimize the total storage cost of blockchain-based DID while guaranteeing the efficiency of the implementation. The proposed scheme consists of a two-phase decision-making process, and a method that integrates the on-chain storage with off-chain storage in a scalable manner, so that an optimal storage task scheduling can be generated. In addition, to reduce on-chain storage overhead, we propose a multilinear tree-based commitment scheme that supports sublinear proof aggregation and updates. Our experiment evaluations have demonstrated that the proposed scheme can successfully achieve a superior performance in storage saving for DID while considering the time constraint.

20 April 2026 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
JYJing Yu
Jing Yu
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
Recent booming development of Generative Artificial Intelligence (GenAI) has facilitated model commercialization to reinforce the model performance, including licensing or trading Deep Neural Network (DNN) models. However, DNN model trading may violate the benefit of the model owner due to unauthorized replications or misuse of the model. Model identity auditing is a challenging issue in protecting DNN model ownership, and verifying the integrity and ownership of models is one of the critical obstacles. In this paper, we focus on the above issue and propose an Accumulator-enabled Auditing for Decentralized Identity of DNN Model (A2-DIDM) that utilizes blockchain and zero-knowledge techniques to protect data and function privacy while ensuring the lightweight on-chain ownership verification. The proposed model presents a scheme of identity records via configuring model weight checkpoints with zero-knowledge proofs, which incorporates predicates to capture incremental state changes in model weight checkpoints. Our scheme ensures both computational integrity and programmability in DNN training process so that the uniqueness of the weight checkpoint sequence in a DNN model is preserved. A2-DIDM also addresses privacy protections in decentralized identity. We systematically analyze the security and robustness of our proposed model and further evaluate the effectiveness and usability of auditing DNN model identities. The code is available at https://github.com/xtx123456/A2-DIDM.git.


1 January 2026 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
JYJing Yu
Jing Yu
YLYuan Lu
Yuan Lu
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
BXBin Xiao
Bin Xiao

11 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
JYJing Yu
Jing Yu
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
Distributed machine learning enables parallel training of extensive datasets by delegating computing tasks across multiple workers. Despite the cost reduction benefits of distributed machine learning, the dissemination of final model weights often leads to potential conflicts over model ownership as workers struggle to substantiate their involvement in the training computation. To address the above ownership issues and prevent accidental failures and malicious attacks, verifying the computational integrity and effectiveness of workers becomes particularly crucial in distributed machine learning. In this paper, we proposed a novel binary linear tree commitment-based ownership protection model to ensure computational integrity with limited overhead and concise proof. Due to the frequent updates of parameters during training, our commitment scheme introduces a maintainable tree structure to reduce the costs of updating proofs. Distinguished from SNARK-based verifiable computation, our model achieves efficient proof aggregation by leveraging inner product arguments. Furthermore, proofs of model weights are watermarked by worker identity keys to prevent commitments from being forged or duplicated. The performance analysis and comparison with SNARK-based hash commitments validate the efficacy of our model in preserving computational integrity within distributed machine learning.