This paper presents a new approach for data entanglement in a distributed storage system. The introduction of dependencies between stored content was initially proposed as a deterrent factor in censorship resistant systems. The strategies found in the literature fail, however, to simultaneously provide a high level of robustness while being sufficiently efficient to be deployed in real-world systems. To address this limitation, we propose a novel design, called helical entanglement code (HEC), that entangles files with both previously-stored and forthcoming data and provides a sound compromise between strong robustness, pragmatism, and efficiency. HEC provides self-repair capabilities inside a cluster of entangled documents while only requiring cheap encoding mechanisms. We further describe the architecture of a storage system that leverages HEC's implicit redundancy properties and can be used in combination with conventional encoding methods to protect data against various types of faults.
['Veronica Estrada Galinanes', 'Pascal Felber']
Helical Entanglement Codes: An Efficient Approach for Designing Robust Distributed Storage Systems