Optimistic asynchronous atomic broadcast

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 204-215

  Kursawe, Klaus ^a   Shoup, Victor ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCIDENT PREVENTION; BROADCASTING; TELECOMMUNICATION NETWORKS;

ASYNCHRONOUS NETWORKS; ATOMIC BROADCAST; CIRCUMSTANCES;

NETWORK PROTOCOLS;

EID: 26444598450     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_17     Document Type: Conference Paper

References (14)

1. [A+95] E. Anceaume, B. Charron-Bost, P. Minet, and S. Toueg. On the formal specification of group membership services. Tech. Rep. TR95-1534, Cornell University, Computer Science Department, 1995.
2. [BR93] M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conf. on Computer and Communications Security, pp. 62-73, 1993.
3. [B84] G. Bracha. An asynchronous [(n - 1)/3]-resilient consensus protocol. In Proc. of the 3rd Ann. ACM Symp. on Principles of Distributed Computing, pp. 154-162, 1984.
4. [C00] M. Castro. Practical Byzantine Fault Tolerance. PhD thesis, Massachusetts Institute of Technology, 2000.
5. [C+01] C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology - Crypto 2001, pp. 524-541, 2001.
6. [C+00] C. Cachin, K. Kursawe, and V. Shoup. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 123-132, 2000.
7. [CL99a] M. Castro and B. Liskov. Authenticated byzantine fault tolerance without public-key cryptography. Tech. Memo MIT/LCS/TM-589, MIT Laboratory for Computer Science, 1999.
8. [CL99b] M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. 3rd Symp. Operating Systems Design and Implementation, 1999.
9. [CR93] R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. 25th Ann. ACM Symp. on Theory of Computing, pp. 42-51, 1993.
10. [D+00] Doudou, Guerraoui, and Garbinato. Abstractions for devising byzantine-resilient state machine replication. In SRDS: 19th Symp. on Reliable Distributed Systems, 2000.
11. [F+85] M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985.
12. [K+98] K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In 31st Hawaii International Conference on System Sciences, pp. 317-326, 1998.
13. [KS01] K. Kursawe, V. Shoup. Optimistic asynchronous atomic broadcast. Cryptology ePrint Archive, Report 2001/022, http://eprint.iacr.org, 2001.
14. [R94] M. K. Reiter. Secure agreement protocols: Reliable and atomic group multicast in Rampart. In Proc. of the 2nd ACM Conference on Computer and Communication Security, pp. 68-80, 1994.