TY - GEN
T1 - Efficient Proofs of Retrievability Using Expander Codes
AU - Levy-dit-Vehel, Françoise
AU - Roméas, Maxime
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - 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.
AB - 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.
KW - Expander codes
KW - Outsourced storage
KW - Proofs of retrievability
UR - https://www.scopus.com/pages/publications/85142764100
U2 - 10.1007/978-3-031-20974-1_19
DO - 10.1007/978-3-031-20974-1_19
M3 - Conference contribution
AN - SCOPUS:85142764100
SN - 9783031209734
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 361
EP - 370
BT - Cryptology and Network Security - 21st International Conference, CANS 2022, Proceedings
A2 - Beresford, Alastair R.
A2 - Patra, Arpita
A2 - Bellini, Emanuele
PB - Springer Science and Business Media Deutschland GmbH
T2 - 21st International Conference on Cryptology and Network Security, CANS 2022
Y2 - 13 November 2022 through 16 November 2022
ER -