Generic constructions of PoRs from codes and instantiations
From MaRDI portal
Publication:2003343
DOI10.1515/jmc-2018-0018zbMath1443.94106OpenAlexW2915250114WikidataQ128387957 ScholiaQ128387957MaRDI QIDQ2003343
Françoise Levy-dit-Vehel, Julien Lavauzelle
Publication date: 8 July 2019
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2018-0018
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Multi-prover proof of retrievability
- Generic constructions of PoRs from codes and instantiations
- Compact proofs of retrievability
- A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
- New affine-invariant codes from lifting
- The complexity of online memory checking
- Proofs of Retrievability via Hardness Amplification
- Keyword-Based Delegable Proofs of Storage
This page was built for publication: Generic constructions of PoRs from codes and instantiations
