Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage without
 

Summary: Bounded Wait-Free Implementation of
Optimally Resilient Byzantine Storage without
(Unproven) Cryptographic Assumptions
Amitanand S. Aiyer1, Lorenzo Alvisi1 , and Rida A. Bazzi2
1
Department of Computer Sciences,
University of Texas at Austin
2
Department of Computer Sciences,
Arizona State University
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-

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences