Proofs of data possession and pollution checking for Regenerating Codes

Juan Camilo Corena, Tomoaki Ohtsuki

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Regenerating Codes strip a file in several servers, such that it is possible to recover the file when at least a given number of them is online. The difference between these codes and traditional erasure codes such as Reed-Solomon (RS), is that they require less bandwidth to repair failed nodes. This property is meant to improve storage reliability in cloud storage data systems. In this article, we present a method to check the availability of files that have been encoded using linear regenerating codes, by implementing two protocols that prove with high probability a node is in possession of a particular combination of data units from the original file. The constructions only use fast linear operations and are suited for real world files. Our proposal is based on the linear properties of the dot product among vectors and smart key assignments based on Combinatorics as well as Linear Algebra.

本文言語English
ホスト出版物のタイトル2013 IEEE Global Communications Conference, GLOBECOM 2013
ページ2717-2722
ページ数6
DOI
出版ステータスPublished - 2013
イベント2013 IEEE Global Communications Conference, GLOBECOM 2013 - Atlanta, GA, United States
継続期間: 2013 12月 92013 12月 13

出版物シリーズ

名前Proceedings - IEEE Global Communications Conference, GLOBECOM
ISSN(印刷版)2334-0983
ISSN(電子版)2576-6813

Other

Other2013 IEEE Global Communications Conference, GLOBECOM 2013
国/地域United States
CityAtlanta, GA
Period13/12/913/12/13

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Proofs of data possession and pollution checking for Regenerating Codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル