摘要:
参考文章(20)
Cynthia Dwork, Benny Chor, Randomization in Byzantine Agreement. Adv. Comput. Res.. ,vol. 5, pp. 443- 497 ,(1989)
Oded Goldreich, Foundations of Cryptography Cambridge University Press. ,(2001) , 10.1017/CBO9780511546891
Michael Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols ,(2000)
Jonathan Katz, Chiu-Yuen Koo, On Expected Constant-Round Protocols for Byzantine Agreement Lecture Notes in Computer Science. pp. 445- 462 ,(2006) , 10.1007/11818175_27
Michael O. Rabin, Randomized byzantine generals 24th Annual Symposium on Foundations of Computer Science (sfcs 1983). pp. 403- 409 ,(1983) , 10.1109/SFCS.1983.48
Gabriel Bracha, An O(log n) expected rounds randomized byzantine generals protocol Journal of the ACM. ,vol. 34, pp. 910- 920 ,(1987) , 10.1145/31846.42229
Ran Canetti, Tal Rabin, Fast asynchronous Byzantine agreement with optimal resilience Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. pp. 42- 51 ,(1993) , 10.1145/167088.167105
Michael Ben-Or, Ran El-Yaniv, Resilient-optimal interactive consistency in constant time Distributed Computing. ,vol. 16, pp. 249- 262 ,(2003) , 10.1007/S00446-002-0083-3
Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson, Impossibility of distributed consensus with one faulty process Journal of the ACM. ,vol. 32, pp. 374- 382 ,(1985) , 10.1145/3149.214121
Michael J. Fischer, Nancy A. Lynch, A lower bound for the time to assure interactive consistency Information Processing Letters. ,vol. 14, pp. 183- 186 ,(1981) , 10.1016/0020-0190(82)90033-3