浏览全部资源
扫码关注微信
1. 江苏理工学院计算机工程学院 常州213001
2. 江苏理工学院云计算与智能信息处理常州市重点实验室 常州213001
[ "李红卫,男,江苏理工学院副教授,主要研究方向为嵌入式软件与网络安全。" ]
[ "叶飞跃,男,江苏理工学院教授,主要研究方向为数据挖掘。" ]
[ "陈丹,女,江苏理工学院讲师,主要研究方向为网络安全与无线通信。" ]
网络出版日期:2013-12,
纸质出版日期:2013-12-20
移动端阅览
李红卫, 叶飞跃, 陈丹. 一种基于ORAM的数据可恢复性证明与访问模式的隐藏[J]. 电信科学, 2013,29(12):101-106.
Hongwei Li, Feiyue Ye, Dan Chen. Provable Data Recoverability and Hide-Able Access Pattern Based ORAM[J]. Telecommunications science, 2013, 29(12): 101-106.
李红卫, 叶飞跃, 陈丹. 一种基于ORAM的数据可恢复性证明与访问模式的隐藏[J]. 电信科学, 2013,29(12):101-106. DOI: 10.3969/j.issn.1000-0801.2013.12.016.
Hongwei Li, Feiyue Ye, Dan Chen. Provable Data Recoverability and Hide-Able Access Pattern Based ORAM[J]. Telecommunications science, 2013, 29(12): 101-106. DOI: 10.3969/j.issn.1000-0801.2013.12.016.
随着云计算的发展与应用,越来越多的客户选择云存储作为存储媒质,因此,数据的完整性和私密性成为客户关心的主要问题。基于无关RAM模型机提出一种新的结构,将客户文件分割成大小相等的数据块,每个数据块在云存储中有两个备份,且随机地存储在不同的文件中,以保证数据的完整性。利用同态散列算法验证数据的可持有性,通过无关RAM隐藏客户对服务器的访问模式,敌手无法从客户的数据访问模式中获取有用的信息,从而实现了数据的私密性。
With the development and application of cloud computing
more and more customers choose cloud storage as the storage medium
therefore
data integrity and privacy become a major problem that the customers concern. A new structure based on oblivious RAM model was proposed. The customer file was composed by data blocks of equal-sized
and each data block had two backups in the cloud storage
and they were randomly stored in different cloud files in order to ensure data integrity. Oblivious RAM allowed a client to hide its data access patterns from an untrusted server. The data possession was verified to utilize homomorphic hash algorithm. The adversary can not obtain useful information from the client access data pattern
and the data privacy is guaranteed.
Wang C , Lou W J , et al . Toward publicly auditable secure cloud data storage services . IEEE Network , 2010 , 24 ( 4 ): 19 ~ 24
李红卫 , 古春生 , 白凤娥 . 安全访问外包数据的研究 . 电子技术应用 , 2013 , 39 ( 7 ): 54 ~ 56
Uels A , Kaliski B S . Pors: proofs of retrievability for large files . Proceedings of the 14th ACM Conference on Computer and Communications Security , Alexandria, USA , 2007 : 584 ~ 597
Ateniese G , Burns R , Curtmolar R , et al . Provable data possession at untrusted stores . Proceedings of the 14th ACM Conference on Computer and Communications Security , Alexandria, USA , 2007 : 598 ~ 609
Shacham H , Waters B . Compact Proofs of Retrievability . Proceedings of Asiacrypt'08 , Melbourne, Australia , 2008
Dodis Y , Vadhan S P , Wichs D . Proofs of retrievability via hardness amplitication . Proceedings of the 6th Theory of Cryptography Conference , San Francisco , 2009 : 109 ~ 127
朱岩 , 王怀习 胡泽行 等 . 数据可恢复性的零知识证明 . 中国科学:信息科学 , 2011 , 41 ( 10 ): 1227 ~ 1237
梁彪 , 曹宇估 秦中元 等 . 云计算下的数据存储安全可证明性综述 . 计算机应用研究 , 2012 , 29 ( 7 ): 2416 ~ 2421
陈兰香 . 一种基于同态Hash的数据持有性证明方法 . 电子与信息学报 , 2011 , 33 ( 9 ): 2199 ~ 2204
Goldreich O , Ostrovsky R . Software protection and simulation on oblivious RAMs . Journal of the ACM , 1996 , 43 ( 3 ): 431 ~ 473
Elaine S T H , Chan H , Stefanov E , et al . Oblivious RAM with O((logn) 3 )worst-case cost . Proceedings of the 17th International Conference on the Theory and Application of Cryptology and Information Security , Seoul, South Korea , 2011
Pinkas B , Reinman T . Oblivious ram revisited . Proceedings of CRYPTO , California, USA , 2010
Goldreich O . Towards a theory of software protection and simulation by oblivious RAMs . Proceedings of STOC 1987 , New York , 1987
Damgard I , Meldgaard S , Nielsen J B . Oblivious ram revisited . Proceedings of TCC 2011 , Rhode Island,USA , 2011
Goodrich M T , Mitzenmacher M . Privacy-preserving access of outsourced data via oblivious ram simulation . Automata, Languages and Programming , 2011 ( 5 )
Kushilevitz E , Lu S , Ostrovsky R . On the(in)security of hash-based oblivious ram and a new balancing scheme . Proceedings of SODA, Kyoto Japan , 2012
0
浏览量
502
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构