Efficient byzantine agreement secure against general adversaries

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

Volumn 1499, Issue , 1998, Pages 134-148

  Fitzi, Matthias ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Broadcast; Byzantine agreement; Fault detection; General adversary; Multiparty computation

Indexed keywords

BROADCASTING; FAULT DETECTION;

ADVERSARY STRUCTURES; BYZANTINE AGREEMENT; COMPUTATION COMPLEXITY; GENERAL ADVERSARY; MULTIPARTY COMPUTATION; RELIABLE BROADCAST; SECURE MULTI-PARTY COMPUTATION; SPAN PROGRAMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947907604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056479     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, pages 42-51, 1987.
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, pages 410-415. IEEE, 1989.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 1-10, 1988.
4. D. Chaum, C. Crépeau, and I. Damgs Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 11-19, 1988.
5. R. Cramer, I. Damgs and U. Maurer. Span programs and general secure multi-party computation, Manuscript, 1998.
6. 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, March 1982.
7. M. J. Fischer and N. A. Lynch. A lower bound on the time to assure interactive consistency. Information Processing Letters, 14(4):183-186, 1982.
8. P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 148-161, 1988.
9. 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, pages 31-41, 1993.
10. 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), pages 25-34, August 1997.
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.
12. D. Malkhi and M. Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569-578, 1997.
13. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.