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

Authors:
Amitanand Aiyer;Lorenzo Alvisi;Rida A. Bazzi
Affiliations:
University of Texas at Austin, Austin, TX;University of Texas at Austin, Austin, TX;Arizona State University, Pheonix, AZ
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Byzantine clients rendered harmless

DISC'05 Proceedings of the 19th international conference on Distributed Computing

On the Time-Complexity of Robust and Amnesic Storage

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems

Hi-index	0.00