Proofs of Retrievability Based on MRD Codes
Proofs of Data Possession (PoDP) scheme is essential to data outsourcing.It provides an efficient audit to convince a client that his/her file is available at the storage server, ready for retrieval when needed.An updated version of PoDP is Proofs of Retrievability (PoR), which proves the clients file can be recovered by interactions with the storage server.We propose a PoR scheme based on Maximum Rank Distance (MRD) codes.The client file is encoded block-wise to generate homomorphic tags with help of an MRD code.In an audit, the storage provider is able to aggregate the blocks and tags into one block and one tag, due to the homomorphic property of tags.The algebraic structure of MRD codewords enables the aggregation to be operated over a binary field, which simplifies the computation of storage provider to be the most efficient XOR operation.With properties of MRD codes, we also prove an important security notion, namely soundness of PoR.
Proofs of retrievability MRD codes data integrity cloud storage
Shuai Han Shengli Liu Kefei Chen Dawu Gu
Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China School of Science,Hangzhou Normal University,Hangzhou 310036,China
国际会议
福州
英文
330-345
2014-05-05（万方平台首次上网日期，不代表论文的发表时间）