期刊文献+

一种新的云存储数据容错存储方式检验方法 被引量:3

New Method for Checking the Data Stored with Fault Tolerance in Cloud
下载PDF
导出
摘要 云存储中,防止数据丢失的关键是实现文件容错。然而,云存储服务商可能没有提供承诺的容错水平,导致用户蒙受数据丢失和经济损失的双重风险。现有云存储数据容错存储方式检验方法存在服务器预读取欺骗攻击,并且效率低、实用性差,不能达到在一定概率范围内,快速、轻量级地检测出犯规的服务器行为的要求。针对上述问题,该文利用磁盘顺序存取和随机存取的差异性设计了一种远程数据容错存储方式检验方法随机与顺序访问时间差异化(DRST)方法,其原理是文件块被分散地放在不同磁盘上,读取一个磁盘上顺序存储的文件块比随机读取不同磁盘上的文件块所需的响应时间短。最后,对所提方法进行了严格的理论证明和深入的性能分析,结果表明,所提方法能够快速检验出服务器是否为用户提供了其承诺的容错水平,并且比现有方案更安全,更高效。 Implementation of file fault tolerance is the key for preventing data loss in cloud. However, cloud storage service providers may not offer the committed level, which results in that users may suffer data loss and economic loss. Existing inspection algorithms of testing of data fault tolerance in cloud have disadvantages such as spoofing attack of pre-fetch, low efficiency and poor practicality, which can not detect the foul behavior of cloud storage providers within a certain probability. To deal with the above problems, utilizing the difference of sequential access and random access, a remote testing algorithm of data fault tolerance in cloud named (Difference of Random and Sequential access Time) (DRST) is designed. The core idea is that the time of reading blocks of a file stored in order on a disk is much shorter than reading blocks of a file stored random on different disks. A strict theoretical proof and a in-depth performance analysis to the proposed scheme are carried out. The results show that the proposed scheme can accurately detect whether the cloud storage provider supplies clients with the committed level of fault tolerance.What's more, the proposed scheme is much more efficient than the existing ones.
出处 《电子与信息学报》 EI CSCD 北大核心 2016年第10期2640-2646,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金青年基金(61303219) 国家自然科学基金(61672415) 中央高校基本科研业务费(JB140303)~~
关键词 云存储 云文件安全 数据容错能力 随机存取 顺序存取 Cloud storage Cloud file security Data fault tolerance Random access Sequential access
  • 相关文献

参考文献12

  • 1Chinese Institute of Electronics. Future oriented cloud service providers[C]. The Seventh Annual China Cloud Computing Conference, Beijing, China, 2015: 1080-1092.
  • 2BARACALDO N, ANDROULAKI E, GLIDER J, et al. Reconciling end-to-end confidentiality and data reduction in cloud storage[C]. Proceedings of the 6th ACM Workshop on Cloud Computing Security, Scottsdale, AZ, USA, 2014: 4003-4108.
  • 3BOWERS K, DIJK M, JUELS A, et al. How to tell if your cloud files are vulnerable to drive crashes[C]. Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS), Chicago, IL, USA, 2011: 2780-2814.
  • 4LORENA G and ORFILA A. An efficient confidentiality- preserving proof of ownership for @duplication[J]. Yournal of Network and Computer Applications, 2015, 50: 49-59.
  • 5LI M, QIN C, and LEE P. CDStore: toward reliable, secure, and cost-efficient cloud storage via convergent dispersal[C]. Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference, Santa Clara, CA, USA, 2015: 3508-3520.
  • 6JUELS A and KALISKI B. PORs - proofs of retrievability for large files[C]. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS), Alexandia, USA. 2007: 584-597.
  • 7SHACHAM H and WATERS B. Compact proofs of retrievability[C]. Asiacrypt 2008, Springer-Verlag, Josef Pieprzyk, 2008: 90-107.
  • 8ATENIESE G, BURNS R, CURTMOLA R, et al. Provable data possession at untrusted stores[C]. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS), Alexandia, USA, 2007: 598-609.
  • 9DODIS Y, VADHAN S, and WICHS D. Proofs of retrievability via hardness amplification[C]. Theory of Cryptography Conference (TCC), San Francisco, USA, 2009: 235-248.
  • 10CURTMOLA R, KHAN O, BURNS R, et al. MR.PDP: Multiple-replica provable data possession[C]. Proceedings of 28th IEEE International Conference on Distributed Computing Systems (ICDCS), Beijing, China, 2008: 767-779.

同被引文献23

引证文献3

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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