Random oracles in constantinople: Practical asynchronous Byzantine agreement using cryptography

Journal of Cryptology

Volumn 18, Issue 3, 2005, Pages 219-246

  Cachin, Christian ^a   Kursawe, Klaus ^b   Shoup, Victor ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

BYZANTINE AGREEMENT; COIN-TOSSING PROTOCOL; COMMUNICATION COMPLEXITY; THRESHOLD SIGNATURES;

CRYPTOGRAPHY;

EID: 22344451864     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-005-0318-0     Document Type: Article

References (50)

1. N. Asokan, V. Shoup, and M. Waidner, Optimistic fair exchange of digital signatures, IEEE Journal on Selected Areas in Communications, vol. 18, pp. 591-610, Apr. 2000.
2. D. Beaver and N. So, Global, unpredictable bit generation without broadcast, in Advances in Cryptology: EUROCRYPT '93 (T. Helleseth, ed.), pp. 424-434, vol. 765 of Lecture Notes in Computer Science, Springer, Berlin, 1994.
3. M. Bellare, R. Canetti, and H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols, in Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 419-428, 1998.
4. M. Bellare and P. Rogaway, Entity authentication and key distribution, manuscript; preliminary version at Crypto '93, 1993.
5. M. Bellare and P. Rogaway, Provably secure session key distribution - the three party case, in Proc. 21th Annual ACM Symposium on Theory of Computing (STOC), pp. 57-66, 1995.
6. M. Ben-Or, Another advantage of free choice: completely asynchronous agreement protocols, in Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 27-30, 1983.
7. P. Berman and J. A. Garay, Randomized distributed agreement revisited, in Proc. 23rd International Symposium on Fault-Tolerant Computing (FTCS-23), pp. 412-419, 1993.
8. C. Boyd, Public-key cryptography and re-usable shared secrets, in Cryptography and Coding (H. Baker and F. Piper, eds.), pp. 241-246, Clarendon Press, Oxford, 1989.
9. G. Bracha, An asynchronous [(n - 1)/3]-resilient consensus protocol, in Proc. 3rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 154-162, 1984.
10. C. Cachin, An asynchronous protocol for distributed computation of RSA inverses and its applications, in Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 153-162, 2003.
11. C. Cachin, Modeling complexity in secure distributed computing, in Future Directions in Distributed Computing (A. Schiper, A. A. Shvartsman, H. Weatherspoon, and B. Y. Zhao, eds.), pp. 57-61, vol. 2584 of Lecture Notes in Computer Science, Springer, Berlin, 2003.
12. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, Secure and efficient asynchronous broadcast protocols (extended abstract), in Advances in Cryptology: CRYPTO 2001 (J. Kilian, ed.), pp. 524-541, vol. 2139 of Lecture Notes in Computer Science, Springer, Berlin, 2001.
13. 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.
14. C. Cachin and J. A. Poritz, Secure intrusion-tolerant replication on the Internet, in Proc. International Conference on Dependable Systems and Networks (DSN-2002), pp. 167-176, June 2002.
15. R. Canetti, Studies in Secure Multiparty Computation and Applications, Ph.D. thesis, Weizmann Institute, 1995.
16. R. Canetti and S. Goldwasser, An efficient threshold public-key cryptosystem secure against adaptive chosen-ciphertext attack, in Advances in Cryptology: EUROCRYPT '99 (J. Stern, ed.), pp. 90-106, vol. 1592 of Lecture Notes in Computer Science, Springer, Berlin, 1999.
17. 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.
18. M. Castro and B. Liskov, Practical Byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems, vol. 20, pp. 398-461, Nov. 2002.
19. 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.
20. D. Chaum and T. P. Pedersen, Wallet databases with observers, in Advances in Cryptology: CRYPTO '92 (E. F. Brickell, ed.), pp. 89-105, vol. 740 of Lecture Notes in Computer Science, Springer, Berlin, 1993.
21. B. Chor and C. Dwork, Randomization in Byzantine agreement, in Randomness and Computation (S. Micali, ed.), pp. 443-497, vol. 5 of Advances in Computing Research, JAI Press, Greenwich, CT, 1989.
22. R. A. Croft and S. P. Harris, Public-key cryptography and re-usable shared secrets, in Cryptography and Coding (H. Baker and F. Piper, eds.), pp. 189-201. Clarendon Press, Oxford, 1989.
23. Y. Desmedt, Society and group oriented cryptography: a new concept, in Advances in Cryptology: CRYPTO '87 (C. Pomerance, ed.), pp. 120-127, vol. 293 of Lecture Notes in Computer Science, Springer, Berlin, 1988.
24. Y. Desmedt and Y. Frankel, Threshold cryptosystems, in Advances in Cryptology: CRYPTO '89 (G. Brassard, ed.), pp. 307-315, vol. 435 of Lecture Notes in Computer Science, Springer, Berlin, 1990.
25. P. Feldman and S. Micali, An optimal probabilistic protocol for synchronous Byzantine agreement, SIAM Journal on Computing, vol. 26, pp. 873-933, Aug. 1997.
26. A. Fiat and A. Shamir, How to prove yourself: practical solutions to identification and signature problems, in Advances in Cryptology: CRYPTO '86 (A. M. Odlyzko, ed.), pp. 186-194, vol. 263 of Lecture Notes in Computer Science, Springer, Berlin, 1987.
27. 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.
28. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, vol. 18, pp. 186-208, Feb. 1989.
29. S. Goldwasser, S. Micali, and R. L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, vol. 17, pp. 281-308, Apr. 1988.
30. I. Keidar and S. Rajsbaum, On the cost of fault-tolerant consensus when there are no faults - a tutorial, SIGACT News, vol. 32, pp. 45-63, June 2001.
31. K. Kursawe, Distributed Trust, Ph.D. thesis, Universität des Saarlandes, Saarbrücken, March 2002.
32. K. Kursawe, Optimistic Byzantine agreement, in Proc. 21st Symposium on Reliable Distributed Systems (SRDS 2002), pp. 262-267, 2002.
33. M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, Princeton, NJ, 1996.
34. S. Micali and R. Sidney, A simple method for generating and sharing pseudo-random functions, with applications to clipper-like key escrow systems, in Advances in Cryptology: CRYPTO '95 (D. Coppersmith, ed.), pp. 185-196, vol. 963 of Lecture Notes in Computer Science, Springer, Berlin, 1995.
35. M. Naor, B. Pinkas, and O. Reingold, Distributed pseudo-random functions and KDCs, in Advances in Cryptology: EUROCRYPT '99 (J. Stern, ed.), pp. 327-346, vol. 1592 of Lecture Notes in Computer Science, Springer, Berlin, 1999.
36. M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, revised version: preliminary version presented at 38th IEEE Symposium on Foundations of Computer Science (FOCS '97), 2000.
37. J. B. Nielsen, A threshold pseudorandom function construction and its applications, in Advances in Cryptology: CRYPTO 2002 (M. Yung, ed.), pp. 401-416, vol. 2442 of Lecture Notes in Computer Science, Springer, Berlin, 2002.
38. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults, Journal of the ACM, vol. 27, pp. 228-234, Apr. 1980.
39. M. O. Rabin, Randomized Byzantine generals, in Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 403-409, 1983.
40. T. Rabin, A simplified approach to threshold and proactive RSA, in Advances in Cryptology: CRYPTO '98 (H. Krawczyk, ed.), pp. 89-104, vol. 1462 of Lecture Notes in Computer Science, Springer, Berlin, 1998.
41. M. K. Reiter, A secure group membership protocol, IEEE Transactions on Software Engineering, vol. 22, pp.31-42, Jan. 1996.
42. F. B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol. 22, pp. 299-319, Dec. 1990.
43. A. Shamir, How to share a secret, Communications of the ACM, vol. 22, pp. 612-613, Nov. 1979.
44. V. Shoup, Lower bounds for discrete logarithms and related problems, in Advances in Cryptology: EUROCRYPT '97, (W. Fumy, ed.), pp. 256-266, vol. 1233 of Lecture Notes in Computer Science, Springer, Berlin, 1997.
45. V. Shoup, On formal models for secure key exchange, Research Report RZ 3120, IBM Research, 1999.
46. V. Shoup, Practical threshold signatures, in Advances in Cryptology: EUROCRYPT 2000 (B. Preneel, ed.), pp. 207-220, vol. 1087 of Lecture Notes in Computer Science, Springer, Berlin, 2000.
47. M. Stadler, Publicly verifiable secret sharing, in Advances in Cryptology: EUROCRYPT '96 (U. Maurer, ed.), pp. 190-199, vol. 1233 of Lecture Notes in Computer Science, Springer, Berlin, 1996.
48. S. Toueg, Randomized Byzantine agreements, in Proc. 3rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 163-178, 1984.
49. A. C. Yao, Theory and applications of trapdoor functions, in Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 80-91, 1982.
50. L. Zhou, F. B. Schneider, and R. van Renesse, COCA: a secure distributed online certification authority, ACM Transactions on Computer Systems, vol. 20, no. 4 pp. 329-368, 2002.