Modular construction of an efficient 1-bit Byzantine agreement protocol-Reference-Cited by-同舟云学术

Modular construction of an efficient 1-bit Byzantine agreement protocol

Published:1993-03 Issue:1 Volume:26 Page:131-154
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Coan Brian A.,Welch Jennifer L.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01187076.pdf

Reference13 articles.

1. Bar-Noy, A., and Dolov, D. (1991), Consensus algorithms with one-bit messages,Distrib. Comput.4, 105?110.

2. Herman, P., Garay, J. A., and Perry, K. J. (1989), Recursive Phase King Protocols for Distributed Consensus, Technical Report CS-89-24, Department of Computer Science, Pennsylvania State University.

3. Coan, B. A. (1988), Efficient agreement using fault diagnosis, inProceedings of the 26th Allerton Conference on Communication, Control, and Computing, pp. 663?672.

4. Coan, B. A., and Welch, J. L. (1992), Modular construction of a Byzantine agreement protocol with optimal message bit complexity,Inform, and Comput.97, 61?85.

5. Dolev, D. (1982), The Byzantine generals strike again,J. Algorithms 3, 14?30.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Recursion in Distributed Computing;Lecture Notes in Computer Science;2010

2. A flexible formal framework for masking/demasking faults;Information Sciences;2004-01-20

3. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds;SIAM Journal on Computing;1998-02

4. Adaptability and the Usefulness of Hints (Extended Abstract);Algorithms — ESA’ 98;1998

5. Efficient agreement using fault diagnosis;Distributed Computing;1993-12