Yao Xiao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yao Xiao has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Liehuang Zhu
Beijing Institute of Technology
6 shared publications - Lei Xu
Beijing Institute of Technology
4 shared publications - Can Zhang
School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China
2 shared publications - Jiahang Sun
School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China
2 shared publications - Yan Wu
School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China
2 shared publications Chengxiang Si
National Computer Network Emergency Response Technical Team/Coordination Center of China (CNCERT/CC)
1 shared publication
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3661-3677
When Blockchain Meets Tor: Enabling Automatically Distributed Blind Choosing of Relay Nodes in Anonymous Communication
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3661-3677
When Blockchain Meets Tor: Enabling Automatically Distributed Blind Choosing of Relay Nodes in Anonymous Communication
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 8955-8973
Communication-Efficient Public Verifiable Secret Sharing With Embedded Consensus for Asynchronous Network
Verifiable intelligence and privacy preservation are critical for the deployment of distributed intelligent systems in untrusted environments. Asynchronous verifiable secret sharing (AVSS) is a fundamental primitive that enables secure coordination and data protection, under pinning a wide range of distributed intelligent applications in high-latency and adversarial networks. However, existing AVSS protocols suffer from severe scalability bottlenecks due to their reliance on external reliable broadcast (RBC) channels. This dependency incurs high communication overhead and excessive message rounds, limiting the performance of intelligent applications in large-scale or bandwidth-constrained net works. In this paper, we propose APVC-SS, a communication-efficient Asynchronous Publicly Verifiable Secret Sharing protocol designed for blockchain networks. By integrating the sharing phase with the consensus logic, APVC-SS avoids the use of a standalone RBC channel and thereby reducing the overhead of the entire network. Furthermore, to provide stronger privacy guarantees of open networks, we introduce DAPVC-SS, a dual-threshold extension that secures secrets even when an adversary obtains shares from some non-Byzantine participants. We prove that the proposed protocols satisfy ledger safety and asynchronous termination in a blockchain setting under standard crypto graphic assumptions. Experimental results demonstrate that APVC-SS significantly reduces network bandwidth usage and execution time compared to state-of-the-art AVSS protocols. These advantages become even more pronounced as network size and latency increase, making the proposed protocols a scalable and resource-efficient primitive for intelligent blockchain networks.
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 8955-8973
Communication-Efficient Public Verifiable Secret Sharing With Embedded Consensus for Asynchronous Network
Verifiable intelligence and privacy preservation are critical for the deployment of distributed intelligent systems in untrusted environments. Asynchronous verifiable secret sharing (AVSS) is a fundamental primitive that enables secure coordination and data protection, under pinning a wide range of distributed intelligent applications in high-latency and adversarial networks. However, existing AVSS protocols suffer from severe scalability bottlenecks due to their reliance on external reliable broadcast (RBC) channels. This dependency incurs high communication overhead and excessive message rounds, limiting the performance of intelligent applications in large-scale or bandwidth-constrained net works. In this paper, we propose APVC-SS, a communication-efficient Asynchronous Publicly Verifiable Secret Sharing protocol designed for blockchain networks. By integrating the sharing phase with the consensus logic, APVC-SS avoids the use of a standalone RBC channel and thereby reducing the overhead of the entire network. Furthermore, to provide stronger privacy guarantees of open networks, we introduce DAPVC-SS, a dual-threshold extension that secures secrets even when an adversary obtains shares from some non-Byzantine participants. We prove that the proposed protocols satisfy ledger safety and asynchronous termination in a blockchain setting under standard crypto graphic assumptions. Experimental results demonstrate that APVC-SS significantly reduces network bandwidth usage and execution time compared to state-of-the-art AVSS protocols. These advantages become even more pronounced as network size and latency increase, making the proposed protocols a scalable and resource-efficient primitive for intelligent blockchain networks.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (24) , 40771-40786
PrSeFL: Achieving Practical Privacy and Robustness in Blockchain-Based Federated Learning
With the help of artificial intelligence, the large amount of data generated by Internet of Things (IoT) has unleashed significant value. Federated learning is emerging as a novel paradigm which can be applied to solve the privacy issues caused by analyzing IoT data. However, traditional federated learning protocols are vulnerable to inference and poisoning attacks. Various solutions have been proposed to enhance data privacy and robustness. Nonetheless, most of these solutions are usually centralized and rely on unrealistic security assumptions. Furthermore, the recently proposed blockchain-based decentralized solutions generally incur high costs, which is unaffordable for resource-constrained IoT devices. In this article, we propose a practical secure federated learning system named PrSeFL. We utilize blockchain to decentralize the federated learning process so that the security assumptions are easier to achieve in practice. To preserve data privacy, we implement secure multiparty computation-based secure aggregation in blockchain environment. To guarantee practical robustness, we enforce norm constraints on the masked updates via zero-knowledge proof. Moreover, we propose a modified dynamic accumulator which is utilized to realize lightweight anonymous authentication of users. Simulation results show that, compared with state-of-the-art systems, PrSeFL has superior performance on authentication and model training. And the advantage of PrSeFL becomes more significant as the number of users grows.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (24) , 40771-40786
PrSeFL: Achieving Practical Privacy and Robustness in Blockchain-Based Federated Learning
With the help of artificial intelligence, the large amount of data generated by Internet of Things (IoT) has unleashed significant value. Federated learning is emerging as a novel paradigm which can be applied to solve the privacy issues caused by analyzing IoT data. However, traditional federated learning protocols are vulnerable to inference and poisoning attacks. Various solutions have been proposed to enhance data privacy and robustness. Nonetheless, most of these solutions are usually centralized and rely on unrealistic security assumptions. Furthermore, the recently proposed blockchain-based decentralized solutions generally incur high costs, which is unaffordable for resource-constrained IoT devices. In this article, we propose a practical secure federated learning system named PrSeFL. We utilize blockchain to decentralize the federated learning process so that the security assumptions are easier to achieve in practice. To preserve data privacy, we implement secure multiparty computation-based secure aggregation in blockchain environment. To guarantee practical robustness, we enforce norm constraints on the masked updates via zero-knowledge proof. Moreover, we propose a modified dynamic accumulator which is utilized to realize lightweight anonymous authentication of users. Simulation results show that, compared with state-of-the-art systems, PrSeFL has superior performance on authentication and model training. And the advantage of PrSeFL becomes more significant as the number of users grows.
- Open Access
- 11 August 2023
- Published by MDPI AG in Electronics
- Vol. 12 (16) , 3416
Privacy-Preserving Fine-Grained Redaction with Policy Fuzzy Matching in Blockchain-Based Mobile Crowdsensing
The redactable blockchain has emerged as a promising technique in mobile crowdsensing, allowing users to break immutability in a controlled manner selectively. Unfortunately, current fine-grained redactable blockchains suffer two significant limitations in terms of security and functionality, which severely impede their application in mobile crowdsensing. For security, the transparency of the blockchain allows anyone to access both the data and policy, which consequently results in a breach of user privacy. Regarding functionality, current solutions cannot support error tolerance during policy matching, thereby limiting their applicability in various situations, such as fingerprint-based and face-based identification scenarios. This paper presents a privacy-preserving fine-grained redactable blockchain with policy fuzzy matching, named PRBFM. PRBFM supports fuzzy policy matching and partitions users’ privileges without compromising user privacy. The idea of PRBFM is to leverage threshold linear secret sharing based on the Lagrange interpolation theorem to distribute the decryption keys and chameleon hash trapdoors. Additionally, we have incorporated a privacy-preserving policy matching delegation mechanism into PRBFM to minimize user overhead. Our security analysis demonstrates that PRBFM can defend against the chosen-ciphertext attack. Moreover, experiments conducted on the FISCO blockchain platform show that PRBFM is at least 7.8 times faster than existing state-of-the-art solutions.
- 11 August 2023
- Published by MDPI AG in Electronics
- Vol. 12 (16) , 3416
Open AccessPrivacy-Preserving Fine-Grained Redaction with Policy Fuzzy Matching in Blockchain-Based Mobile Crowdsensing
The redactable blockchain has emerged as a promising technique in mobile crowdsensing, allowing users to break immutability in a controlled manner selectively. Unfortunately, current fine-grained redactable blockchains suffer two significant limitations in terms of security and functionality, which severely impede their application in mobile crowdsensing. For security, the transparency of the blockchain allows anyone to access both the data and policy, which consequently results in a breach of user privacy. Regarding functionality, current solutions cannot support error tolerance during policy matching, thereby limiting their applicability in various situations, such as fingerprint-based and face-based identification scenarios. This paper presents a privacy-preserving fine-grained redactable blockchain with policy fuzzy matching, named PRBFM. PRBFM supports fuzzy policy matching and partitions users’ privileges without compromising user privacy. The idea of PRBFM is to leverage threshold linear secret sharing based on the Lagrange interpolation theorem to distribute the decryption keys and chameleon hash trapdoors. Additionally, we have incorporated a privacy-preserving policy matching delegation mechanism into PRBFM to minimize user overhead. Our security analysis demonstrates that PRBFM can defend against the chosen-ciphertext attack. Moreover, experiments conducted on the FISCO blockchain platform show that PRBFM is at least 7.8 times faster than existing state-of-the-art solutions.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE MultiMedia
- Vol. 30 (2) , 81-90
Blockchain-Empowered Privacy-Preserving Digital Object Trading in the Metaverse
The metaverse is an advanced digital world where users can have interactive and immersive experiences. Users enter the metaverse through digital objects created by extended reality and digital twin technologies. The ownership issue regarding these digital objects can be solved by the blockchain-based non-fungible token (NFT), which is of vital importance for the economics of the metaverse. Users can utilize NFTs to engage in various social and economic activities. However, current NFT protocols expose the owner information to the public, which may contradict with the privacy requirement. In this paper, we propose a protocol NFTPrivate that can realize anonymous and confidential trading of digital objects. The key idea is to utilize cryptographic commitments to hide users’ addresses. By constructing proper zero-knowledge proofs, the owner can initiate privacy-preserving yet publicly verifiable transactions. Illustrative results show that the proposed protocol has higher computation and storage overhead than traditional NFT protocols. While we think this is an acceptable compromise for privacy protection.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE MultiMedia
- Vol. 30 (2) , 81-90
Blockchain-Empowered Privacy-Preserving Digital Object Trading in the Metaverse
The metaverse is an advanced digital world where users can have interactive and immersive experiences. Users enter the metaverse through digital objects created by extended reality and digital twin technologies. The ownership issue regarding these digital objects can be solved by the blockchain-based non-fungible token (NFT), which is of vital importance for the economics of the metaverse. Users can utilize NFTs to engage in various social and economic activities. However, current NFT protocols expose the owner information to the public, which may contradict with the privacy requirement. In this paper, we propose a protocol NFTPrivate that can realize anonymous and confidential trading of digital objects. The key idea is to utilize cryptographic commitments to hide users’ addresses. By constructing proper zero-knowledge proofs, the owner can initiate privacy-preserving yet publicly verifiable transactions. Illustrative results show that the proposed protocol has higher computation and storage overhead than traditional NFT protocols. While we think this is an acceptable compromise for privacy protection.
- Open Access
- 28 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4494
A Blockchain-Based Data Sharing System with Enhanced Auditability
Cloud platforms provide a low-cost and convenient way for users to share data. One important issue of cloud-based data sharing systems is how to prevent the sensitive information contained in users’ data from being disclosed. Existing studies often utilize cryptographic primitives, such as attribute-based encryption and proxy re-encryption, to protect data privacy. These approaches generally rely on a centralized server which may cause a single point of failure problem. Blockchain is known for its ability to solve such a problem. Some blockchain-based approaches have been proposed to realize privacy-preserving data sharing. However, these approaches did not fully explore the auditability provided by the blockchain. The dishonest cloud server can share data with a requester without notifying the data owner or being logged by the blockchain. In this paper, we propose a blockchain-based privacy-preserving data sharing system with enhanced auditability. The proposed system follows the idea of hybrid encryption to protect data privacy. The data to be shared are encrypted with a symmetric key, and the symmetric key is encrypted with a joint public key which is the sum of multiple blockchain nodes’ public keys. Only if a data requester is authorized, the blockchain nodes will be triggered to execute a verifiable key switch protocol. By using the output of the protocol, the data requester can get the plaintext of the symmetric key. The blockchain nodes participate in both the authorization process and the key switch process, which means the behavior of the data requester is witnessed by multi-parties and is auditable. We implement the proposed system on Hyperledger Fabric. The simulation results show that the performance overhead is acceptable.
- 28 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4494
Open AccessA Blockchain-Based Data Sharing System with Enhanced Auditability
Cloud platforms provide a low-cost and convenient way for users to share data. One important issue of cloud-based data sharing systems is how to prevent the sensitive information contained in users’ data from being disclosed. Existing studies often utilize cryptographic primitives, such as attribute-based encryption and proxy re-encryption, to protect data privacy. These approaches generally rely on a centralized server which may cause a single point of failure problem. Blockchain is known for its ability to solve such a problem. Some blockchain-based approaches have been proposed to realize privacy-preserving data sharing. However, these approaches did not fully explore the auditability provided by the blockchain. The dishonest cloud server can share data with a requester without notifying the data owner or being logged by the blockchain. In this paper, we propose a blockchain-based privacy-preserving data sharing system with enhanced auditability. The proposed system follows the idea of hybrid encryption to protect data privacy. The data to be shared are encrypted with a symmetric key, and the symmetric key is encrypted with a joint public key which is the sum of multiple blockchain nodes’ public keys. Only if a data requester is authorized, the blockchain nodes will be triggered to execute a verifiable key switch protocol. By using the output of the protocol, the data requester can get the plaintext of the symmetric key. The blockchain nodes participate in both the authorization process and the key switch process, which means the behavior of the data requester is witnessed by multi-parties and is auditable. We implement the proposed system on Hyperledger Fabric. The simulation results show that the performance overhead is acceptable.