New proofs of retrievability using locally decodable codesReport as inadecuate

New proofs of retrievability using locally decodable codes - Download this document for free, or read online. Document in PDF available to download.

1 LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau 2 Inria - Institut National de Recherche en Informatique et en Automatique 3 GRACE - Geometry, arithmetic, algorithms, codes and encryption Inria Saclay - Ile de France 4 ENSTA ParisTech UMA - Unité de Mathématiques Appliquées

Abstract : Proofs of retrievability PoR are probabilistic protocols which ensure that a client can recover a file he previously stored on a server. Good PoRs aim at reaching an efficient trade-off between communication complexity and storage overhead, and should be usable an unlimited number of times. We present a new unbounded-use PoR construction based on a class of locally decodable codes, namely the lifted codes of Guo et. al

Our protocols feature sublinear communication complexity and very low storage overhead. Moreover, the various parameters can be tuned so as to minimize the communication complexity resp. the storage overhead according to the setting of concern.

Keywords : proofs of retrievability locally decodable codes lifted codes cryptographic protocols data storage

Author: Julien Lavauzelle - Françoise Levy-Dit-Vehel -



Related documents