期刊文献+

基于功能性最小存储再生码的数据可恢复验证方案

Proof of Retrievability Scheme Based on Functional Minimum Storage Regenerating Code
下载PDF
导出
摘要 针对云存储环境下数据完整性验证机制中的数据可恢复验证方案(proof of retrievability,POR)存在的损坏数据检测时间长和数据恢复开销大的问题,设计了一种基于功能性最小存储再生码(functional minimum storage regenerating,FMSR)的数据可恢复验证FMSR-POR方案。方案对用户数据进行分块后分别进行FMSR编码,将编码后的数据块存储到云上,通过“挑战应答”协议对编码块进行完整性验证和数据块损坏定位,利用FMSR码特性对损坏数据块进行修复。实验证明,基于FMSR编码的POR方案可以支持动态的数据操作,能够以较高的效率进行损坏数据块定位和修复,且数据修复带宽开销有所减少。 In order to solve the problem of long detection time and excessive data recovery overhead in the existing Proof of Retrievability(POR)scheme of data integrity verification mechanism in cloud storage environment,a new Proof of Retrievability scheme based on functional minimum storage regenerating code is proposed.In this scheme,the user’s data is divided into blocks and encoded with functional minimum storage regenerating code,then the encoded blocks are stored in the cloud.This scheme verifies data integrity and locates damaged coded block through the“challenge-response”protocol,and repairs the damaged block by functional minimum storage regenerating code.Experiments show that the POR scheme based on FMSR can support dynamic data operation,locate and repair damaged data blocks with high efficiency and reduce the bandwidth overhead of data repair.
作者 朱彧 陈越 严新成 李帅 ZHU Yu;CHEN Yue;YAN Xincheng;LI Shuai(Information Engineering University, Zhengzhou 450001, China)
机构地区 信息工程大学
出处 《信息工程大学学报》 2020年第1期68-75,共8页 Journal of Information Engineering University
关键词 数据可恢复验证 功能性最小存储再生码 动态操作 损坏定位 proof of retrievability functional minimum storage regenerating code dynamic operation damage location
  • 相关文献

参考文献2

二级参考文献14

  • 1Giuseppe Ateniese,Randal Bums, Reza Curtmola,et al. Provable data possession at untrusted stores[ C]//Proceedings of the14th ACM conference on Computer and communications security. 2007 :77-83.
  • 2Chris Erway, Alptekin Kupcu y Charalampos Papamanthou,et al. Dynamic Provable Data Possession [ C ] //Proceedings of the16th ACM conference on Computer and communications security. 2009 :66-78.
  • 3Wang Qian,Wang Cong,Li Jin, et al. Enabling public verifiability and data dynamics for storage security in cloud computing[C ] //Proceedings of the 14th European Symposium on Research in Computer Security. 2009 : 110-115.
  • 4Zhu Yan,Hu Hongxin,Ahn Gail-Joon,et al. Cooperative provable data possession for integrity verification in multi-cloud storage[J]. IEEE Transactions on Parallel and Distributed Systems,2012 ,23 (12) :2234-2244.
  • 5Wang Cong, Chow S S M , Wang Qian, et al. Privacy-Preserving Public Auditing for Secure Cloud Storage [ J ] . Computers ,2013,62(2) ;362-375.
  • 6Giuseppe Ateniese,Roberto Di Pietro,Luigi V,et al. Scalable and efficient provable data possession[ C]//proceedings of the4th international conference on Security and privacy in communication netowrks. 2008 : 153-163.
  • 7Giuseppe Ateniese, Seny Kamara,Jonathan Katz. Proofs of Storage from Homomorphic Identification Protocols[ C]//proceed-ings of ASIACHYPT 2009.2009:319-333.
  • 8Zhu Yan,Ahn Gailjoon,Hu Hongxin,et al. Dynamic Audit Services for Outsourced Storages in Clouds[ J]. Services Compu-ting,2013 ,6 :227-238.
  • 9Abolfazli S,Kuala Lumpur,Malaysia,et al. Cloud-Based Augmentation for Mobile Devices: Motivation, Taxonomies, and OpenChallenges[ J]. Communications Surveys & Tutorials,2014,16 :337-368.
  • 10Yang Kan,Jia Xiaohua. An efficient and secure dynamic auditing protocol for data storage in cloud computing [ J ]. IEEETransactions on Parallel and Distributed Systems,2013,24(9) : 1717-1726.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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