期刊文献+

云存储中双备份数据的安全访问 被引量:2

Secure Access of Two-Copy Data in Cloud Storage
下载PDF
导出
摘要 数据的完整性和私密性是客户将数据存储到云存储中时关心的主要问题.提出了一种新的ORAM结构,其访问云存储时间复杂度为O(1)、需要O(cN)(0<c<1)客户端存储量和O(N)服务器存储量.将客户数据双倍份到两个服务器中以保证数据的完整性,通过ORAM隐藏客户对服务器的访问模式,敌手无法从客户的访问模式中获取有用的信息,从而实现了数据的私密性. Data integrity and privacy become major problems that the customers concern when the data is stored in the cloud storage. The paper proposes a novel oblivious RAM construction that achieves O(1)time complexity of access cloud storage,while consuming O ( cN ) ( 0&lt;c&lt;1 ) client-side storage and O ( N ) server-side storage. The paper proposes a technique in which the client data is stored in two servers that each server has a client data copy in order to ensure data integrity. Oblivious RAM allows a client to hide its data access patterns from an untrusted server. The adversary can not obtain useful information from the client access pattern,and the data privacy is guaranteed.
出处 《南京师大学报(自然科学版)》 CAS CSCD 北大核心 2014年第1期47-51,共5页 Journal of Nanjing Normal University(Natural Science Edition)
基金 国家自然科学基金(61142007) 江苏省高校自然科学研究项目(13KJB520005) 江苏省普通高校研究生科研创新计划项目(CXZZ13_0493) 常州市云计算与智能信息处理重点实验室建设项目(CM20123004)
关键词 云存储 访问模式 双服务器 RAM cloud storage oblivious RAM access pattern two servers
  • 相关文献

参考文献11

  • 1Ateniese G, Burns R, Curtmolar R, et al. Provable data possession at untrusted stores [ C ]//Proc of the 14th ACM Conference on Computer and Communications Security. New York :ACM Press,2007:598-609. 被引量:1
  • 2Juels A, Kaliski B S. Pors : proofs of retrievability for large files [ C ]//Proc of ACM-CCS'07. New York : ACM Press,2007:584- 597. 被引量:1
  • 3Bowers K D, Juels A, Oprea A. HAIL: A high-availability and integrity layer for cloud storage [ C ]//Proc of CCS'09. New York :ACM Press ,2009 : 187-198. 被引量:1
  • 4陈兰香.一种基于同态Hash的数据持有性证明方法[J].电子与信息学报,2011,33(9):2199-2204. 被引量:30
  • 5朱岩,王怀习,胡泽行,Gail-Joon AHN,胡宏新.数据可恢复性的零知识证明[J].中国科学:信息科学,2011,41(10):1227-1237. 被引量:6
  • 6曹夕,许力,陈兰香.云存储系统中数据完整性验证协议[J].计算机应用,2012,32(1):8-12. 被引量:20
  • 7Goldreich O, Ostrovsky R. Software protection and simulation on oblivious RAMs [ J]. Journal of the ACM, 1996,43 (3) :431- 473. 被引量:1
  • 8Pinkas B, Reinman T. Oblivious ram revisited [ C ]//Proc of CRYPTO. Berlin Heidelberg: Springer,2010: 502-519. 被引量:1
  • 9Stefanov E, Shi E, Song D. Towards practical oblivious ram [ C ]//Proe of NDSS' 12. California:the Internet Society, 2011: 1-19. 被引量:1
  • 10Elaine Shi T H, Hubert Chan, Emil Stefanov, et al. Oblivious RAM with O((logn) 3)worst-case cost[ C ]//Proceedings of the 17th International Conference on the Theory and Application of Cryptology and Information Security. Berlin Heidelberg: Springer,2011 : 197-214. 被引量:1

二级参考文献47

  • 1Deswarte Y, Quisquater J J, and Saidane A. Remote integrity checking. Proceedings of IICIS'03, Switzerland, Nov. 13-14, 2003: 1-11. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 8Shacham H and Waters B. Compact proofs of retrievability. Proceedings of ASIACRYPT '08, Melbourne, Australia, Dec. 7-11, 2008: 90-107. 被引量:1
  • 9Boneh D, Lynn B, and Shacham H. Short signatures from the Well pairing. Journal of Cryptology, 2004, 17(4): 297-319. 被引量:1
  • 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. 被引量:1

共引文献50

同被引文献44

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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