Write, autoreview, editor, reviewer
3,125
edits
Byzantine Agreement: Difference between revisions
→Further Information
| Line 21: | Line 21: | ||
* Agreement problems are also studied in weaker failure models such as crash-failures. | * Agreement problems are also studied in weaker failure models such as crash-failures. | ||
* Byzantine agreement is equivalent to the closely related problems of Byzantine Generals (in which only one player gets an input bit, which must be correctly communicated to all non-faulty players) and Interactive Consistency (in which all non-faulty players must correctly know the received input bit of each non-faulty player). | * Byzantine agreement is equivalent to the closely related problems of Byzantine Generals (in which only one player gets an input bit, which must be correctly communicated to all non-faulty players) and Interactive Consistency (in which all non-faulty players must correctly know the received input bit of each non-faulty player). | ||
* It is known that no unconditionally secure classical protocol can solve Byzantine Agreement if the number of failures <math> t > n/3</math> | * It is known that no unconditionally secure classical protocol can solve Byzantine Agreement if the number of failures <math> t > n/3</math> while computationally secure classical protocols can can solve the problem for any <math> t < n</math> | ||
==Knowledge Graph== | ==Knowledge Graph== | ||