Computer Science ›› 2019, Vol. 46 ›› Issue (11A): 341-347, 375.

• Network & Communication • Previous Articles     Next Articles

Survey of ORAM Research in Cloud Storage

GU Chen-yang1, FU Wei1, LIU Jin-long2, SUN Gang2   

  1. (Department of Information Security,Naval University of Engineering,Wuhan 430033,China)1;
    (Naval Confidential Password Office,Beijing 100841,China)2
  • Online:2019-11-10 Published:2019-11-20

Abstract: In a cloud storage environment,servers and the third party can fetch information through analyzing the users’ access behaviour,which may cause threats to users’ information security.ORAM mechanism is one of the main strategies which can hide users’ visiting patterns.This mechanism can effectively conceal the corresponding relationships between the access behaviour and the visiting targets.Secure access mechainsm to hide user’s access intention is one of the main means to hide user’s access model at present.Through the study of the basic theories and the development process of the ORAM,this paper concluded the basic scheme of this mechanism and set up a SSIBT performance evaluation index system to make comparisons and analysis between the classic ORAM mechanism and its optimization scheme.Finally,possible research directions of ORAM were summarized based on the main research focus.

Key words: Cloud storage, ORAM, Behavioral security, Access mechanisms, Privacy protection

CLC Number: 

  • TP309
[3]PASQUALE P,REFIK M,MELEK O,et al.CloudDedup:Se-cure Deduplication with Encrypted Data for Cloud Storage[P].2013.
[4]JUNG T,LI X Y,WAN Z,et al.Control cloud data access privilege and anonymity with fully anonymous attribute-basedencryption[J].IEEE Trans.on Information Forensics and Security,2015,10(1):190-199.
[7]GOLDREICH O,OSTROVSKY R.Software protection andsimulation on oblivious RAMs[J].Journal of the ACM (JACM),1996,43(3):431-473.
[9]HUSSAIN S.A Low Performance-Overhead ORAM Design for Processor System with Un-trusted Off-chip Memory[C]∥Proceedings of 2018 3rd International Conference on Computer Science and Information Engineering(ICCSIE2018).International Information and Engineering Association:Computer Science and Electronic Technology International Society,2018:12.
[11]KUSHILEVITZ E,LU S,OSTROVSKY R.On the (in) security of hash-based oblivious RAM and a new balancing scheme[C]∥Proc.of the23rd Annual ACM-SIAM Symp.on Discrete Algorithms.Society for Industrial and Applied Mathematics,2012:14-156.
[13]WANG X,CHAN H,SHI E.Circuit ORAM:On tightness of the goldreich-ostrovsky lower bound[C]∥Proc.of the 22nd ACM Conf.on Computer and Communications Security.ACM Press,2015:850-861.
[14]GENTRY C,HALEVI S,JUTLA C,et al.Private database access with he-over-oram architecture[C]∥Proc.of the 13th Int’l Conf.on Applied Cryptography and Network Security.Springer-Verlag,2015:172-191.
[16]SHI E,CHAN T H,STEFANOV E,et al.Oblivious RAMwith O((logN) 3) worst-casecost [M]∥Advances in Cryptology-ASIA CRYPT 2011.Springer Berlin Heidelberg,2011:197-214.
[21]STEFANOV E,SHI E,SONG D.Towards practical oblivious RAM[EB/OL].http://arxiv.orpjabs/1I06.3652.
[22]SHI E,CHAN T H,STEFANOV E,et al.Oblivious RAMwith O ((logN)3) worst-casecost[M]∥Advances in Cryptology-ASIA CRYPT 2011.Springer Berlin Heidelberg,2011:197-214.
[23]DOERNER J.Scaling ORAM for secure computation[C]∥Proc.of the 24th ACM Conf.on Computer and Communications Security.ACM Press,2017:523-535.
[24]ZHANG J,MA Q,ZHANG W,et al.TSKT-ORAM:A two-server kary tree ORAM for access pattern protection in cloud storage∥2016 IEEE Military Communications Conference(MILCOM).IEEE,2016.
[25]TEEUWEN P:Evolution of oblivious RAM schemes[D].Eindhoven:Eindhoven University of Technology,2015.
[26]STEFANOV E,VAN DIJK M,SHI E,et al.Path oram:An extremely simple obliviousram protocol[C]∥Proceedings of the 2013 ACM SIGSAC conference on Computer & Communications Security.ACM,2013:299-310.
[27]LING R,FLETCHER C W,KWON A,et al.Constants count practical improverments to oblivious RAM∥Usenix Confe-rence on Security Symposium.2015.
[28]DAUTRICH J,STEFANOV E,SHI E.Burst ORAM:Minimi-zing ORAM response times for bursty access patterns[C]∥23rd USENIX Security Symposium (USENIX Security 14).2014:749-764.
[29]MAAS M,LOVE E,STEFANOV E,et al.Phantom:Practicaloblivious computation in a secure processor[C]∥Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security.ACM,2013:311-324.
[30]PAGH R,RODLER F F.Cuckoo hashing[J].Journal of Algorithms,2003,51(2).
[31]PINKAS B,REINMAN T.Oblivious ram revisited[C]∥Proc.of the 30th Annual Cryptology Conf..Berlin:Springer-Verlag,2010:502-519.
[32]KUSHILEVITZ E,LU S,OSTROVSKY R.On the (in) security of hash-based oblivious RAM and a new balancing scheme[C]∥Proc.of the23rd Annual ACM-SIAM Symp.on Discrete Algorithms.Society for Industrial and Applied Mathematics,2012:143-156.
[33]GOODRICH M T,MITZENMACHER M.Privacy-Preservingaccess of outsourced data via oblivious RAM simulation[C]∥Proc.of the 38th Int’l Colloquium on Automata,Languages,and Programming.Springer-Verlag,2011:576-587.
[34]GOODRICH M T.Randomized shellsort:A simple oblivioussorting algorithm[C]∥Proc.of the 21st Annual ACM-SIAM Symp.On Discrete Algorithms.Society for Industrial and Applied Mathematics,2010:1262-1277.
[35]GOLDBERG I.Improving the robustness of private information retrieval[C]∥Proc.of the 28th IEEE Symp.on Security and Privacy.IEEE,2007:131-148.
[36]GENTRY C,GOLDMAN K A,HALEVI S,et al.OptimizingORAM and using it efficiently for secure computation[C]∥Proc.of the 13th Int’l Symp.on Privacy Enhancing Technologies.Springer-Verlag,2013:1-18.
[37]DEVADAS S,DIJK M V,FLETCHER C W,et al.OnionORAM:A constant bandwidth blowup oblivious RAM[C]∥Proc.of the 13th Theory of Cryptography Conference.Springer-Verlag.2016:145-174.
[38]REN L,FLETCHER C W,KWON A,et al.Constants count:Practical improvements to oblivious RAM[C]∥Proc.of the 24th USENIX Conf.on Security Symp..USENIX Association,2015:415-430.
[39]MOATAZ T,BLASS E O,MAYBERRY T.CHf-ORAM:Aconstant communication ORAM without homomorphic encryption[R].2015/1116,Cryptology ePrint Archive,2015.
[40]WILLIAMS P,SION R,CARBUNAR B.Building castles out of mud:Practical access pattern privacy and correctness on untrusted storage[C]∥Proc.of the 15th ACM Conf.on Computer and Communications Security.ACM Press,2008:139-148.
[41]WILLIAMS P,SION R.Access privacy and correctness on untrusted storage[J].ACM Trans.on Information and System Security,2013,16(3):12.
[43]BOYLE E,CHUNG K M,PASS R.Oblivious parallel RAM and applications[C]∥Proc.of the 13th Theory of Cryptography Conference.Springer-Verlag,2016:175-204.
[44]GOODRICH M T,MITZENMACHER M,OHRIMENKO O,et al.Privacy-Preserving group data access via stateless oblivious RAM simulation[C]∥Proc.of the 23rd Annual ACM-SIAM Symp.on Discrete Algorithms.Society for Industrial and Applied Mathematics,2012,13(S1):157-167.
[46]BINDSCHAEDLER V,NAVEED M,PAN X,et al.Practicingoblivious access on cloud storage:The gap,the fallacy,and the new way forward[C]∥Proc.of the 22nd ACM Conference on Computer and Communications Security.ACM Press,2015:837-849.
[47]SAHIN C,ZAKHARY V,ABBADI E,et al.Taostore:Overcoming asynchronicity in oblivious data storage[C]∥Proc.of the 37th IEEE Symp.on Security and Privacy.IEEE,2016:198-217.
[49]BOGDANOV D,LAUR S,WILLEMSON J.Sharemind:Aframework for fast privacy-preserving computations[C]∥Proc.of the 13th European Symp.on Research in Computer Security.Springer-Verlag,2008:192-206.
[50]BEN-DAVID A,NISAN N,PINKAS B.FairplayMP:A system for secure multi-party computation[C]∥Proc.of the 15th ACM Conf.on Computer and Communications Security.ACM Press,2008:257-266.
[52]WANG X S,NAYAK K,LIU C,et al.Oblivious data structures[C]∥Proc.of the 21st ACM Conf.on Computer and Communications Security.ACM Press,2014:215-226.
[1] QIAO Mao,QIN Ling. AB-ACCS Scheme for Revocation of Efficient Attributes in Cloud Storage Services [J]. Computer Science, 2019, 46(7): 96-101.
[2] ZHANG Lin. Patent Analysis on Picture Display of Three Dimensional Panorama [J]. Computer Science, 2019, 46(6A): 558-561.
[3] LV Zhi-quan, LI Hao, ZHANG Zong-fu, ZHANG Min. Topic-based Re-identification for Anonymous Users in Social Network [J]. Computer Science, 2019, 46(6): 143-147.
[4] DONG Gui-shan, CHEN Yu-xiang, FAN Jia, HAO Yao, LI Feng. Research on Privacy Protection Strategies in Blockchain Application [J]. Computer Science, 2019, 46(5): 29-35.
[5] GU Yi-ming, BAI Guang-wei, SHEN Hang, HU Yu-jia. Pre-cache Based Privacy Protection Mechanism in Continuous LBS Queries [J]. Computer Science, 2019, 46(5): 122-128.
[6] XIE Si-jiang,JIA Bei,WANG He,XU Shi-cong. Cloud Big Data Integrity Verification Scheme Based on Multi-branch Tree [J]. Computer Science, 2019, 46(3): 188-196.
[7] WU Xiu-guo, LIU Cui. Data Replicas Distribution Transition Strategy in Cloud Storage System [J]. Computer Science, 2019, 46(10): 202-208.
[8] ZHOU Yi-hua, ZHANG Bing, YANG Yu-guang, SHI Wei-min. Cluster-based Social Network Privacy Protection Method [J]. Computer Science, 2019, 46(10): 154-160.
[9] XU Hua-jie, WU Qing-hua, HU Xiao-ming. Privacy Protection Algorithm Based on Multi-characteristics of Trajectory [J]. Computer Science, 2019, 46(1): 190-195.
[10] ZHANG Pan-pan, PENG Chang-gen, HAO Chen-yan. Privacy Protection Model and Privacy Metric Methods Based on Privacy Preference [J]. Computer Science, 2018, 45(6): 130-134.
[11] JIN Yu, CAI Chao, HE Heng and LI Peng. BTDA:Dynamic Cloud Data Updating Audit Scheme Based on Semi-trusted Third Party [J]. Computer Science, 2018, 45(3): 144-150.
[12] LIU Yan-tao, LIU Heng. Cloud Storage System Based on Network Coding [J]. Computer Science, 2018, 45(12): 293-298,312.
[13] PANG Xiao-qiong, REN Meng-qi, WANG Tian-qi, CHEN Wen-jun, NIE Meng-fei. Perfect Privacy-preserving Batch Provable Data Possession [J]. Computer Science, 2018, 45(11): 130-137,154.
[14] ZHANG Gui-peng, CHEN Ping-hua. Secure Data Deduplication Scheme Based on Merkle Hash Tree in HybridCloud Storage Environments [J]. Computer Science, 2018, 45(11): 187-192,203.
[15] TANG Yi-ping, HU Ke-gang and YUAN Gong-ping. Automatic Recognition Method of Tunnel Disease Based on Convolutional Neural Network for Panoramic Images [J]. Computer Science, 2017, 44(Z11): 207-211, 250.
Full text



[1] DU Wei, DING Shi-fei. Overview on Multi-agent Reinforcement Learning[J]. Computer Science, 2019, 46(8): 1 -8 .
[2] GAO Li-zheng, ZHOU Gang, LUO Jun-yong, LAN Ming-jing. Survey on Meta-event Extraction[J]. Computer Science, 2019, 46(8): 9 -15 .
[3] CAI Li, LI Ying-zi, JIANG Fang, LIANG Yu. Study on Clustering Mining of Imbalanced Data Fusion Towards Urban Hotspots[J]. Computer Science, 2019, 46(8): 16 -22 .
[4] YANG Zhen, WANG Hong-jun. Important Location Identification of Mobile Users Based on Trajectory Division and Density Clustering Method[J]. Computer Science, 2019, 46(8): 23 -27 .
[5] DENG Cun-bin, YU Hui-qun, FAN Gui-sheng. Integrating Dynamic Collaborative Filtering and Deep Learning for Recommendation[J]. Computer Science, 2019, 46(8): 28 -34 .
[6] ZHONG Feng-yan, WANG Yan, LI Nian-shuang. Node Selection Scheme for Data Repair in Heterogeneous Distributed Storage Systems[J]. Computer Science, 2019, 46(8): 35 -41 .
[7] SUN Guo-dao, ZHOU Zhi-xiu, LI Si, LIU Yi-peng, LIANG Rong-hua. Spatio-Temporal Evolution of Geographical Topics[J]. Computer Science, 2019, 46(8): 42 -49 .
[8] ZHANG Hui-bing, ZHONG Hao, HU Xiao-li. User Reviews Clustering Method Based on Topic Analysis[J]. Computer Science, 2019, 46(8): 50 -55 .
[9] LI Bo-jia, ZHANG Yang-sen, CHEN Ruo-yu. Method for Generating Massive Data with Assignable Distribution[J]. Computer Science, 2019, 46(8): 56 -63 .
[10] LU Xian-guang, DU Xue-hui, WANG Wen-juan. Alert Correlation Algorithm Based on Improved FP Growth[J]. Computer Science, 2019, 46(8): 64 -70 .