Addendum to 'Scalable secure storage when half the system is faulty' [Inform. Comput. 174 (2) (2002) 203-213]

摘要

We consider the following problem. A file of size s bits is to be stored on n disks. Our failure model assumes that a potentially malicious adversary may choose after the file is stored less than half of the disks, and arbitrarily alter the data they store. The adversary is constrained in its computation power, which is assumed to be polynomial. Note that this disk-corruption model is different from the classical fault model for error correcting codes, in which individual bits experience faults independently. The goal is to store the file on the disks in such as way that recovery of the file is possible despite the corruption with high probability, where probability is over the choices of data alterations made by the adversary.