Write
262
edits
Fast Quantum Byzantine Agreement: Difference between revisions
→Assumptions
No edit summary |
|||
| Line 7: | Line 7: | ||
==Assumptions== | ==Assumptions== | ||
* '''Network:''' The network consists of <math>n</math> players that are fully identified and [[completely connected]] with pairwise [[authenticated]] classical and quantum channels. | * '''Network:''' The network consists of <math>n</math> players that are fully identified and [[completely connected]] with pairwise [[authenticated]] classical and quantum channels. | ||
* '''Timing:''' The [[ | * '''Timing:''' The [[synchronous]] and [[asynchronous]] timing models are both considered. | ||
* '''Message size:''' The size of messages (quantum and classical) are unbounded. | * '''Message size:''' The size of messages (quantum and classical) are unbounded. | ||
* '''Shared resources:''' The nodes do not share any prior entanglement or classical correlations. | * '''Shared resources:''' The nodes do not share any prior entanglement or classical correlations. | ||
* '''Failure:''' At most <math>t < n/3</math> (synchronous) or <math>t < n/4</math> (asynchronous) players show Byzantine failures. The Byzantine failed players are allowed to behave arbitrarily and collude to try and prevent the honest players from reaching agreement. The most severe model is used: Byzantine failures are [[adaptive]], [[computationally unbounded]] and have [[full-information]] (full information of quantum states is modeled by giving a classical description of the state to the adversaries). Failures on the communication channels are not considered. | * '''Failure:''' At most <math>t < n/3</math> (synchronous) or <math>t < n/4</math> (asynchronous) players show Byzantine failures. The Byzantine failed players are allowed to behave arbitrarily and collude to try and prevent the honest players from reaching agreement. The most severe model is used: Byzantine failures are [[adaptive]], [[computationally unbounded]] and have [[full-information]] (full information of quantum states is modeled by giving a classical description of the state to the adversaries). Failures on the communication channels are not considered. | ||
==Outline== | ==Outline== | ||