期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

安全访问外包数据的研究 被引量：2

Research on secure access of outsourced data
在线阅读 下载PDF
导出
摘要 在存储外包应用中,无关RAM允许客户对不信任服务器隐藏数据存储模式。提出一种新的无关RAM结构,对客户的每个请求仅需常量级代价和少量客户端存储空间即可实现无关访问。 Oblivious RAM allows a client to hide its data access patterns tYom an untrusted server in storage outsourcing ap- plications. This paper proposes a novel oblivious RAM construction that achieves oblivious access with constant cost and a small amount of client-side storage for client every request.
作者 李红卫 古春生 白凤娥
机构地区 江苏理工学院计算机工程学院 江苏理工学院云计算与智能信息处理常州市重点实验室
出处 《电子技术应用》 北大核心 2013年第7期54-56,共3页 Application of Electronic Technique
基金 国家自然科学基金(61142007) 常州市云计算与智能信息处理重点实验室项目(CM20123004)
关键词 无关RAM 访问模式 数据外包 oblivious RAM access pattern data outsourcing
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献9

  • 1GOLDREICH 0 , OSTROVSKY R.Software protection andsimulation on oblivious RAMs[J].Journal of the ACM , 1996 ,43(3):431-473.
  • 2GOLDREICH 0.Towards a theory of software protection andsimulation by oblivious RAMs[C].New York : STOC , 1987.
  • 3AJTAI M,KOLMOS J , SZEMEREDI E. An O(nlogn) sortingnetwork[C]. Boston : STOC,1983.
  • 4BATCHER K.Sorting networks and their applications[C].NJ : AFIPS Spring Joint Computing Conference. 1968.
  • 5PINKAS B , REINMAN T.Oblivious ram revisited[C].California: CRYPTO. 2010.
  • 6GOODRICH M T,MITZENMACHER M.Privacy-preserving access of outsourceddata via oblivious ram simulation[J].Automata,Languagesand Programming,2011(6756):576-587.
  • 7BONEH D , MAZIERES D,POPA R A.Remote oblivious storage : Makingoblivious ram practical [ EB/OL].[2011 -3-30].http : //dspace.mit.edu/bitstream / handle /1721.1/62006/MIT-CSAIL-TR-2011-018.pdf.
  • 8STEFANOV E , SHI E,SONG D.Towards practical obliviousram[C].California:NDSS , 2012.
  • 9SHI E , CHAN T H H , STEFANOV E , et al.ObliviousRAM with o((logn)3) worst-case cost [C]. Seoul :ASIACRYPT,2011.

同被引文献17

  • 1Wang C, Ren K, Lou W J, et al. Toward publicly auditable secure cloud data storage services. IEEE Network, 2010, 24( 4): 19-24.
  • 2Uels 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.
  • 3Ateniese G, Burns R, Curtmolar R, et cd. Provable data possession at untrusted stores. Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, USA, 2007:598-609.
  • 4Shacham H, Waters B. Compact Proofs of Retrievability. Proceedings of Asiacrypt '08, Melbourne, Australia, 2008.
  • 5Dodis 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.
  • 6Goldreich O, Ostrovsky R. Software protection and simulation on oblivious RAMs. Journal of the ACM, 1996, 43 (3):431-473.
  • 7Elaine S T H, Chan H, Stefanov E, et ol. 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.
  • 8Pinkas B, Reinman T. Oblivious ram revisited. Proceedings of CRYPTO, California, USA, 2010.
  • 9Goldreich O. Towards a theory of software protection and simulation by oblivious RAMs. Proceedings of STOC 1987, New York,1987.
  • 10Damgard I, Meldgaard S, Nielsen J B. Perfectly secure oblivious RAM without random oracles. Proceedings of TCC 2011, Rhode Island, USA,2011.

引证文献2

二级引证文献4

电子技术应用
2013年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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