Efficient proofs of retrievability using expander codes

DOI10.1007/978-3-031-20974-1_19zbMath1524.68119MaRDI QIDQ6164407

Maxime Roméas, Françoise Levy-dit-Vehel

Publication date: 28 July 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

zbMATH Keywords

proofs of retrievabilityexpander codesoutsourced storage

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)

Cites Work

• Composable and robust outsourced storage
• A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
• Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
• New affine-invariant codes from lifting
• The Minimum Distance of Graph Codes
• Expander codes
• Explicit Concentrators from Generalized N-Gons
• Compact Proofs of Retrievability
• Proofs of Retrievability via Hardness Amplification
• On expander codes
• Linear-Time Erasure List-Decoding of Expander Codes

This page was built for publication: Efficient proofs of retrievability using expander codes