Generic constructions of PoRs from codes and instantiations

DOI10.1515/JMC-2018-0018MaRDI QIDQ2003343zbMATH OpenOpenAlexWikidataFDO

Authors Julien Lavauzelle, Françoise Levy-dit-Vehel

Publication date 8 July 2019

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/jmc-2018-0018

zbMATH Keywords

cloud storageerror-correcting codeproof of retrievability

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Linear codes (general theory) (94B05)

Recommendations

• Proofs of Retrievability via Hardness Amplification
• Proofs of retrievability via fountain code
• A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
• Compact proofs of retrievability
• Compact Proofs of Retrievability

Cites work

• A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
• Compact proofs of retrievability
• Generic constructions of PoRs from codes and instantiations
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• Keyword-Based Delegable Proofs of Storage
• Multi-prover proof of retrievability
• New affine-invariant codes from lifting
• Proofs of Retrievability via Hardness Amplification
• The complexity of online memory checking

Cited in

(4)

• Generic oracles, uniform machines, and codes
• Generic constructions of PoRs from codes and instantiations
• DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
• Efficient proofs of retrievability using expander codes

This page was built for publication: Generic constructions of PoRs from codes and instantiations

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