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

16Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Aiyer, A. S., Alvisi, L., & Bazzi, R. A. (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). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free