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

11 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages7-19
Number of pages13
Volume4731 LNCS
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Wait-free
Servers
Server
Secret Sharing
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Aiyer, A. S., Alvisi, L., & Bazzi, R. (2007). Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4731 LNCS, pp. 7-19). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS).

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. / Aiyer, Amitanand S.; Alvisi, Lorenzo; Bazzi, Rida.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4731 LNCS 2007. p. 7-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS).

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

Aiyer, AS, Alvisi, L & Bazzi, R 2007, Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4731 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4731 LNCS, pp. 7-19, 21st International Symposium on Distributed Computing, DISC 2007, Lemesos, Cyprus, 9/24/07.
Aiyer AS, Alvisi L, Bazzi R. Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4731 LNCS. 2007. p. 7-19. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Aiyer, Amitanand S. ; Alvisi, Lorenzo ; Bazzi, Rida. / Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4731 LNCS 2007. pp. 7-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bf643b5dfd6440d1a716b77f3e09e786,
title = "Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions",
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.",
author = "Aiyer, {Amitanand S.} and Lorenzo Alvisi and Rida Bazzi",
year = "2007",
language = "English (US)",
isbn = "9783540751410",
volume = "4731 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "7--19",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Aiyer, Amitanand S.

AU - Alvisi, Lorenzo

AU - Bazzi, Rida

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SN - 9783540751410

VL - 4731 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 7

EP - 19

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -