Resilient-optimal interactive consistency in constant time

Distributed Computing

Volumn 16, Issue 4, 2003, Pages 249-262

  Ben Or, Michael ^a   El Yaniv, Ran ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Broadcast channels; Byzantine agreement; Distributed systems; Fault tolerance; Interactive consistency

Indexed keywords

ALGORITHMS; BROADCASTING; CHANNEL CAPACITY; FAULT TOLERANT COMPUTER SYSTEMS; INTERACTIVE DEVICES; NETWORK PROTOCOLS; PROGRAM PROCESSORS; TELECOMMUNICATION LINES;

ASYNCHRONOUS NETWORKS; BROADCAST CHANNELS; INTERACTIVE CONSISTENCY; SYNCHRONOUS NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0346342609     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0083-3     Document Type: Article

References (18)

1. H. Attiya, J. Welch. Distributed Computing Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998
2. J. Bar-Ilan, D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In PODC, pages 201-209, 1989
3. D. Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. J. of Cryptology, 4:75-122, 1991
4. D. Beaver, S. Micali, P. Rogaway. The round complexity of secure protocols. In STOC, pages 503-513, 1990
5. M. Ben-Or. Fast asynchronous Byzantine agreement. In PODC, pages 149-151, 1985
6. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC, pages 1-10, 1988
7. G. Bracha. An asynchronous (n - 1)/3-resilient consensus protocol. In PODC, pages 154-162, 1984
8. R. Canetti. Security and composition of multiparty cryptographic protocols. J. of Cryptology, 13(1):143-202, 1991 online version at http://philby.ucsd.edu/cryptolib/1998/98-18.html.
9. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, 2001
10. R. Canetti, T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In STOC, pages 42-51, 1993. Updated version: http://www.research.ibm.com/security/cr-ba.ps
11. D. Chaum, C. Crépeau, I. Damgård. Multiparty unconditionally secure protocols. In STOC, pages 11-19, 1988
12. B. Chor, C. Dwork. Randomization in Byzantine agreement. In: S. Micali, editor, Advances in Computing Research Vol. 5: Randomness and Computation, pages 443-497. 1989
13. P. Feldman. Optimal Algorithms for Byzantine Agreements. PhD thesis, MIT, 1988
14. P. Feldman, S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, 1997. A preliminary version of this paper appeared at STOC 1988
15. S. Micali, T. Rabin. Collective coin tossing without assumptions nor broadcasting. In CRYPTO, pages 253-266, 1990
16. S. Micali, P. Rogaway. Secure computation. In CRYPTO, pages 392-404, 1991
17. M. Pease, R. Shostak, L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2): 191-205, 1980
18. R. Turpin, B.A. Coan. extending binary byzantine agreement to multivalued byzantine agreement. Information Processing Letters, 18:73-76, 1984