New proofs of retrievability using locally decodable codes

Julien Lavauzelle; Francoise Levy-Dit-Vehel

doi:10.1109/ISIT.2016.7541611

New proofs of retrievability using locally decodable codes

Julien Lavauzelle
, Francoise Levy-Dit-Vehel

INRIA

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 tradeoff 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.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1809-1813
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541611
Publication status	Published - 10 Aug 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Keywords

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

Access to Document

10.1109/ISIT.2016.7541611

Cite this

Lavauzelle, J., & Levy-Dit-Vehel, F. (2016). New proofs of retrievability using locally decodable codes. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1809-1813). Article 7541611 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541611

@inproceedings{9d9d0b2d198746979fa5c0030bb80f85,

title = "New proofs of retrievability using locally decodable codes",

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 tradeoff 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 = "cryptographic protocols, data storage, lifted codes, locally decodable codes, proofs of retrievability",

author = "Julien Lavauzelle and Francoise Levy-Dit-Vehel",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541611",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1809--1813",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

}

Lavauzelle, J & Levy-Dit-Vehel, F 2016, New proofs of retrievability using locally decodable codes. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541611, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1809-1813, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541611

New proofs of retrievability using locally decodable codes. / Lavauzelle, Julien; Levy-Dit-Vehel, Francoise.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1809-1813 7541611 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - New proofs of retrievability using locally decodable codes

AU - Lavauzelle, Julien

AU - Levy-Dit-Vehel, Francoise

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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 tradeoff 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.

AB - 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 tradeoff 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.

KW - cryptographic protocols

KW - data storage

KW - lifted codes

KW - locally decodable codes

KW - proofs of retrievability

UR - https://www.scopus.com/pages/publications/84985960760

U2 - 10.1109/ISIT.2016.7541611

DO - 10.1109/ISIT.2016.7541611

M3 - Conference contribution

AN - SCOPUS:84985960760

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1809

EP - 1813

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

New proofs of retrievability using locally decodable codes

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this