Byzantine quorum systems

Distributed Computing

Volumn 11, Issue 4, 1998, Pages 203-213

  Malkhi, Dahlia ^a,b   Reiter, Michael ^a,c,d  

^a AT AND T LABS RESEARCH   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

^d Department of Obstetrics Gynecology

Author keywords

Byzantine failures; Fault tolerance; Quorum systems; Replication

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS;

BYZANTINE FAILURES; QUORUM SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032306029     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050050     Document Type: Article

References (37)

1. Afek A, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N: Atomic snapshots of shared memory. Journal of the ACM 40(4):873-890
2. Afek Y, Dolev D, Gafni E, Merritt M, Shavit N: A bounded first-in first-enabled-solution to the l-exclusion problem. In: Proceedings of the 4th International Workshop on Distributed Algorithms. LNCS 486, Springer 1990
3. Agrawal D and El Abbadi A: Integrating security with fault-tolerant distributed databases. Comput J 33(1):71-78
4. Agrawal D, El Abbadi A: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems 9(1):1-20 (1991)
5. Anderson JH: Composite registers. Distrib Comp 6(3):141-154 (1993)
6. Bazzi RA: Synchronous Byzantine quorum systems. In: Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pp 259-266 (1997)
7. Cheung SY, Ammar MH, Ahamad M: The grid protocol: A high performance scheme for maintaining replicated data. In: Proceedings of the 6th IEEE International Conference on Data Engineering, pp 438-445, 1990
8. International Telegraph and Telephone Consultative Committee (CCITT): The Directory - Authentication Framework, Recommendation X.509, 1988
9. Dolev D, Gafni E, Shavit N: Toward a non-atomic era: l-exclusion as a test case. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp 78-92, May 1988
10. Dolev D, Shavil N: Bounded concurrent time-stamp systems are constructible. SIAM Journal of Computing, to appear. Also in: Proceedings of the 21st ACM Symposium on the Theory of Computing, pp 454-466, 1989
11. El Abbadi A, Toueg S: Maintaining availability in partitioned replicated databases. ACM Transactions on Database Systems 14(2):264-290 (1989)
12. Garcia-Molina H, Barbara D; How to assign votes in a distributed system. Journal of the ACM 32(4):841-860 (1985)
13. Gifford DK: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles, pp 150-162, 1979
14. Hall, Jr. M: Combinatorial Theory. 2nd Edn. Interscience Series in Discrete Mathematics, New York: Wiley 1986
15. Herlihy H: A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems 4(1):32-53 (1986)
16. Herlihy MP, Tygar JD: How to make replicated data secure. In: Advances in Cryptology - CRYPTO '87 Proceedings, Lecture Notes in Computer Science 293, pp379-391, Berlin Heidelberg New York: Springer 1988
17. Israeli A, Li M: (Bounded time-stamps. Distrib Comput 6(4):205-209 (1992)
18. Israeli A, Shaham A: Optimal multi-write multi-reader atomic register. In: Proceedings of the 11th ACM Symposium on Principles of Distrib Comput, pp71-82, 1992
19. Lampson B, Abadi M, Burrows M, Wobber E: Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems 10(4):265-310 (1992)
20. Lamport L: On interprocess communication (part II: algorithms). Distrib Comput 1:86-101 (1986)
21. Li M, Tromp J, Vitanyi PMB: How to share concurrent wait-tree variables. Journal of the ACM, to appear
22. Maekawa M: A √n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2):145-159 (1985)
23. Malkhi D, Reiter M: Byzantine quorum systems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp 569-578, May 1997
24. Malkhi D, Reiter M: Survivable consensus objects. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, October 1998
25. Malkhi D, Reiter M: Secure and scalable replication in Phalanx. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, October 1998
26. Malkhi D, Reiter M, Lynch N: A correctness condition tor memory shared by Byzantine processes. Submitted for publication 1998
27. Malkhi D, Reiter M, Wool A: The load and availability of Byzantine quorum systems. In: Proceedings of the 16th ACM Symposium on Principles of Distrib Comput, pp 249-257, August 1997
28. Malkhi D, Reiter M, Wright R: Probabilistic quorum systems. In: Proceedings of the 16th ACM Symposium on Principles of Distrib Comput, pp 267-273, August 1997
29. Malkhi D, Reiter M, Wool A, Wright R: Probabilistic Byzantine quorum systems. Brief announcement in: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, June 1998
30. Mukkamala R: Storage efficient and secure replicated distributed databases. IEEE Transactions on Knowledge and Data Engineering 6(2):337-341 (1994)
31. Naor M, Wool A: The load, capacity, and availability at quorum systems. SIAM Journal of Computing 27(2):423-447 (1998)
32. Naor M, Wool A: Access control and signatures via quorum secret sharing. In: Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp 157-168, March 1996
33. Rabin MO: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM 36(2):335-348 (1989)
34. Rivest R, Shamir A, Adleman L: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2):120-126 (1978)
35. Shamir A: How to share a secret. Communications of the ACM 22(11):612-613 (1979)
36. Tardo JJ, Alasappan K: SPX: Global authentication using public key certificates. In: Proceedings of the 1991 IEEE Symposium on Research in Security and Privacy, pp 232-244, May 1991
37. Thomas RH: A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems 4(2):180-209 (1979)