Secure distributed storage and retrieval
Theoretical Computer Science
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Asynchronous Veri.able Information Dispersal
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We consider the distribution of data by a client among a set of n storage servers, of which up to t might be faulty exhibiting arbitrary, i.e., Byzantine, behavior. The goal is to ensure that clients can always recover the stored data correctly, independently from the behavior of faulty servers or other, faulty clients. An inefficient solution is based on replication such that every server keeps a copy of the data. The classic alternative is information dispersal (IDA): using an erasure code, the data is split into blocks such that each server holds exactly one block and only a subset of the blocks is needed in order to reconstruct the data.