Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

Amitanand S. Aiyer, Lorenzo Alvisi, Rida Bazzi

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

12 Scopus citations

Abstract

We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine servers, without the use of unproven cryptographic primitives or requiring communication among servers. Unlike previous (non-optimal) solutions, the sizes of messages sent to writers depend only on the actual number of active readers and not on the total number of readers in the system. With a novel use of secret sharing techniques combined with write back throttling we present the first solution to tolerate Byzantine readers information theoretically, without the use of cryptographic techniques based on unproven number-theoretic assumptions.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 21st International Symposium, DISC 2007, Proceedings
PublisherSpringer Verlag
Pages7-19
Number of pages13
ISBN (Print)9783540751410
DOIs
StatePublished - 2007
Event21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus
Duration: Sep 24 2007Sep 26 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4731 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Symposium on Distributed Computing, DISC 2007
CountryCyprus
CityLemesos
Period9/24/079/26/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions'. Together they form a unique fingerprint.

  • Cite this

    Aiyer, A. S., Alvisi, L., & Bazzi, R. (2007). Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings (pp. 7-19). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_4