Multi-party Quantum Byzantine Consensus Based on Full Quantum One-Way Function

In distributed systems, Byzantine consensus serves as a practical approach to addressing the Byzantine general problem. Previous research has exploited quantum resources to develop quantum detectable Byzantine consensus protocols, aiming to surpass the 1/3 fault tolerance bound. However, these consensus protocols are designed under the assumption of secure channel. They ignored malicious participants’ attacks on the communication process. In this paper, we introduce a new quantum protocol for quantum Byzantine consensus utilizing the full quantum one-way function, which is the foundation for generating verification state in list distribution phase and secure message in agreement phase. By relying on the quantum circuit of the full quantum one-way function, the honest participants are able to reach consensus, while the malicious participants are effectively detected. In order to enhance the scalability of the proposed quantum Byzantine consensus protocol, we categorize the participants into three-member groups when the number of participants is n>3 . Meanwhile, the election of commander is introduced in agreement phase. In the proposed multi-party quantum Byzantine consensus protocol, the full quantum one-way function verifies the honesty of the participants in both list distribution phase and agreement phase. Security analysis demonstrates that the proposed multi-party quantum Byzantine consensus protocol is secure against quantum attacks and the dishonest behaviors of participants.