XXXinxin Xing

Xinxin Xing

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xinxin Xing has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Kairos: Efficient High-Threshold Asynchronous Distributed Key Generation from Lightweight Cryptography

    by Xinxin Xing, Yizhong Liu, Zifan Li, Jianwei Liu, Yudi Yang, Yuan Lu, Song Bian, Zhenyu Guan, Tianwei Zhang

  • Open Access

    Xemis: Fair and Robust Privacy-Preserving Data Trading based on Distributed Noise Sharing

    by Xinxin Xing, Yizhong Liu, Ruonan Chen, Banghong Qin, Wangjie Qiu, Jianwei Liu, Qianhong Wu, Willy Susilo, Robert H. Deng


  • EdgeGuard: Blockchain-Enhanced Secure Data Circulation via Aggregatable Distributed Key Generation

    by Boyang Liao, Jianwei Liu, Xinxin Xing, Jian Cui, Qianhong Wu, Willy Susilo, Robert H. Deng, Yizhong Liu

    Data has become a critical driver of innovation in artificial intelligence and the evolution of 6G technologies. The explosive growth of data volume accelerates the convergence of cloud and edge computing, while simultaneously posing heightened challenges to data security and privacy. The emerging cloud-edge-device collaborative paradigm enables dynamic and large-scale data circulation across heterogeneous entities, exposing systems to complex threats such as malicious edge nodes and eavesdropping over untrusted communication channels. In response to these issues, we propose EdgeGuard, a secure and decentralized framework for cloud-edge-device data circulation. EdgeGuard is specifically designed for highly dynamic environments and ensures robust data confidentiality, integrity, traceability, and resilience against both malicious external attackers and compromised edge servers. To underpin its cryptographic foundation, we develop two core primitives. Specifically, we introduce an Aggregatable Publicly Verifiable Secret Sharing (APVSS) scheme that enables efficient sharing of field elements while supporting aggregation and public verifiability. Furthermore, we construct AggDKG, a distributed key generation (DKG) protocol. AggDKG achieves public verifiability and bias resistance with an expected total communication cost of ${\mathcal {O}}(\kappa n^{3})$ effectively overcoming the scalability limitations inherent in traditional complaint-based protocols. Collectively, these components form a comprehensive framework that strengthens secure and efficient data circulation in cloud-edge-device systems. Experimental data show that AggDKG delivers clear performance gains: across all tested scales, its total running time is only about 8%–65% of that of the DKG of Gurkan et al., and at $n=256$, it reduces per-node runtime by approximately 27% compared with the DKG of Gennaro et al. These results highlight EdgeGuard's superior scalability, lower latency, and stronger Byzantine resilience for secure large-scale deployments.

  • MetaL: A Fully Decentralized User-Driven Access Control Scheme for Metaverse Utilizing MC-ABE and Sharding Blockchain

    by Yizhong Liu, Xinxin Xing, Jianwei Liu, Qianhong Wu, Zhenyu Guan, Dawei Li

    In recent years, Metaverse has experienced rapid development and has shown significant potential in various fields. Secure access control protocols are crucial for protecting digital assets and virtual services within the Metaverse. However, existing research suffers from the issue of single points of failure, which threatens data security and privacy when facing malicious adversaries. Additionally, current solutions face scalability challenges, rendering them unsuitable for handling the massive volume of user requests in large-scale Metaverse environments. To overcome these limitations, this paper introduces Metaverse Lock (MetaL), a fully decentralized user-driven access control scheme designed for digital assets and virtual services in the Metaverse. MetaL leverages our designed multi-committee attribute-based encryption (MC-ABE) scheme with a partially synchronous communication model, which enhances the security and fault-tolerance of attribute-based encryption. Additionally, MetaL integrates sharding blockchain technology and consensus algorithms to ensure consistency and liveness within the committee and provide immutability of the key information. The expansion of the committee enhances security and fault tolerance but also introduces additional efficiency overhead. To address this, we propose an innovative double-layer sharding architecture. Experimentally, we present a proof-of-concept implementation of both MC-ABE and MetaL, demonstrating that our approach significantly improves fault tolerance while maintaining an acceptable overhead.


  • Multi-Committee ABE Based Decentralized Access Control With Sharding Blockchain for Web 3.0

    by Xinxin Xing, Yizhong Liu, Qianhong Wu, Zhenyu Guan, Dongyu Li, Dawei Li, Yuan Lu, Willy Susilo

    In Web 3.0's pursuit of a decentralized and user-autonomous network, traditional access control methods, such as central servers and weak decentralized algorithms, are insufficient regarding security, fault tolerance ability, and scalability. To solve this, we first design a decentralized multi-committee attribute-based encryption, X-ABE, to address the weak decentralization and low fault tolerance in Multi-Authority Attribute-Based Encryption (MA-ABE). X-ABE replaces MA-ABE's fragile attribute authorities with robust attribute committees, each composed of multiple nodes. By developing dual-wrapped shares techniques, we address the increased dimensionality challenge of secret sharing while maintaining only 1 distributed key generation instance. Also, a formal security definition and proof under the partial adaptive model are given using dual system encryption. Second, X-LOCK, an X-ABE based decentralized access control utilizing consensus plus sharding, is proposed for Web 3.0, to achieve full decentralization, consistency, fault tolerance, user autonomy, and scalability. Third, X-ABE-R is proposed for attribute revocation and is demonstrated in X-LOCK-R with sharding blockchain as an immutable revocation ledger. Fourth, a formal definition and comparative analysis of X-ABE's fault tolerance abilities are demonstrated, covering aspects of liveness and safety, along with the complexity analysis. Fifth, practical evaluations are conducted, demonstrating that while improving fault tolerance, the overhead remains acceptable.


  • Secure and Scalable Cross-Domain Data Sharing in Zero-Trust Cloud-Edge-End Environment Based on Sharding Blockchain

    by Yizhong Liu, Xinxin Xing, Ziheng Tong, Xun Lin, Jing Chen, Zhenyu Guan, Qianhong Wu, Willy Susilo

    The cloud-edge-end architecture is suitable for many essential scenarios, such as 5 G, the Internet of Things (IoT), and mobile edge computing. Under this architecture, cross-domain and cross-layer data sharing is commonly in need. Considering cross-domain data sharing under the zero-trust model, where each entity does not trust the others, existing solutions have certain problems regarding security, fairness, scalability, and efficiency. Aiming at solving these issues, we conduct the following research. First, a new plaintext checkable encryption scheme is constructed, which can be used on lightweight IoT devices to verify the ciphertext validity sent by a data owner. Second, we propose a new multi-domain cloud-edge-end architecture based on sharding blockchains and design a cross-domain data sharing scheme under the partial trust model to achieve security, scalability, and high performance. Third, a cross-domain data sharing scheme under the zero trust model is further designed, which can ensure the fairness of both parties in data sharing. Fourth, we give a formal security definition and analysis of cross-domain data sharing. Fifth, we conduct a detailed theoretical analysis of the protocol and give an in-depth functional test and performance test, including the throughput and latency of data sharing policy registration and execution.


  • Top Cited Papers

    A Flexible Sharding Blockchain Protocol Based on Cross-Shard Byzantine Fault Tolerance

    by Yizhong Liu, Xinxin Xing, Haosu Cheng, Dawei Li, Zhenyu Guan, Jianwei Liu, Qianhong Wu

    Sharding technology is crucial to achieve decentralization, scalability, and security simultaneously. However, existing sharding blockchain schemes suffer from high cross-shard transaction processing latency, low parallelism, incomplete cross-shard views of shard members, centralized reconfiguration, high overhead of randomness generation, and lack of formalized protocol design and security proofs. This paper proposes a flexible sharding (FS) blockchain protocol. First, a cross-shard Byzantine fault tolerance (CSBFT) protocol is designed to cut down confirmation delays when processing cross-shard transactions. Second, we utilize multiple parallel CSBFT where each node acts not only as a leader but also as multiple ordinary members to break through the performance bottleneck caused by a leader’s bandwidth and computing power, improving the system parallelism. Third, a cross-shard transaction censorship attack is proposed, and a cross-shard view-change mechanism is designed to defend against it. Fourth, a secure and truly decentralized shard reconfiguration method combining proof-of-work, proof-of-possession, and intra-shard BFT is designed. Fifth, we utilize a formal protocol design method and give strict security proof for each protocol. Finally, we evaluate FS from both theoretical and practical perspectives. FS is proven to have lower communication and computation complexity and achieve considerable performance.