Efficient Proofs of Retrievability using Expander Codes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Efficient Proofs of Retrievability using Expander Codes

Résumé

Proofs of Retrievability (PoR) protocols ensure that a client can fully retrieve a large outsourced file from an untrusted server. Good PoRs should have low communication complexity, small storage overhead and clear security guarantees. We design a good PoR based on a family of graph codes called expander codes. We use expander codes based on graphs derived from point-line incidence relations of finite affine planes. Høholdt et al. showed that, when using Reed-Solomon codes as inner codes, these codes have good dimension and minimum distance over a relatively small alphabet. Moreover, expander codes possess very efficient unique decoding algorithms. We take advantage of these results to design a PoR scheme that extracts the outsourced file in quasi-linear time and features better concrete parameters than state-of-the-art schemes w.r.t storage overhead and size of the outsourced file.
Fichier principal
Vignette du fichier
article.pdf (495.79 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03886784 , version 1 (06-12-2022)

Identifiants

  • HAL Id : hal-03886784 , version 1

Citer

Françoise Levy-Dit-Vehel, Maxime Roméas. Efficient Proofs of Retrievability using Expander Codes. CANS 2022 - 21st International Conference on Cryptology and Network Security, Nov 2022, Abu Dhabi, United Arab Emirates. ⟨hal-03886784⟩
48 Consultations
66 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More