期刊文献+

基于再生码的拟态数据存储方案 被引量:6

Mimic storage scheme based on regenerated code
下载PDF
导出
摘要 针对云存储系统由于静态的存储架构和存储模式而带来的安全威胁,提出一种基于再生码的拟态化存储方案。该方案利用网络编码方案将数据存储在云端数据节点上,采用一种基于再生码的拟态变换机制,可根据随机时变因素动态地改变数据的存储状态,且能够保证数据完整性和数据持续可用性。拟态变换机制具有随机性、时变性和动态性,通过增加存储系统的不确定性,可阻断和干扰攻击链,增加了攻击者实施攻击的难度和成本,提高了系统的安全性和可靠性。 Aiming to solve security threats in the cloud storage system due to static storage architecture and storage mode,a mimic storage scheme based on regenerated code was proposed.The scheme used network coding scheme to store the data in the cloud data node,and used mimicry transformation mechanism based on regeneration code to change data storage state dynamically according to the random time-varying factors,which could guarantee data integrity and data availability continuously.The mimicry transformation mechanism is a random,time-varying and dynamic scheme,which increases the uncertainty of storage system.It blocks and interferes with the attack chain,increases the difficulty and cost of the attack operation,and improves the security and reliability of the system.
作者 陈越 王龙江 严新成 张馨月 CHEN Yue;WANG Longjiang;YAN Xincheng;ZHANG Xinyue(College of Target and Data Engineering,PLA Information Engineering University,Zhengzhou 450001,China;61660 Unit of PLA,Beijing 100089,China)
出处 《通信学报》 EI CSCD 北大核心 2018年第4期21-34,共14页 Journal on Communications
基金 国家重点基础研究发展计划("973"计划)基金资助项目(No.2012CB315901) 河南省科技攻关计划基金资助项目(No.17210221001)~~
关键词 拟态 网络编码 再生码 云存储 mimic network coding regenerated code cloud storage
  • 相关文献

参考文献10

二级参考文献69

  • 1刘奇旭,张翀斌,张玉清,张宝峰.安全漏洞等级划分关键技术研究[J].通信学报,2012,33(S1):79-87. 被引量:36
  • 2李之棠,徐晓丹.动态蜜罐技术分析与设计[J].华中科技大学学报(自然科学版),2005,33(2):86-88. 被引量:19
  • 3孙红兵,陈沫,蔡一兵,李忠诚.IPv4/IPv6转换网关性能测试方法研究[J].计算机工程,2006,32(24):93-95. 被引量:3
  • 4Layman P, Varian H R. How much information 2003? [EB/OL]. [2010 10-18]. http://www2, sims. berkeley. edu/research/proiects/how-mueh-info-2003.
  • 5Pinheiro E, Weber W D, Barroso L A. Failure trends in a large disk drive population [C] //Proc of the 5th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2007 : 17-28.
  • 6Schroeder B, Gibson G A. Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you? [C] //Proc of the 5th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2007: 1-16.
  • 7Bairavasundaram L N, Goodson G R, Pasupathy S, et al. An analysis of latent sector errors in disk drives [C]//Proc of 2007 ACM SIGMETRICS Int Conf on Measurement and Modeling of Computer Systems. New York: ACM, 200: 289-300.
  • 8Hafner J M, Deenadhayalan V, Rao K, et al. Matrix methods for lost data reconstruction in erasure codes [C] // Proc of the 4th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2005: 183-196.
  • 9Hafner J M, Deenadhayalan V, Kanungo T, et al. Performance metrics for erasure codes in storage systems, RJ 10321 [R]. San Jose, [A] IBM Research, 2004.
  • 10Li M, Shu J, Zheng W. GRID Codes: Strip based erasure codes with high fault tolerance for storage systems [J].ACM Transon Storage, 2009, 4(4): 1-22.

共引文献404

同被引文献34

引证文献6

二级引证文献63

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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