Haixia Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Haixia Xu has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Huimei Liao
Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
3 shared publicationsPeili Li
Institute of Information Engineering
3 shared publicationsChunying Peng
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
2 shared publications- Chunying Peng
Institute of Information Engineering, CAS
2 shared publications - Huimei Liao
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
2 shared publications Jinling Tang
2 shared publications
Latest Publications
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3584-3596
NunChuck: A Two-Phase Chained BFT Protocol for Tolerating the Partitioning Attack
Popular chained Byzantine Fault Tolerant (BFT) consensus protocols adopt a pipelined paradigm to achieve efficiency. However, these protocols remain vulnerable to critical attacks, such as forking and partitioning. While the two-phase commit rule can prevent forking, it often requires complex or expensive view-change mechanisms. Moreover, our study confirms that partitioning attacks are feasible in many existing chained BFT protocols. This paper devised NunChuck, a fully two-phase chained BFT protocol that ensures linear authenticator complexity, optimistic responsiveness, and resilience to partitioning attacks. NunChuck employs a lightweight certificate-based view-change mechanism to maintain efficiency, and introduces a unified message structure that enables leaders to make progress even under partitioned network conditions. We formally prove its safety and liveness properties. Furthermore, we develop a prototype implementation in Golang and conduct extensive evaluations. The results demonstrate that NunChuck consistently outperforms HotStuff and FastHotStuff, particularly in adversarial environments, with simulated delay analysis further corroborating our experimental findings.
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3584-3596
NunChuck: A Two-Phase Chained BFT Protocol for Tolerating the Partitioning Attack
Popular chained Byzantine Fault Tolerant (BFT) consensus protocols adopt a pipelined paradigm to achieve efficiency. However, these protocols remain vulnerable to critical attacks, such as forking and partitioning. While the two-phase commit rule can prevent forking, it often requires complex or expensive view-change mechanisms. Moreover, our study confirms that partitioning attacks are feasible in many existing chained BFT protocols. This paper devised NunChuck, a fully two-phase chained BFT protocol that ensures linear authenticator complexity, optimistic responsiveness, and resilience to partitioning attacks. NunChuck employs a lightweight certificate-based view-change mechanism to maintain efficiency, and introduces a unified message structure that enables leaders to make progress even under partitioned network conditions. We formally prove its safety and liveness properties. Furthermore, we develop a prototype implementation in Golang and conduct extensive evaluations. The results demonstrate that NunChuck consistently outperforms HotStuff and FastHotStuff, particularly in adversarial environments, with simulated delay analysis further corroborating our experimental findings.
- 14 June 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 174
PChain: A scalable and efficient parallel-chain consensus protocol
- 14 June 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 174
PChain: A scalable and efficient parallel-chain consensus protocol
- Open Access
- 4 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (2) , 69-93
SeaFlame: Communication-Efficient Secure Aggregation for Federated Learning against Malicious Entities
Secure aggregation is a popular solution to ensuring privacy for federated learning. However, when considering malicious participants in secure aggregation, it is difficult to achieve both privacy and high efficiency. Therefore, we propose SeaFlame, a communication-efficient secure aggregation protocol against malicious participants. Inspired by the state-of-the-art work, ELSA, SeaFlame also utilizes two non-colluding servers to ensure privacy against malicious entities and provide defenses against boosted gradients. Crucially, to improve communication efficiency, SeaFlame uses arithmetic sharing together with arithmetic-to-arithmetic share conversion to reduce client communication, and uses the random linear combination to reduce server communication.Security analysis proves that our SeaFlame guarantees privacy against malicious clients colluding with one malicious server. Experimental evaluation demonstrates that, compared to ELSA, SeaFlame optimizes communication by up to 10.5, 6.00, and 8.17 times for a client, a server, and all entities, at the expense of 1.25-1.86 times additional end-to-end runtime.
- 4 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (2) , 69-93
Open AccessSeaFlame: Communication-Efficient Secure Aggregation for Federated Learning against Malicious Entities
Secure aggregation is a popular solution to ensuring privacy for federated learning. However, when considering malicious participants in secure aggregation, it is difficult to achieve both privacy and high efficiency. Therefore, we propose SeaFlame, a communication-efficient secure aggregation protocol against malicious participants. Inspired by the state-of-the-art work, ELSA, SeaFlame also utilizes two non-colluding servers to ensure privacy against malicious entities and provide defenses against boosted gradients. Crucially, to improve communication efficiency, SeaFlame uses arithmetic sharing together with arithmetic-to-arithmetic share conversion to reduce client communication, and uses the random linear combination to reduce server communication.Security analysis proves that our SeaFlame guarantees privacy against malicious clients colluding with one malicious server. Experimental evaluation demonstrates that, compared to ELSA, SeaFlame optimizes communication by up to 10.5, 6.00, and 8.17 times for a client, a server, and all entities, at the expense of 1.25-1.86 times additional end-to-end runtime.
- 14 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 4174-4187
A Flexible and Scalable Malicious Secure Aggregation Protocol for Federated Learning
Secure aggregation becomes a major solution to providing privacy for federated learning. Secure aggregation for mobile devices typically relies on Shamir secret sharing (SSS) to achieve dropout robustness, but limits the system’s corruption and dropout tolerance. Although Prio+, a state-of-the-art method utilizing two non-colluding servers, avoids such limitations, its effectiveness is only against honest-but-curious servers. Thus, this paper presents a novel secure aggregation protocol in the malicious model. The proposed protocol uses a non-colluding server and initiator to achieve almost full (up to n -2) corruption and dropout tolerance, and exploits our discrete-logarithm (DL) extractable and equivocable commitment scheme to achieve malicious security. The proposed protocol’s security is proven in two models: malicious users colluding with the server and malicious users colluding with the initiator. Finally, a prototype of the developed protocol is implemented, with the experimental results demonstrating that our protocol is efficient and suitable for both cross-device and cross-silo federated learning scenarios. Compared with the sum protocol of Prio+, the proposed protocol achieves malicious security with affordable additional overhead, i.e., 4.8 to 6.1 times more computation cost and 2.8 to 2.9 times more communication cost for a single user.
- 14 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 4174-4187
A Flexible and Scalable Malicious Secure Aggregation Protocol for Federated Learning
Secure aggregation becomes a major solution to providing privacy for federated learning. Secure aggregation for mobile devices typically relies on Shamir secret sharing (SSS) to achieve dropout robustness, but limits the system’s corruption and dropout tolerance. Although Prio+, a state-of-the-art method utilizing two non-colluding servers, avoids such limitations, its effectiveness is only against honest-but-curious servers. Thus, this paper presents a novel secure aggregation protocol in the malicious model. The proposed protocol uses a non-colluding server and initiator to achieve almost full (up to n -2) corruption and dropout tolerance, and exploits our discrete-logarithm (DL) extractable and equivocable commitment scheme to achieve malicious security. The proposed protocol’s security is proven in two models: malicious users colluding with the server and malicious users colluding with the initiator. Finally, a prototype of the developed protocol is implemented, with the experimental results demonstrating that our protocol is efficient and suitable for both cross-device and cross-silo federated learning scenarios. Compared with the sum protocol of Prio+, the proposed protocol achieves malicious security with affordable additional overhead, i.e., 4.8 to 6.1 times more computation cost and 2.8 to 2.9 times more communication cost for a single user.
- 21 November 2023
- Published by Springer Nature
- p. 460-477
Redactable Blockchain in the Permissioned Setting
- 21 November 2023
- Published by Springer Nature
- p. 460-477
Redactable Blockchain in the Permissioned Setting
- 21 November 2023
- Published by Springer Nature
- p. 367-385
Adaptively Secure Constrained Verifiable Random Function
- 21 November 2023
- Published by Springer Nature
- p. 367-385
Adaptively Secure Constrained Verifiable Random Function
- 30 September 2022
- Published by Springer Nature
- p. 68-84
Redactable Blockchain with Fine-Grained Autonomy and Transaction Rollback
- 30 September 2022
- Published by Springer Nature
- p. 68-84
Redactable Blockchain with Fine-Grained Autonomy and Transaction Rollback
- 30 September 2022
- Published by Springer Nature
- p. 87-104
Pitch in: A Secure Extension Signature Based on SM9
- 30 September 2022
- Published by Springer Nature
- p. 87-104
Pitch in: A Secure Extension Signature Based on SM9
- Open Access
- 23 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
Accountable Monero System with Privacy Protection
Monero is one of the prominent cryptocurrencies bringing robust privacy safeguard levels. However, for Monero lacking accountability, it is easy to use anonymity and privacy for committing the crime without the leakage of identity. And some exchanges are not very receptive to Monero. The purpose of this study is to balance privacy and accountability in Monero. Specifically, we studied the way to provide accountability while keeping privacy. We develop an accountable Monero model. Our model isolates three kinds of roles, users, the trusted registration authority, and a trusted regulator. Accountability enables the trusted regulator to reveal the signer’s identity. Only the trusted regulator can trace users’ public keys as needed. We give a construction for the accountable Monero system by combining CryptoNote protocol with ElGamal encryption. Our instantiation is with a marginal influence on efficiency. The security of our scheme is based on the discrete logarithm and decisional Diffie–Hellman assumption.
- 23 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
Open AccessAccountable Monero System with Privacy Protection
Monero is one of the prominent cryptocurrencies bringing robust privacy safeguard levels. However, for Monero lacking accountability, it is easy to use anonymity and privacy for committing the crime without the leakage of identity. And some exchanges are not very receptive to Monero. The purpose of this study is to balance privacy and accountability in Monero. Specifically, we studied the way to provide accountability while keeping privacy. We develop an accountable Monero model. Our model isolates three kinds of roles, users, the trusted registration authority, and a trusted regulator. Accountability enables the trusted regulator to reveal the signer’s identity. Only the trusted regulator can trace users’ public keys as needed. We give a construction for the accountable Monero system by combining CryptoNote protocol with ElGamal encryption. Our instantiation is with a marginal influence on efficiency. The security of our scheme is based on the discrete logarithm and decisional Diffie–Hellman assumption.
- 17 September 2021
- Published by Springer Nature
- p. 3-21
The Golden Snitch: A Byzantine Fault Tolerant Protocol with Activity
- 17 September 2021
- Published by Springer Nature
- p. 3-21
The Golden Snitch: A Byzantine Fault Tolerant Protocol with Activity