A Framework for Dynamic Byzantine Storage

We present a framework for transforming several quorum-based protocols so that they can dynamically adapt their failure threshold and server count, allowing them to be reconfigured in anticipation of possible failures or to replace servers as desired. We demonstrate this transformation on the dissemination quorum protocol. The resulting system provides confirmable wait-free atomic semantics while tolerating Byzantine failures from the clients or servers. The system can grow without bound to tolerate as many failures as desired. Finally, the protocol is optimal and fast: only the minimal number of servers ---3f+1--- is needed to tolerate any f failures and, in the common case, reads require only one message round-trip.

In  Proceedings of the International Conference on Dependable Systems and Networks

Details

TypeInproceedings
URLhttp://www.cs.utexas.edu/users/jpmartin/papers/Martin04Dynamic.pdf
> Publications > A Framework for Dynamic Byzantine Storage