|
|
| Line 22: |
Line 22: |
|
| |
|
| ==Notations Used== | | ==Notations Used== |
| **<math>n:</math> number of nodes
| | * <math>N</math> number of network nodes taking part in the anonymous transmission. |
| **<math>t:</math> number of failures
| | * <math>|\psi\rangle</math> quantum message which the sender wants to send anonymously |
| **<math>p:</math> fairness of the Oblivious Common Coin
| | * <math>S</math> the sender of the quantum message |
| **<math>k:</math> security parameter of the VQSS scheme used to implement the Oblivious Common Coin
| | * <math>R</math> the receiver of the quantum message |
| **<math>b_i:</math> input bit of player <math>i</math>
| |
| **<math>d:</math> the agreement value at the end of the protocol
| |
| | |
| ===Relevant Parameters===
| |
| The number of players <math>n</math> and the number of failures <math>t</math> are previously introduced parameters of the agreement protocol. The Quantum Oblivious Common Coin protocol has a single parameter <math>k</math> (used in Verified Quantum Secret Sharing scheme), but it is unclear from the works [[Quantum Byzantine Agreement#References|(1), (3)]] how this influences the guarantees of the protocol. Also note that the fairness <math>p</math> of the Quantum Oblivious Common Coin is not a parameter, but rather a result of the specific implementation of the protocol. The global Byzantine Agreement protocol can then tolerate up to <math>t < \left \lfloor{pn}\right \rfloor </math>. The Quantum Oblivious Common Coin subroutine proposed by [[Quantum Byzantine Agreement#References|(3)]] has <math>p > \frac{1}{3}</math> (synchronous case, <math>p > \frac{1}{4}</math> asynchronous case).
| |
|
| |
|
| ==Hardware Requirements== | | ==Hardware Requirements== |