Quantum Byzantine agreement

Byzantine fault tolerant protocols are algorithms that are robust to arbitrary types of failures in distributed algorithms. The Byzantine agreement protocol is an essential part of this task. The constant-time quantum version of the Byzantine protocol, ^[1] is described below.

Introduction

The Byzantine Agreement protocol is a protocol in distributed computing. It takes its name from a problem formulated by Lamport, Shostak and Pease in 1982, ^[2] which itself is a reference to a historical problem. The Byzantine army was divided into divisions with each division being led by a General with the following properties:

• Each General is either loyal or a traitor to the Byzantine state.
• All Generals communicate by sending and receiving messages.
• There are only two commands: attack and retreat.
• All loyal Generals should agree on the same plan of action: attack or retreat.
• A small linear fraction of bad Generals should not cause the protocol to fail (less than a ${\displaystyle {\tfrac {1}{3}}}$ fraction).

(See ^[3] for the proof of the impossibility result). The problem usually is equivalently restated in the form of a commanding General and loyal Lieutenants with the General being either loyal or a traitor and the same for the Lieutenants with the following properties.

• All loyal Lieutenants carry out the same order.
• If the commanding General is loyal, all loyal Lieutenants obey the order that he sends.
• A strictly less than ${\displaystyle {\tfrac {1}{3}}}$ fraction including the commanding General are traitors.

Byzantine failure and resilience

Failures in an algorithm or protocol can be categorized into three main types:

1. A failure to take another execution step in the algorithm: This is usually referred to as a "fail stop" fault.
2. A random failure to execute correctly: This is called a "random fault" or "random Byzantine" fault.
3. An arbitrary failure where the algorithm fails to execute the steps correctly (usually in a clever way by some adversary to make the whole algorithm fail) which also encompasses the previous two types of faults; this is called a "Byzantine fault".

A Byzantine resilient or Byzantine fault tolerant protocol or algorithm is an algorithm that is robust to all the kinds of failures mentioned above. For example, given a space shuttle with multiple redundant processors, if the processors give conflicting data, which processors or sets of processors should be believed? The solution can be formulated as a Byzantine fault tolerant protocol.

Sketch of the algorithm

We will sketch here the asynchronous algorithm ^[1] The algorithm works in two phases:

• Phase 1 (Communication phase):

All messages are sent and received in this round.

A coin flipping protocol is a procedure that allows two parties A and B that do not trust each other to toss a coin to win a particular object.

There are two types of coin flipping protocols

• weak coin flipping protocols: ^[4] The two players A and B initially start with no inputs and they are to compute some value ${\displaystyle c_{A},c_{B}\in [0,1]}$ and be able to accuse anyone of cheating. The protocol is successful if A and B agree on the outcome. The outcome 0 is defined as A winning and 1 as B winning. The protocol has the following properties:
  • If both players are honest (they follow the protocol), then they agree on the outcome of the protocol ${\displaystyle c_{A}=c_{B}}$ with ${\displaystyle Pr(c_{A}=c_{B}=b)={\tfrac {1}{2}}}$ for ${\displaystyle a,b\in \{0,1\}}$.
  • If one of the players is honest (i.e., the other player may deviate arbitrarily from the protocol in his or her local computation), then the other party wins with probability at most ${\displaystyle {\tfrac {1}{2}}+\epsilon }$. In other words, if B is dishonest, then ${\displaystyle Pr(c_{A}=c_{B}=1)\leq {\tfrac {1}{2}}+\epsilon }$, and if A is dishonest, then ${\displaystyle Pr(c_{A}=c_{B}=0)\leq {\tfrac {1}{2}}+\epsilon }$.
• A strong coin flipping protocol: In a strong coin flipping protocol, the goal is instead to produce a random bit which is biased away from any particular value 0 or 1. Clearly, any strong coin flipping protocol with bias ${\displaystyle \epsilon }$ leads to weak coin flipping with the same bias.

Verifiable secret sharing

• A verifiable secret sharing protocol: A (n,k) secret sharing protocol allows a set of n players to share a secret, s such that only a quorum of k or more players can discover the secret. The player sharing (distributing the secret pieces) the secret is usually referred to as the dealer. A verifiable secret sharing protocol differs from a basic secret sharing protocol in that players can verify that their shares are consistent even in the presence of a malicious dealer.

The fail-stop protocol

Protocol quantum coin flip for player

1. Round 1 generate the GHZ state ${\displaystyle |\mathrm {Coin} _{i}\rangle ={\tfrac {1}{\sqrt {2}}}|0,0,\ldots ,0\rangle +{\tfrac {1}{\sqrt {2}}}|1,1,\ldots ,1\rangle }$ on ${\displaystyle n}$ qubits and send the ${\displaystyle k}$th qubit to the ${\displaystyle k}$th player keeping one part
2. Generate the state ${\displaystyle |\mathrm {Leader} _{i}\rangle ={\tfrac {1}{n^{3/2}}}\sum \nolimits _{a=1}^{n^{3}}|a,a,\ldots ,a\rangle }$ on ${\displaystyle n}$ qudits (quantum-computing components consistent of multiple qubits), an equal superposition of the numbers between 1 and ${\displaystyle n^{3}}$. Distribute the ${\displaystyle n}$ qudits between all the players ^[1]
3. Receive the quantum messages from all players and wait for the next communication round, thus forcing the adversary to choose which messages were passed.
4. Round 2: Measure (in the standard base) all ${\displaystyle \mathrm {Leader} _{j}}$ qubits received in round I. Select the player with the highest leader value (ties broken arbitrarily) as the "leader" of the round. Measure the leader's coin in the standard base.
5. Set the output of the QuantumCoinFlip protocol: ${\displaystyle v_{i}}$ = measurement outcome of the leader's coin.

The Byzantine protocol

To generate a random coin assign an integer in the range [0,n-1] to each player and each player is not allowed to choose its own random ID as each player ${\displaystyle P_{k}}$ selects a random number ${\displaystyle s{_{k}^{i}}}$ for every other player ${\displaystyle P_{i}}$ and distributes this using a verifiable secret sharing scheme.

At the end of this phase players agree on which secrets were properly shared, the secrets are then opened and each player ${\displaystyle P_{i}}$ is assigned the value

${\displaystyle s_{i}=\sum \,{s_{k}^{i}}{\text{for all secrets properly shared}}\mod n}$

This requires private information channels so we replace the random secrets by the superposition ${\displaystyle |\phi \rangle ={\tfrac {1}{\sqrt {n}}}\sum \nolimits _{a=0}^{n-1}|a\rangle }$. In which the state is encoded using a quantum verifiable secret sharing protocol (QVSS). ^[5] We cannot distribute the state ${\displaystyle |\phi ,\phi ,\ldots \phi \rangle }$ since the bad players can collapse the state. To prevent bad players from doing so we encode the state using the Quantum verifiable secret sharing (QVSS) and send each player their share of the secret. Here again the verification requires Byzantine Agreement, but replacing the agreement by the grade-cast protocol is enough. ^{[6] [7]}

Grade-cast protocol

A grade-cast protocol has the following properties using the definitions in ^[6] Informally, a graded broadcast protocol is a protocol with a designated player called “dealer” (the one who broadcasts) such that:

1. If the dealer is good, all the players get the same message.
2. Even if the dealer is bad, if some good player accepts the message, all the good players get the same message (but they may or may not accept it).

A protocol P is said to be achieve graded broadcast if, at the beginning of the protocol, a designated player D (called the dealer) holds a value v, and at the end of the protocol, every player ${\displaystyle P_{i}}$ outputs a pair ${\displaystyle (\mathrm {value} _{i},\mathrm {confidence} _{i})}$ such that the following properties hold: ${\displaystyle (\forall i,\mathrm {confidence} _{i}\in \{0,1,2\})}$

