Proof of Retrievability Based on LDPC Codes

doi:10.1016/S1005-8885(15)60663-X

中国邮电高校学报(英文) ›› 2015, Vol. 22 ›› Issue (4): 17-25.doi: 10.1016/S1005-8885(15)60663-X

• Artificial Intelligence • 上一篇下一篇

Proof of Retrievability Based on LDPC Codes

卞建超¹,刘会霞²,罗守山³,查雅行¹,李伟¹

1. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China 3. Henan Police College, Zhengzhou 450046, China

收稿日期:2014-09-18 修回日期:2015-01-23 出版日期:2015-08-28 发布日期:2015-08-28
通讯作者: 卞建超 E-mail:bianjianchao@bupt.edu.cn
基金资助:
he National Natural Science Foundation of China (61121061).

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, Beijing 100876, China 2. National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China 3. Henan Police College, Zhengzhou 450046, China

Received:2014-09-18 Revised:2015-01-23 Online:2015-08-28 Published:2015-08-28
Contact: Jian-chao BIAN E-mail:bianjianchao@bupt.edu.cn
Supported by:
he National Natural Science Foundation of China (61121061).

摘要/Abstract

摘要： 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

Abstract: 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.

Key words: POR, LDPC, PDP, cloud storage

Bian Jianchao, Liu Huixia, Luo Shoushan, Zha Yaxing, Li Wei. Proof of retrievability based on LDPC codes[J]. Acta Metallurgica Sinica(English letters), 2015, 22(4): 17-25.

参考文献

1. Brunette G, Mogull R. Security guidance for critical areas of focus in cloud computing v2. 1. Cloud Security Alliance, 2009 2. Juels A, Kaliski B S. PORs: proofs of retrievability for large files. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS’07), Oct 29?Nov 2, 2007, Alexandria, VA, USA. New York, NY, USA: ACM, 2007: 584?597 3. Bowers K D, Juels A, Oprea A. Proofs of retrievability: theory and implementation. Proceedings of the 2009 ACM Workshop on Cloud Computing Security (CCSW’09), Nov 9?13, 2009, Chicago, IL, USA. New York, NY, USA: ACM, 2009: 43?54 4. Zheng Q J, Xu S H. Fair and dynamic proofs of retrievability. Proceedings of the 1st ACM Conference on Data and Application Security and Privacy (CODASPY’11), Feb 21?23, 2011, San Antonio, TX, USA. New York, NY, USA: ACM, 2011: 237?248 5. Cash D, Küp?ü A, Wichs D. Dynamic proofs of retrievability via oblivious ram. Advances in Cryptology: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’13), May 26?30, 2013, Athens, Greece. LNCS 7881. Berlin, Germany: Springer-Verlag, 2013: 279?295 6. Shacham H, Waters B. Compact proofs of retrievability. Advances in Cryptology: Proceedings of the 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’08), Apr 13?17, 2008, Istanbul, Turkey. LNCS 4965. Berlin, Germany: Springer-Verlag, 2008: 90?107 7. Bowers K D, Juels A, Oprea A. HAIL: a high-availability and integrity layer for cloud storage. Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS’09), Nov 9?13, 2009, Chicago, IL, USA. New York, NY, USA: ACM, 2009:187?198 8. Xu J, Chang E C. Towards efficient proofs of retrievability. Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security (ASIACCS’12), May 2?4, 2012, Seoul, Republic of Korea. New York, NY, USA: ACM, 2012: 79?80 9. Ateniese G, Burns R, Curtmola R, et al. Remote data checking using provable data possession. ACM Transactions on Information and System Security, 2011, 14(1): Article 12. 10. Curtmola R, Khan O, Randal B, et al. MR-PDP: multiple-replica provable data possession. Proceedings of the 28th International Conference on Distributed Computing Systems (ICDCS’08), Jun 17?20, 2008, Beijing, China. Piscataway, NJ, USA: IEEE, 2008:411?420

Proof of Retrievability Based on LDPC Codes

Proof of retrievability based on LDPC codes

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价