Authenticated Algorithms for Byzantine Agreement

作者: D. Dolev , H. R. Strong

DOI: 10.1137/0212045

关键词:

摘要: Reaching agreement in a distributed system the presence of faulty processors is central issue for reliable computer systems. Using an authentication protocol, one can limit undetected behavior to simple failure relay messages all intended targets. In this paper we show that, spite such ability behavior, and no matter what message types or protocols are allowed, reaching (Byzantine) requires at least $t + 1$ phases rounds information exchange, where t upper bound on number processors. We present algorithms based that require total sent by correctly operating polynomial both processors, n. The best algorithm uses only $O(nt)$ messages.

参考文章(0)