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

  • Amitanand S. Aiyer
  • Lorenzo Alvisi
  • Rida A. Bazzi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4731)


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.


Active List Read Operation Atomic Register Correct Server Current Timestamp 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aiyer, A., Alvisi, L., Bazzi, R.A.: Bounded Wait-free Implementation of Optimally Resilient Byzantine Storage without (Unproven) Cryptographic Assumptions. Technical Report TR-07-32, University of Texas at Austin, Department of Computer Sciences (July 2007)Google Scholar
  2. 2.
    Bazzi, R.A., Ding, Y.: Non-skipping timestamps for byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405–419. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Bazzi, R.A., Ding, Y.: Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 299–313. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN, Washington, DC, USA, pp. 115–124. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  5. 5.
    Fan, R., Lynch, N.: Efficient replication of large data objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 75–91. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Guerraoui, R., Vukolic, M.: Refined Quorum Systems. Technical Report LPD-REPORT-2007-001, EPFL (2007)Google Scholar
  7. 7.
    Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)CrossRefGoogle Scholar
  8. 8.
    Lamport, L.: On interprocess communication. part i: Basic formalism. Distributed Computing 1(2), 77–101 (1986)zbMATHCrossRefGoogle Scholar
  9. 9.
    Liskov, B., Rodrigues, R.: Byzantine clients rendered harmless. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 311–325. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311–325. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(2), 133–138 (1988)zbMATHMathSciNetGoogle Scholar

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