Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions

  • Amitanand S. Aiyer
  • Lorenzo Alvisi
  • Rida A. Bazzi
Conference paper

DOI: 10.1007/978-3-540-75142-7_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4731)
Cite this paper as:
Aiyer A.S., Alvisi L., Bazzi R.A. (2007) Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. In: Pelc A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Amitanand S. Aiyer
    • 1
  • Lorenzo Alvisi
    • 1
  • Rida A. Bazzi
    • 2
  1. 1.Department of Computer Sciences, University of Texas at Austin 
  2. 2.Department of Computer Sciences, Arizona State University 

Personalised recommendations