Byzantine quorum systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Byzantine quorum systems

Full text

Pdf (1.62 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents

El Paso, Texas, United States

Pages: 569 - 578

Year of Publication: 1997

ISBN:0-89791-888-6

Authors

Dahlia Malkhi	AT&T Labs-Research, Murray Hill, NJ
Michael Reiter	AT&T Labs-Research, Murray Hill, NJ

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 84, Citation Count: 22

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258650 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Yehuda Afek , Hagit Attiya , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit, Atomic snapshots of shared memory, Journal of the ACM (JACM), v.40 n.4, p.873-890, Sept. 1993 [doi>10.1145/153724.153741]
	2	Yehuda Afek , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit, A bound first-in, first-enabled solution to the 1-exclusion problem, Proceedings of the 4th international workshop on Distributed algorithms, p.422-432, June 1991, Bari, Italy
	3	D. Agrawal , A. El Abbadi, Integrating security with fault-tolerant distributed databases, The Computer Journal, v.33 n.1, p.71-78, Feb. 1990 [doi>10.1093/comjnl/33.1.71]
	4	Divyakant Agrawal , Amr El Abbadi, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Transactions on Computer Systems (TOCS), v.9 n.1, p.1-20, Feb. 1991 [doi>10.1145/103727.103728]
	5	James H. Anderson, Composite registers, Distributed Computing, v.6 n.3, p.141-154, April 1993 [doi>10.1007/BF02242703]
	6	Hagit Attiya , Amotz Bar-Noy , Danny Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM (JACM), v.42 n.1, p.124-142, Jan. 1995 [doi>10.1145/200836.200869]
	7	Philip A Bernstein , Vassos Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	8	Gabriel Bracha , Sam Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM (JACM), v.32 n.4, p.824-840, Oct. 1985 [doi>10.1145/4221.214134]
	9	Shun Yan Cheung , Mostafa H. Ammar , Mustaque Ahamad, The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data, Proceedings of the Sixth International Conference on Data Engineering, p.438-445, February 05-09, 1990
	10	International Telegraph and Telephone Consultative Committee (CCITT). The Directory- Authentication Framework, Recommendation X.509, 1988.
	11	Danny Dolev , Eli Gafni , Nir Shavit, Toward a non-atomic era: l-exclusion as a test case, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.78-92, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62220]
	12	D. Dolev , N. Shavit, Bounded concurrrent time-stamp systems are constructible, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.454-466, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73051]
	13	A. El Abbadi , S. Toueg, Maintaining availability in partitioned replicated databases, ACM Transactions on Database Systems (TODS), v.14 n.2, p.264-290, June 1989 [doi>10.1145/63500.63501]
	14	Hector Garcia-Molina , Daniel Barbara, How to assign votes in a distributed system, Journal of the ACM (JACM), v.32 n.4, p.841-860, Oct. 1985 [doi>10.1145/4221.4223]
	15	David K. Gifford, Weighted voting for replicated data, Proceedings of the seventh ACM symposium on Operating systems principles, p.150-162, December 10-12, 1979, Pacific Grove, California, United States [doi>10.1145/800215.806583]
	16	Marshall Hall, Jr., Combinatorial theory (2nd ed.), John Wiley & Sons, Inc., New York, NY, 1998
	17	Maurice Herlihy, A quorum-consensus replication method for abstract data types, ACM Transactions on Computer Systems (TOCS), v.4 n.1, p.32-53, Feb. 1986 [doi>10.1145/6306.6308]
	18	Maurice Herlihy , J. D. Tygar, How to Make Replicated Data Secure, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.379-391, August 16-20, 1987
	19	Amos Israeli , Ming Li, Bounded time-stamps, Distributed Computing, v.6 n.4, p.205-209, July 1993 [doi>10.1007/BF02242708]
	20	Akhil Kumar, Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data, IEEE Transactions on Computers, v.40 n.9, p.996-1004, September 1991 [doi>10.1109/12.83661]
	21	Amos Israeli , Amnon Shaham, Optimal multi-writer multi-reader atomic register, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.71-82, August 10-12, 1992, Vancouver, British Columbia, Canada [doi>10.1145/135419.135435]
	22	Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
	23	Butler Lampson , Martín Abadi , Michael Burrows , Edward Wobber, Authentication in distributed systems: theory and practice, ACM Transactions on Computer Systems (TOCS), v.10 n.4, p.265-310, Nov. 1992 [doi>10.1145/138873.138874]
	24	L. Lamport. On interprocess communication (part II: algorithms). Distributed Computing 1:86-101, 1986.
	25	Ming Li , John Tromp , Paul M. B. Vitányi, How to share concurrent wait-free variables, Journal of the ACM (JACM), v.43 n.4, p.723-746, July 1996 [doi>10.1145/234533.234556]
	26	Mamoru Maekawa, A N algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems (TOCS), v.3 n.2, p.145-159, May 1985 [doi>10.1145/214438.214445]
	27	Dahlia Malkhi , Michael Reiter, A high-throughput secure reliable multicast protocol, Journal of Computer Security, v.5 n.2, p.113-127, Jan. 1997
	28	D. Malkhi, M. Ratter and A. Wool. Optima{ Byzantine quorum systems. Submitted for publication, January 1997.
	29	R. Mukkamala, Storage Efficient and Secure Replicated Distributed Databases, IEEE Transactions on Knowledge and Data Engineering, v.6 n.2, p.337-341, April 1994 [doi>10.1109/69.277777]
	30	M. Nw0r and A. Wool. The load, capacity, and availability of quorum systems. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 214-225, 1994.
	31	Moni Naor , Avishai Wool, Access control and signatures via quorum secret sharing, Proceedings of the 3rd ACM conference on Computer and communications security, p.157-168, March 14-15, 1996, New Delhi, India [doi>10.1145/238168.238209]
	32	Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the ACM (JACM), v.36 n.2, p.335-348, April 1989 [doi>10.1145/62044.62050]
	33	Michael K. Reiter, Secure agreement protocols: reliable and atomic group multicast in rampart, Proceedings of the 2nd ACM Conference on Computer and communications security, p.68-80, November 1994, Fairfax, Virginia, United States [doi>10.1145/191177.191194]
	34	Michael Reiter, Distributing trust with the Rampart toolkit, Communications of the ACM, v.39 n.4, p.71-74, April 1996 [doi>10.1145/227210.227228]
	35	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
	36	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	37	J. J. Tardo and K. Alagappan. SPX: Global authentication using public key certificates. In Proceedings of the 1991 IEEE Symposium on Research in Security and Privacy, pages 232-244, May 1991.
	38	Robert H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems (TODS), v.4 n.2, p.180-209, June 1979 [doi>10.1145/320071.320076]
	39	Sam Toueg, Randomized Byzantine Agreements, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.163-178, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806744]

CITED BY 22

	Dahlia Malkhi , Michael Reiter , Rebecca Wright, Probabilistic quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.267-273, August 21-24, 1997, Santa Barbara, California, United States
	Rida A. Bazzi, Synchronous Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.259-266, August 21-24, 1997, Santa Barbara, California, United States
	Hyunyoung Lee , Jennifer L. Welch, Randomized shared queues, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.311-313, August 2001, Newport, Rhode Island, United States
	Hyunyoung Lee , Jennifer L. Welch, Specification, implementation and application of randomized regular registers (brief announcement), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.338, July 16-19, 2000, Portland, Oregon, United States
	Dahlia Malkhi , Michael Reiter , Avishai Wool, The load and availability of Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.249-257, August 21-24, 1997, Santa Barbara, California, United States
	Miguel Castro , Barbara Liskov, Practical Byzantine fault tolerance, Proceedings of the third symposium on Operating systems design and implementation, p.173-186, February 1999, New Orleans, Louisiana, United States
	Clifford Kahn, Tolerating penetrations and insider attacks by requiring independent corroboration, Proceedings of the 1998 workshop on New security paradigms, p.122-133, September 22-26, 1998, Charlottesville, Virginia, United States
	Radu Sion, Query execution assurance for outsourced databases, Proceedings of the 31st international conference on Very large data bases, August 30-September 02, 2005, Trondheim, Norway
	Dahlia Malkhi , Michael Reiter, Byzantine quorum systems, Distributed Computing, v.11 n.4, p.203-213, October 1998
	Haifeng Yu, Signed quorum systems, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
	Nael Abu-Ghazaleh , Kyoung-Don Kang , Ke Liu, Towards resilient geographic routing in WSNs, Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks, October 13-13, 2005, Montreal, Quebec, Canada
	Haifeng Yu, Signed quorum systems, Distributed Computing, v.18 n.4, p.307-323, March 2006
	Rodrigo Rodrigues , Barbara Liskov , Liuba Shrira, The design of a robust peer-to-peer system, Proceedings of the 10th workshop on ACM SIGOPS European workshop: beyond the PC, July 01-01, 2002, Saint-Emilion, France
	Giovanni Mella , Elena Ferrari , Elisa Bertino , Yunhua Koglin, Controlled and cooperative updates of XML documents in byzantine and failure-prone distributed systems, ACM Transactions on Information and System Security (TISSEC), v.9 n.4, p.421-460, November 2006
	Flavio Junqueira , Ranjita Bhagwan , Alejandro Hevia , Keith Marzullo , Geoffrey M. Voelker, Surviving internet catastrophes, Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference, p.4-4, April 10-15, 2005, Anaheim, CA
	Ke Liu , Nael Abu-Ghazaleh , Kyoung-Don Kang, Location verification and trust management for resilient geographic routing, Journal of Parallel and Distributed Computing, v.67 n.2, p.215-228, February, 2007
	Hakim Weatherspoon , Patrick Eaton , Byung-Gon Chun , John Kubiatowicz, Antiquity: exploiting a secure log for wide-area distributed storage, ACM SIGOPS Operating Systems Review, v.41 n.3, June 2007
	Qunwei Zheng , Sibabrata Ray , Xiaoyan Hong , Lei Tang , Li Gao, Integrity and its applications, Proceedings of the 45th annual southeast regional conference, March 23-24, 2007, Winston-Salem, North Carolina
	Byung-Gon Chun , Sylvia Ratnasamy , Eddie Kohler, NetComplex: a complexity metric for networked system designs, Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation, p.393-406, April 16-18, 2008, San Francisco, California
	Byung-Gon Chun , Petros Maniatis , Scott Shenker , John Kubiatowicz, Attested append-only memory: making adversaries stick to their word, ACM SIGOPS Operating Systems Review, v.41 n.6, December 2007
	Haixun Wang , Jian Yin , Chang-shing Perng , Philip S. Yu, Dual encryption for query integrity assurance, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
	Atul Singh , Pedro Fonseca , Petr Kuznetsov , Rodrigo Rodrigues , Petros Maniatis, Zeno: eventually consistent Byzantine-fault tolerance, Proceedings of the 6th USENIX symposium on Networked systems design and implementation, p.169-184, April 22-24, 2009, Boston, Massachusetts