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 23: | Line 23: | ||
* 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> | * 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> | ||
<div style='text-align: right;'>''*contributed by Bas Dirke''</div> | <div style='text-align: right;'>''*contributed by Bas Dirke''</div> |