ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Distributed Computing
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Lucky Read/Write Access to Robust Atomic Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Tolerating Byzantine Faulty Clients in a Quorum System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Wait-free regular storage from Byzantine components
Information Processing Letters
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Low-overhead byzantine fault-tolerant storage
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We address the problem of building a reliable distributed read/write storage from unreliable storage units, e.g. a collection of servers, of which up to one-third can fail by not responding or by undetectably corrupting the data stored on them. Our contribution consists in the development of Byzantine-resilient storage algorithms that for the first time combine strong consistency and liveness guarantees with space-efficiency. Previous solutions featuring equivalent properties resort to storing an unlimited number of data versions in the storage units, thus eventually running into problems of space exhaustion.