Verifying distributed erasure-coded data

DOI10.1145/1281100.1281122MaRDI QIDQ5401404zbMATH OpenOpenAlexFDO

Authors James Vincent Hendricks, Gregory R. Ganger, Michael K. Reiter

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281122

zbMATH Keywords

erasure codesfault-tolerant storagehomomorphic fingerprinting

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Decoding (94B35)

Recommendations

• Network Coding for Distributed Storage Systems
• Self-repairing codes
• Sparsity exploiting erasure coding for distributed storage of versioned data
• scientific article; zbMATH DE number 1931818
• Proofs of retrievability via fountain code

Cited in

(7)

• Sparsity exploiting erasure coding for distributed storage of versioned data
• scientific article; zbMATH DE number 1931818 (Why is no real title available?)
• Distributed Hypothesis Testing Based on Unequal-Error Protection Codes
• DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
• Optimistic Erasure-Coded Distributed Storage
• Data verification and reconciliation with generalized error-control codes
• Verified Erasure Correction in Coq with MathComp and VST

This page was built for publication: Verifying distributed erasure-coded data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401404)