期刊文献+

一种动态数据多副本持有性证明方案 被引量:2

Provable Data Possession of Dynamic Multiple Replica Storage
下载PDF
导出
摘要 为检查云存储服务中提供商是否按服务等级协议的约定完整地存储了多个文件副本,提出了一种基于同态Hash的动态多副本持有性证明方案hHash-MRPDP。一方面,hHash-MRPDP通过对文件加密和对密文进行掩码运算来生成多个副本;另一方面,利用同态Hash对密文的每个数据块计算一个验证标签,从而可以根据Hash的同态性质对所有副本进行批量持有性检查。在实现对多副本批量持有性检查的同时,hHash-MRPDP还具有能定位及修复错误块、可扩展以支持数据更新、能抵抗替换、重放和伪造攻击,以及低计算、存储和通信负载等特点。 This paper proposes a dynamic multiple-replica provable data possession scheme e'alled hHash-MRPDP to check whether CSP (cloud service provider) absolutely stores multiple replicas according to SLA (service level agreement). First, hHash-MRPDP generates multiple replicas by encrypting the file and masking the cipher-text, and uses homomorphic Hash to compute a tag for each block of the cipher-text, so that, hHash-MRPDP can execute batch possession verifieation to all replicas by using the homomorphic Hash. Except for batch possession verification to all replicas, hHash-MRPDP can also locate and recover the corrupted blocks, support data dynamic extensions, resist replacement attacks, replay and forge attacks, and needs reasonably low computation, storage and communication cost.
出处 《信息工程大学学报》 2014年第4期385-392,共8页 Journal of Information Engineering University
基金 国家973计划资助项目(2012CB315901)
关键词 云存储 持有性证明 同态哈希 多副本存储 数据动态性 cloud storage provable data possession homomorphic hash multiple replica storage data dynamics
  • 相关文献

参考文献10

  • 1陈兰香,许力.云存储服务中可证明数据持有及恢复技术研究[J].计算机研究与发展,2012,49(S1):19-25. 被引量:28
  • 2Curtmola R,Khan O,Burns R,et al.MR-PDP:Multiple-Replica Provable Data Possession[C]// Proc.of ICDCS' 08.2008:411-420.
  • 3Ateniese G,Burns R,Curtmola R,et al.Provable Data Possession at Untrusted Stores[C]// Proc.of 14th ACM Conf.on Computer and Communications Security(CCS' 07).2007:598-609.
  • 4Hao Zhuo,Yu Nenghai.A Multiple-Replica Remote Data Possession Checking Protocol with Public Verifiability[C]//Proc.of 2th Int'l Symposium on Data,Privacy and E-Commerce(ISDPE 2010).2010:84-89.
  • 5Ayad F Barsoum,Anwar Hasan M.Provable Possession and Replication of Data over Cloud Servers[EB/OL].[2013-08-05].http://www.cacr.math.uwaterloo.ca/techreport/2010/cacr2010-32.pdf.
  • 6Ayad F Barsoum,Anwar Hasan M.Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers[C]//Proc.of 12th IEEE/ACM International Symposium on Cluster,Cloud and Grid Computing (CCGRID 2012).2012:829-834.
  • 7Ayad F Barsoum,Anwar Hasan M.On Verifying Dynamic Multiple Data Copies over Cloud Servers[EB/OL].[2012-10-14].https://eprint.iacr.org/2011/447.pdf.
  • 8Wang Cong,Wang Qian,Ren Kui,et al.Ensuring data storage security in cloud computing[C]//Proc.of 17th International Workshop on Quality of Service 2009 (IWQoS 2009).2009:1-9.
  • 9陈兰香.一种基于同态Hash的数据持有性证明方法[J].电子与信息学报,2011,33(9):2199-2204. 被引量:30
  • 10Bellare M,Goldreich O,Goldwasser S.Incremental Cryptography:the Case of Hashing and Signing[C]//Proc.of 14th Annual International Cryptology Conference on Advances in Cryptology (CRYPT' 94).1994:216-233.

二级参考文献43

  • 1Deswarte Y, Quisquater J J, and Saidane A. Remote integrity checking. Proceedings of IICIS'03, Switzerland, Nov. 13-14, 2003: 1-11.
  • 2Ateniese G, Burns R, Curtmola R, et al.. Provable data possession at untrusted stores. Proceedings of ACM-CCS '07, Alexandria, Virginia, USA, Oct. 28-31, 2007: 598-609.
  • 3Ateniese G. Kamara S, and Katz J. Proofs of Storage from homomorphic identification protocols. Proceedings of ASIACRYPT '09, Tokyo, Japan, Dec. 6-10, 2009: 319-333.
  • 4Ateniese G, Pietro R D, Mancini L V, et al.. Scalable and efficient provable data possession. Proceedings of SecureComm'08, Istanbul, Turkey, Sept. 22-26, 2008: 1-10.
  • 5Curtmola R, Khan O, Burns R, and Ateniese G. MR-PDP: multiple-replica provable data possession. Proceedings of ICDCS '08, Beijing, China, June 19, 2008: 411-420.
  • 6Erway C, Kttpcu A, Papamanthou C, et al.. Dynaxnic provable data possession. Proceedings of ACM-CCS'09, Chicago, Illinois, USA, Nov. 9-13, 2009: 213-222.
  • 7Juels A and Kaliski B S. Pors: proofs of retrievability for large files. Proceedings of ACM-CCS'07, Alexandria, Virginia, USA, Oct. 28-31, 2007: 584-597.
  • 8Shacham H and Waters B. Compact proofs of retrievability. Proceedings of ASIACRYPT '08, Melbourne, Australia, Dec. 7-11, 2008: 90-107.
  • 9Boneh D, Lynn B, and Shacham H. Short signatures from the Well pairing. Journal of Cryptology, 2004, 17(4): 297-319.
  • 10Dodis Y, Vadhan S, and Wichs D. Proofs of retrievability via hardness amplification. Proceedings of TCC'09, San Francisco, CA, USA, Mar. 15-17, 2009: 109-127.

共引文献54

同被引文献9

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部