期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

云存储中基于喷泉码的数据恢复系统

Fountain code based data recovery system for cloud storage
下载PDF
导出
摘要 云存储服务作为一种新的数据存储和管理服务拥有便携易用的特点,但也伴随着一个重要问题：如何确保数据的完整性和可恢复性.为了解决此问题,设计并实现了一个基于喷泉码的数据恢复系统.该方案采用喷泉码对数据编码确保一定篡改比例下的数据可恢复,同时验证数据完整性时采用哈希函数的时间复杂度.当用户担心自己的数据被篡改时,只需向服务器发出挑战,根据服务器的应答便可知晓自己存储的数据是否完整;一旦发现数据被篡改,可以立即要求服务器定位篡改数据并监督服务器完成数据恢复.通过实验分析,该方案在数据篡改率为1％～5％时完整性检测率能够达到99％. As a new service for data storage and management,cloud storage has the virtue of portability and simplicity in use.However,it also prompts a significant problem of ensuring the integrity and recovery of data.A data recovery system for cloud storage based on fountain code was designed to resolve the problem.In this system,the user encoded his data by fountain code to make the tampered data recoverable,and tested the data＇s integrity with Hash functions so that the complexity in data verification and recovery was reduced.Through this system,the user can verify whether his data have been tampered or not by sending a challenge to the servers.Furthermore,once some data have been found tampered,the user can require and supervise the servers to locate and repair them timely.The experimental results show that the data integrity detection precision reaches 99％ when the data＇s manipulation rate is 1％-5％.
作者 彭真 陈兰香 郭躬德
机构地区 福建师范大学数学与计算机科学学院 网络安全与密码技术福建省重点实验室(福建师范大学)
出处 《计算机应用》 CSCD 北大核心 2014年第4期986-993,共8页 journal of Computer Applications
基金 国家自然科学基金资助项目(61175123) 福建省高校产学合作重大项目(2010H6007) 福建省自然科学基金资助项目(2011J05148)
关键词 云存储 喷泉码 数据持有性证明 篡改检测 数据恢复 cloud storage fountain code provable data possession tampering detection data recovery
分类号 TP309.3 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献24

  • 1ATENIESE G, BURNS R, CURTMOLA R, et al. Provable data possession at untrusted stores [ C]//CCS 2007: Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM, 2007:598-609.
  • 2ATENIESE G, KAMARA S, KATZ J, et al. Proofs of storage from homomorphic identification protocols [ C]// ASIACRYPT 2009: Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security, LNCS 5912. Berlin: Springer-Verlag, 2009:319-333.
  • 3ATENIESE G, PIETRO R D, MANCINI L V. Scalable and efficient provable data possession [ C]//ICAR 2008: Proceedings of the 4th International Conference on Security and Privacy in Communication Networks. New York: ACM, 2008:22 -25.
  • 4CURTMOLA R, KHAN O, BURNS R C, et al. MR-PDP: Multi- ple-replica provable data possession [ C]// ICDCS 2008: Proceed- ings of the 28th International Conference on Distributed Computing Systems. Washington, DC: IEEE Computer Society, 2008: 411- 420.
  • 5ERWAY C, KUPCU A, PAPAMANTHOU C, et al. Dynamic prov- able data possession [ C]// IACR 2008: Proceedings of the 16th ACM conference on Computer and Communications Security. New York: ACM, 213-222.
  • 6WANG Q, WANG C, REN K, et al. Enabling public auditability and data dynamics for storage security in cloud computing [ J]. IEEE Transactions on Parallel and Distributed Systems, 2011, 22 (5): 847 -859.
  • 7陈兰香.一种基于同态Hash的数据持有性证明方法[J].电子与信息学报,2011,33(9):2199-2204. 被引量：30
  • 8CHEN L. Using algebraic signatures for remote data possession chec- king [C]// CDCKD 2011: Cyber-Proceedings of the 2011 Interna- tional Conference on Enabled Distributed Computing and Knowledge Discovery. Piscataway: IEEE, 2011:289-294.
  • 9CHEN L. Using algebraic signatures to check data possession in cloud storage [ J]. Future Generation Computer Systems, 2012, 29 (7) : 1709 - 1715.
  • 10CHEN L, GUO G. An efficient data possession checking in cloud storage [ J]. International Journal of Digital Content Technology and its Applications, 2011, 5(4): 43-50.

二级参考文献20

  • 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.

共引文献29

计算机应用
2014年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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