Description
TL;DR: A distributed-storage study asking how bandwidth-saving regenerating codes behave when some storage nodes return maliciously corrupted data.
About This Document
Frédérique Oggier and Anwitaman Datta move beyond the usual crash-and-erasure model for distributed storage. They examine Byzantine errors during data reconstruction and collaborative repair, derive resilience conditions, and discuss integrity checks that let newcomers identify corrupted contributions while preserving the storage-versus-bandwidth benefits of regenerating codes.
Why Bitcoin People May Care
This is not a Bitcoin paper. Its nodes repair encoded storage rather than validate a monetary ledger, and its adversary and membership assumptions are different. Bitcoin readers may still care because it gives a precise example of a broader decentralized-systems problem: redundancy saves data only when the system can distinguish missing information from deliberately false information.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Byzantine Fault Tolerance of Regenerating Codes
- Author / organization: Frédérique Oggier and Anwitaman Datta
- Year: 2011
- Language: English
- Document type: Distributed-storage research paper
- Pages: 11
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
