Byzantine agreement secure against general adversaries in the dual failure model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1693, Issue , 1999, Pages 123-139

  Altmann, Bernd ^a   Fitzi, Matthias ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Active adversary; Broadcast; Byzantine agreement; Fail corruption; Unconditional security

Indexed keywords

BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS;

ACTIVE ADVERSARY; ADVERSARY MODELING; BROADCAST PROTOCOLS; BYZANTINE AGREEMENT; EFFICIENT PROTOCOLS; FAIL-CORRUPTION; THRESHOLD CONDITION; UNCONDITIONAL SECURITY;

CRIME;

EID: 84947940400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48169-9_9     Document Type: Conference Paper

References (13)

1. A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 42-51, Vancouver, British Columbia, Canada, 10-12 Aug. 1987. 125
2. P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pp. 410-415, Research Triangle Park, North Carolina, 30 Oct.-1 Nov. 1989. IEEE. 125
3. B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, Mar. 1992. 125
4. D. Dolev, M. J. Fischer, R. Fowler, N. A. Lynch, and H. R. Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257-274, Mar. 1982. 125
5. P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 148-161, 1988. 125
6. M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In Distributed Computing — DISC, volume 1499, pp. 134-148, 1998. 125, 125, 125, 132, 132, 137, 137, 138
7. J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement in t + 1 rounds (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 31-41, San Diego, California, 16- 18 May 1993. 125
8. J. A. Garay and K. J. Perry. A continuum of failure models for distributed computing. In A. Segall and S. Zaks, editors, Distributed Algorithms, 6th International Workshop, WDAG ’92, volume 647 of Lecture Notes in Computer Science, pp. 153-165, Haifa, Israel, 2-4 Nov. 1992. Springer. 125, 125, 125, 126, 127, 132, 132, 132, 137, 137
9. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), pp. 25-34, Aug. 1997. 125, 127
10. L. Lamport and M. J. Fischer. Byzantine generals and transaction commit protocols. Technical report, SRI International (Menlo Park CA), TR, 1982. 125
11. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982. 125
12. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, Apr. 1980. 125, 127
13. S. Toueg, K. J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445-457, June 1987. 125