An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing

被引:405
作者
Yang, Kan [1 ]
Jia, Xiaohua [1 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
关键词
Storage auditing; dynamic auditing; privacy-preserving auditing; batch auditing; cloud computing; DATA POSSESSION; PROOFS;
D O I
10.1109/TPDS.2012.278
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In cloud computing, data owners host their data on cloud servers and users ( data consumers) can access the data from cloud servers. Due to the data outsourcing, however, this new paradigm of data hosting service also introduces new security challenges, which requires an independent auditing service to check the data integrity in the cloud. Some existing remote integrity checking methods can only serve for static archive data and, thus, cannot be applied to the auditing service since the data in the cloud can be dynamically updated. Thus, an efficient and secure dynamic auditing protocol is desired to convince data owners that the data are correctly stored in the cloud. In this paper, we first design an auditing framework for cloud storage systems and propose an efficient and privacy-preserving auditing protocol. Then, we extend our auditing protocol to support the data dynamic operations, which is efficient and provably secure in the random oracle model. We further extend our auditing protocol to support batch auditing for both multiple owners and multiple clouds, without using any trusted organizer. The analysis and simulation results show that our proposed auditing protocols are secure and efficient, especially it reduce the computation cost of the auditor.
引用
收藏
页码:1717 / 1726
页数:10
相关论文
共 30 条
  • [1] A View of Cloud Computing
    Armbrust, Michael
    Fox, Armando
    Griffith, Rean
    Joseph, Anthony D.
    Katz, Randy
    Konwinski, Andy
    Lee, Gunho
    Patterson, David
    Rabkin, Ariel
    Stoica, Ion
    Zaharia, Matei
    [J]. COMMUNICATIONS OF THE ACM, 2010, 53 (04) : 50 - 58
  • [2] Ateniese G., 2008, IACR CRYPTOLOGY EPRI, P114
  • [3] Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
  • [4] Ateniese G, 2009, LECT NOTES COMPUT SC, V5912, P319, DOI 10.1007/978-3-642-10366-7_19
  • [5] Bairavasundaram LN, 2007, PERF E R SI, V35, P289
  • [6] Deswarte Y, 2004, P 6 WORK C INT INT C
  • [7] Erway CC, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P213
  • [8] Filho D. L. G., 2006, Cryptol. ePrint Arch., V1, P150
  • [9] Goodson GR, 2004, 2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, P135
  • [10] Juels A, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P584