Radix Path: A Reduced Bucket Size ORAM for Secure Cloud Storage

This paper proposes a novel version of path oblivious random access memory called radix path ORAM (R-Path ORAM) with a large root (radix) bucket size but a small fixed size for all the other buckets in the tree. A detailed analysis of the root bucket occupancy is conducted to provide a closed-form solution of the required root bucket size that maintains a negligible failure probability. The performance of the R-Path ORAM is evaluated and compared against the traditional Path ORAM using a unified platform. The conducted experiments clearly show that R-Path ORAM provides much lower server storage and average response time than the seminal Path ORAM. Furthermore, we propose a background eviction technique to eventually reduce the root bucket size and avoid system failure. The conducted experiments on the unified platform showed the usefulness and efficiency of the proposed two-way eviction technique in successfully reducing the root bucket size while incurring a very small overhead.

[1]  Siu-Ming Yiu,et al.  HybridORAM: Practical oblivious cloud storage with constant bandwidth , 2018, Inf. Sci..

[2]  Abdelfettah Belghith,et al.  Practical Suitability and Experimental Assessment of Tree ORAMs , 2018, Secur. Commun. Networks.

[3]  Abdelfettah Belghith,et al.  Locality Aware Path ORAM: Implementation, Experimentation and Analytical Modeling , 2018, Comput..

[4]  Amr El Abbadi,et al.  Data Security and Privacy for Outsourced Data in the Cloud , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

[5]  R. Bost.  Algorithmes de recherche sur bases de données chiffrées , 2018 .

[6]  Marc Sánchez Artigas.  Enhancing Tree-Based ORAM Using Batched Request Reordering , 2018, IEEE Trans. Inf. Forensics Secur..

[7]  Feifei Li,et al.  Oblivious RAM: A Dissection and Experimental Evaluation , 2016, Proc. VLDB Endow..

[8]  Elaine Shi,et al.  Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM , 2016, TCC.

[9]  Christopher W. Fletcher.  Oblivious RAM: from theory to practice , 2016 .

[10]  Yiran Chen,et al.  Fork Path: Improving efficiency of ORAM by removing redundant memory accesses , 2015, 2015 48th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[11]  Srinivas Devadas,et al.  PrORAM: Dynamic prefetcher for Oblivious RAM , 2015, 2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA).

[12]  Pjp Paul Teeuwen.  Evolution of oblivious RAM schemes , 2015 .

[13]  Elaine Shi,et al.  Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound , 2015, IACR Cryptol. ePrint Arch..

[14]  Andreas Peter,et al.  A Survey of Provably Secure Searchable Encryption , 2014, ACM Comput. Surv..

[15]  Elaine Shi,et al.  Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM , 2014, IACR Cryptol. ePrint Arch..

[16]  Elaine Shi,et al.  PHANTOM: practical oblivious computation in a secure processor , 2013, CCS.

[17]  Srinivas Devadas,et al.  Design space exploration and optimization of path oblivious RAM in secure processors , 2013, ISCA.

[18]  Ling Ren,et al.  Path ORAM , 2012, J. ACM.

[19]  Christopher W. Fletcher.  Ascend : an architecture for performing secure computation on encrypted data , 2013 .

[20]  Srinivas Devadas,et al.  A secure processor architecture for encrypted computation on untrusted programs , 2012, STC '12.

[21]  Elaine Shi,et al.  Towards Practical Oblivious RAM , 2011, NDSS.

[22]  Murat Kantarcioglu,et al.  Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation , 2012, NDSS.

[23]  Elaine Shi,et al.  Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.

[24]  B. Eisenberg.  On the expectation of the maximum of IID geometric random variables , 2008 .

[25]  Rafail Ostrovsky,et al.  Software protection and simulation on oblivious RAMs , 1996, JACM.

[26]  Oded Goldreich,et al.  Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.