Secure and efficient asynchronous broadcast protocols

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

Volumn 2139, Issue , 2001, Pages 524-541

  Cachin, Christian ^a   Kursawe, Klaus ^a   Petzold, Frank ^a   Shoup, Victor ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST PROTOCOLS; BYZANTINE AGREEMENT; BYZANTINE GENERALS PROBLEM; EXTERNAL VALIDITIES; FAULT TOLERANT DISTRIBUTED SYSTEMS; FUNDAMENTAL BUILDING BLOCKS; MALICIOUS ADVERSARIES; THRESHOLD CRYPTOGRAPHY;

BROADCASTING; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK SECURITY; ATOMS; CRYPTOGRAPHY;

CRYPTOGRAPHY; NETWORK SECURITY;

EID: 84880899710     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44647-8_31     Document Type: Article

References (20)

1. M. Ben-Or and R. El-Yaniv, "Interactive consistency in constant time." Manuscript, 1991.
2. M. Ben-Or, R. Canetti, and O. Goldreich, "Asynchronous secure computation," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), 1993.
3. P. Berman and J. A. Garay, "Randomized distributed agreement revisited," in Proc. 23th International Symposium on Fault-Tolerant Computing (FTCS-23), pp. 412-419, 1993.
4. G. Bracha and S. Toueg, "Asynchronous consensus and broadcast protocols," Journal of the ACM, vol. 32, pp. 824-840, Oct. 1985.
5. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols." Cryptology ePrint Archive, Report 2001/006, Mar. 2001. http://eprint.iacr.org/.
6. C. Cachin, K. Kursawe, and V. Shoup, "Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography," in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123-132, 2000. Full version available from Cryptology ePrint Archive, Report 2000/034, http://eprint.iacr.org/.
7. R. Canetti and T. Rabin, "Fast asynchronous Byzantine agreement with optimal resilience," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42-51, 1993. Updated version available from http://www.research.ibm.com/security/.
8. T. D. Chandra and S. Toueg, "Unreliable failure detectors for reliable distributed systems," Journal of the ACM, vol. 43, no. 2, pp. 225-267, 1996.
9. M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of distributed consensus with one faulty process," Journal of the ACM, vol. 32, pp. 374-382, Apr. 1985.
10. V. Hadzilacos and S. Toueg, "Fault-tolerant broadcasts and related problems," in Distributed Systems (S. J. Mullender, ed.), New York: ACM Press & Addison-Wesley, 1993. An expanded version appears as Technical Report TR94-1425, Department of Computer Science, Cornell University, Ithaca NY, 1994.
11. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, vol. 21, pp. 558-565, July 1978.
12. L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382-401, July 1982.
13. M. Naor, B. Pinkas, and O. Reingold, "Distributed pseudo-random functions and KDCs," in Advances in Cryptology: EUROCRYPT '99 (J. Stern, ed.), vol. 1592 of Lecture Notes in Computer Science, Springer, 1999.
14. K. J. Perry, "Randomized Byzantine agreement," IEEE Transactions on Software Engineering, vol. 11, pp. 539-546, June 1985.
15. M. O. Rabin, "Randomized Byzantine generals," in Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 403-409, 1983.
16. M. Reiter, "Secure agreement protocols: Reliable and atomic group multicast in Rampart," in Proc. 2nd ACM Conference on Computer and Communications Security, 1994.
17. M. K. Reiter and K. P. Birman, "How to securely replicate services," ACM Transactions on Programming Languages and Systems, vol. 16, pp. 986-1009, May 1994.
18. V. Shoup, "Practical threshold signatures," in Advances in Cryptology: EUROCRYPT 2000 (B. Preneel, ed.), vol. 1087 of Lecture Notes in Computer Science, pp. 207-220, Springer, 2000.
19. V. Shoup and R. Gennaro, "Securing threshold cryptosystems against chosen ci-phertext attack," in Advances in Cryptology: EUROCRYPT '98 (K. Nyberg, ed.), vol. 1403 of Lecture Notes in Computer Science, Springer, 1998.
20. R. Turpin and B. A. Coan, "Extending binary Byzantine agreement to multivalued Byzantine agreement," Information Processing Letters, vol. 18, pp. 73-76, 1984.