Advertisement
Published in:
2005 | OriginalPaper | Chapter
Asynchronous Verifiable Information Dispersal
Authors : Christian Cachin, Stefano Tessaro
Published in: Distributed Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.