Editing Byzantine Agreement
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
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>. | ||
==Knowledge Graph== | ==Knowledge Graph== |