Proof of retrievability based on LDPC codes  

作　　者：Bian Jianchao Liu Huixia Luo Shoushan Zha Yaxing Li Wei 

机构地区：[1]Information Security Center,Beijing University of Posts and Telecommunications [2]National Engineering Laboratory for Disaster Backup and Recovery,Beijing University of Posts and Telecommunications [3]Henan Police College

出　　处：《The Journal of China Universities of Posts and Telecommunications》2015年第4期17-25,50,共10页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (61121061)

摘　　要：In order to reduce the computational overhead of proof of retrievability（POR） scheme, a new POR scheme based on low-density parity-check（LDPC） codes is proposed, noted as LDPC-POR. In the model of PORs scheme, the client preprocesses the data and sends it to an untrusted server for storage, only keeping some metadata. Then, the client sends a challenge to the server to prove that the data stored at the server has neither been tampered nor deleted. In the setup phase of this scheme, the client uses LDPC code to encode the data, and blinds data with permutation and pseudo-random stream. In the challenge phase, the server generates the proof completely based on exclusive OR（XOR）, after that the client makes use of the LDPC code to prove the validity of proof. The theoretical analysis shows that this scheme not only reduces the computational overhead, but also saves storage space compared with the classical scheme. In the meantime security proof is also provided in this paper showing that this scheme is feasible.In order to reduce the computational overhead of proof of retrievability（POR） scheme, a new POR scheme based on low-density parity-check（LDPC） codes is proposed, noted as LDPC-POR. In the model of PORs scheme, the client preprocesses the data and sends it to an untrusted server for storage, only keeping some metadata. Then, the client sends a challenge to the server to prove that the data stored at the server has neither been tampered nor deleted. In the setup phase of this scheme, the client uses LDPC code to encode the data, and blinds data with permutation and pseudo-random stream. In the challenge phase, the server generates the proof completely based on exclusive OR（XOR）, after that the client makes use of the LDPC code to prove the validity of proof. The theoretical analysis shows that this scheme not only reduces the computational overhead, but also saves storage space compared with the classical scheme. In the meantime security proof is also provided in this paper showing that this scheme is feasible.

关 键 词：POR LDPC PDP cloud storage 

分 类 号：TN911.2[电子电信—通信与信息系统] TP333[电子电信—信息与通信工程]