Quantum Byzantine Agreement via Hardy correlations and entanglement swapping

Abstract

We present a device-independent quantum scheme for the {\em Byzantine Generals} problem. The protocol is for three parties. Party $C$ is to send two identical one bit messages to parties $A$ and $B$. The receivers $A$ and $B$ may exchange two one bit messages informing the other party on the message received from $C$. A bit flipping error in one of the transmissions, does not allow the receiving parties to establish what was the message of $C$. Our quantum scheme has the feature that if the messages of the Byzantine protocol are readable (that is give an unambiguous bit value for any of the receivers), then any error by $C$ (cheating by one of the commanding general) is impossible. $A$ and $B$ do not have to exchange protocol messages to be sure of this.

The protocol presented here is a solution of the original Byzantine agreement problem and not its sub-problem like detectable Byzantine agreement. Comments are welcome

References in corpus (2)

• Experimental demonstration of a quantum protocol for Byzantine agreement and liar detection
• Device-independent bounds for Hardy's experiment

Cited by in corpus (6)

• Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution
• Experimental Quantum Byzantine Agreement on a Three-User Quantum Network with Integrated Photonics
• Multi-party Quantum Byzantine Agreement Without Entanglement
• The Hardy's nonlocality argument
• Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement
• Asymptotically secure All-or-nothing Quantum Oblivious Transfer