1. If D is honest, then ${\displaystyle \mathrm {value} _{i}}$ = v and ${\displaystyle \mathrm {confidence} _{i}}$ = 2 for every honest player ${\displaystyle P_{i}}$.
2. For any two honest players ${\displaystyle P_{i}}$ and ${\displaystyle P_{j},}$${\displaystyle \vert \mathrm {confidence} _{i}-\mathrm {confidence} _{j}\vert \leq 1}$.
3. (Consistency) For any two honest players ${\displaystyle P_{i}}$ and ${\displaystyle P_{j}}$, if ${\displaystyle \mathrm {confidence} _{i}>0}$ and ${\displaystyle \mathrm {confidence} _{j}>0}$, then ${\displaystyle \mathrm {value} _{i}=\mathrm {value} _{j}}$.

For ${\displaystyle t<{\tfrac {n}{4}}}$ the verification stage of the QVSS protocol guarantees that for a good dealer the correct state will be encoded, and that for any, possibly faulty dealer, some particular state will be recovered during the recovery stage. We note that for the purpose of our Byzantine quantum coin flip protocol the recovery stage is much simpler. Each player measures his share of the QVSS and sends the classical value to all other players. The verification stage guarantees, with high probability, that in the presence of up to ${\displaystyle t<{\tfrac {n}{4}}}$ faulty players all the good players will recover the same classical value (which is the same value that would result from a direct measurement of the encoded state).

Remarks

In 2007, a quantum protocol for Byzantine Agreement was demonstrated experimentally ^[8] using a four-photon polarization-entangled state. This shows that the quantum implementation of classical Byzantine Agreement protocols is indeed feasible.

References

1. Michael Ben-Or; Avinatan Hassidim (2005). Fast quantum byzantine agreement. STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. Baltimore, MD, USA. pp. 481–485. doi:10.1145/1060590.1060662.
2. Lamport, Leslie; Shostak, Robert; Pease, Marshall (1982). "The Byzantine Generals Problem". ACM Transactions on Programming Languages and Systems. 4 (3): 382–401. doi: 10.1145/357172.357176 . ISSN   0164-0925. S2CID   55899582.
3. Fischer, Michael J.; Lynch, Nancy A.; Paterson, Michael S. (1985). "Impossibility of distributed consensus with one faulty process". Journal of the ACM. 32 (2): 374–382. doi: 10.1145/3149.214121 . ISSN   0004-5411. S2CID   207660233.
4. Kerenidis, I.; Nayak, A. (2004). "Weak coin flipping with small bias". Information Processing Letters. 89 (3): 131–135. arXiv: quant-ph/0206121 . doi:10.1016/j.ipl.2003.07.007. ISSN   0020-0190. S2CID   14445949.
5. Crépeau, Claude; Gottesman, Daniel; Smith, Adam (2002). Secure multi-party quantum computation. 34th ACM Symposium on the Theory of Computing, STOC. pp. 643–652. doi:10.1145/509907.510000.
6. Ben-Or, Michael; Pavlov, Elan; Vaikuntanathan, Vinod (2006). "Byzantine agreement in the full-information model in O(log n) rounds". Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06. pp. 179–186. CiteSeerX   10.1.1.296.4133 . doi:10.1145/1132516.1132543. ISBN   1595931341. S2CID   6379620.
7. Feldman, Pesech; Micali, Silvio (1997). "An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement". SIAM Journal on Computing. 26 (4): 873–933. doi:10.1137/S0097539790187084. ISSN   0097-5397.
8. Gaertner, Sascha; Bourennane, Mohamed; Kurtsiefer, Christian; Cabello, Adán; Weinfurter, Harald (2008). "Experimental Demonstration of a Quantum Protocol for Byzantine Agreement and Liar Detection". Physical Review Letters. 100 (7): 070504. arXiv: 0710.0290 . Bibcode:2008PhRvL.100g0504G. doi:10.1103/PhysRevLett.100.070504. ISSN   0031-9007. PMID   18352533. S2CID   30443015.