Quantum Byzantine Agreement for Any Number of Dishonest Parties
Reaching agreement in the presence of arbitrary faults is a fundamental problem in distributed computation, which has been shown to be unsolvable if one-third of the processes can fail, unless signed messages are used. In this paper, we propose a solution to a variation of the original BA problem, c...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |