Synchronous Byzantine quorum systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate Byzantine failures; they called these systems Byzantine quorum systems and gave some examples of such quorum systems. In this paper, we argue that the proposed definition of Byzantine quorums is too strong for synchronous systems and we propose a definition of synchronous Byzantine quorums. We show that the new definition is more appropriate for synchronous systems. We prove tight lower bounds on the load of synchronous Byzantine quorum systems for various failure assumptions and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure assumptions.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Place of PublicationNew York, NY, United States
PublisherACM
Pages259-266
Number of pages8
StatePublished - 1997
EventProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA
Duration: Aug 21 1997Aug 24 1997

Other

OtherProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
CitySanta Barbara, CA, USA
Period8/21/978/24/97

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Bazzi, R. (1997). Synchronous Byzantine quorum systems. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 259-266). New York, NY, United States: ACM.

Synchronous Byzantine quorum systems. / Bazzi, Rida.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States : ACM, 1997. p. 259-266.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bazzi, R 1997, Synchronous Byzantine quorum systems. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, NY, United States, pp. 259-266, Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, USA, 8/21/97.
Bazzi R. Synchronous Byzantine quorum systems. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States: ACM. 1997. p. 259-266
Bazzi, Rida. / Synchronous Byzantine quorum systems. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States : ACM, 1997. pp. 259-266
@inproceedings{c146bda8338f4c9faeecd0cafb610d82,
title = "Synchronous Byzantine quorum systems",
abstract = "Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate Byzantine failures; they called these systems Byzantine quorum systems and gave some examples of such quorum systems. In this paper, we argue that the proposed definition of Byzantine quorums is too strong for synchronous systems and we propose a definition of synchronous Byzantine quorums. We show that the new definition is more appropriate for synchronous systems. We prove tight lower bounds on the load of synchronous Byzantine quorum systems for various failure assumptions and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure assumptions.",
author = "Rida Bazzi",
year = "1997",
language = "English (US)",
pages = "259--266",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "ACM",

}

TY - GEN

T1 - Synchronous Byzantine quorum systems

AU - Bazzi, Rida

PY - 1997

Y1 - 1997

N2 - Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate Byzantine failures; they called these systems Byzantine quorum systems and gave some examples of such quorum systems. In this paper, we argue that the proposed definition of Byzantine quorums is too strong for synchronous systems and we propose a definition of synchronous Byzantine quorums. We show that the new definition is more appropriate for synchronous systems. We prove tight lower bounds on the load of synchronous Byzantine quorum systems for various failure assumptions and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure assumptions.

AB - Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate Byzantine failures; they called these systems Byzantine quorum systems and gave some examples of such quorum systems. In this paper, we argue that the proposed definition of Byzantine quorums is too strong for synchronous systems and we propose a definition of synchronous Byzantine quorums. We show that the new definition is more appropriate for synchronous systems. We prove tight lower bounds on the load of synchronous Byzantine quorum systems for various failure assumptions and we present synchronous Byzantine quorums that have optimal loads that match the lower bounds for two failure assumptions.

UR - http://www.scopus.com/inward/record.url?scp=0030678959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030678959&partnerID=8YFLogxK

M3 - Conference contribution

SP - 259

EP - 266

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - ACM

CY - New York, NY, United States

ER -