期刊文献+

LS&SSS-RS:可更新密钥分片的数据安全散布方法 被引量:3

LS&SSS-RS:updatable key sharding method for data security dissemination
下载PDF
导出
摘要 数据的安全散布是构建可靠性分布式存储的关键一环,针对现有的数据安全散布方案存在的“密钥保护能力不足和密钥泄露后大规模解码重新加密数据带来的严重资源消耗”等问题,提出了一种数据安全散布方案:LS&SSS-RS。该方案将密钥和密文分开存储,利用拉丁方和Shamir方案将密钥拉丁方进行秘密共享,密文利用RS编码进行分散存储。实验结果表明该方案有效避免了密钥分片的直接暴露,提高了分片的容错性,还能在密钥分片泄露后节约大量的数据更新时间。此外部分数据的丢失不影响原始数据的完整性,避免了单点故障,提高了分布式存储系统的容错性。分析表明该方案能够克服潜在的安全风险,有力地保护密钥的安全,同时节约了大量的时间以及计算资源。 Secure data distribution is a key link to build reliable distributed storage.Aiming at the problems existing in exis-ting data security distribution schemes,such as“insufficient key protection capability and severe resource consumption caused by large-scale decoding and re-encryption of data after key leakage”,this paper proposed a data security distribution scheme:LS&SSS-RS.In this scheme,the key and ciphertext were stored separately,the Latin square of the key was secretly shared by the Latin square and the Shamir scheme,and the ciphertext was distributed stored by RS coding.The experimental results show that the scheme avoids the direct exposure of key sharding,improves the fault tolerance of the sharding,and saves a lot of data update time after the key sharding is leaked.In addition,the loss of some data does not affect the integrity of the original data,avoids the single point of failure,and improves the fault tolerance of distributed storage system.The analysis shows that the scheme can overcome the potential security risks,protect the key security effectively,and save a lot of time and computing resources.
作者 李国 殷俊锋 李静 Li Guo;Yin Junfeng;Li Jing(School of Computer Science&Technology,Civil Aviation University of China,Tianjin 300300,China)
出处 《计算机应用研究》 CSCD 北大核心 2021年第5期1533-1538,共6页 Application Research of Computers
基金 国家自然科学基金联合基金资助项目(U1833114) 国家自然科学基金青年项目(61702521) 民航科技创新重大专项资助项目(MHRD20160109) 民航安全能力项目(TRSA201803)。
关键词 数据安全散布 拉丁方 秘密共享 RS码 密钥更新 data security dissemination Latin square secret sharing RS code key to update
  • 相关文献

参考文献4

二级参考文献57

  • 1周松,王意洁.EXPyramid:一种灵活的基于阵列结构的高容错低修复成本编码方案[J].计算机研究与发展,2011,48(S1):30-36. 被引量:5
  • 2曹尔强,张沂,曹晔,潘继宏.“软件黑盒子”文件加锁和加密的一个方法[J].吉林大学学报(信息科学版),1991,17(3):11-14. 被引量:5
  • 3Layman P, Varian H R. How much information 2003? [EB/OL]. [2010 10-18]. http://www2, sims. berkeley. edu/research/proiects/how-mueh-info-2003.
  • 4Pinheiro 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.
  • 5Schroeder 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.
  • 6Bairavasundaram 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.
  • 7Hafner 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.
  • 8Hafner 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.
  • 9Li 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.
  • 10Blaum M, Brady J, Bruek J, et al. EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures [J].IEEE Trans on Computer, 1995, 44 (2) 192-202.

共引文献146

同被引文献42

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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