OC-ORAM: Constant Bandwidth ORAM with Smaller Block Size using Oblivious Clear Algorithm

Oblivious RAM has been studied extensively. A recent direction is to allow the server to perform computations instead of being a storage device only. This model substantially reduces the communication between the server and the client, making constant bandwidth communication (the number of blocks transmitted) feasible. It is obvious that the larger the block size, the easier it is to construct a constant bandwidth ORAM scheme. Also, a lower bound of sub-logarithmic bandwidth was given if we do not use expensive homomorphic multiplications. The question of “whether constant bandwidth with smaller block size without homomorphic multiplications is achievable” remains open. In this paper, we show that the block can be further reduced to O(log3N) using only additive homomorphic operations. Technically, we design a non-trivial oblivious clear algorithm with very small bandwidth to improve the eviction algorithm in ORAM for which the lower bound proof does not apply. As an additional benefit, we are able to reduce the server storage due to the reduction in bucket size.

[1]  Dan Boneh,et al.  Remote Oblivious Storage: Making Oblivious RAM Practical , 2011 .

[2]  Peter Williams,et al.  Single round access privacy on outsourced storage , 2012, CCS '12.

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

[4]  Michael T. Goodrich,et al.  Practical oblivious storage , 2012, CODASPY '12.

[5]  Attila A. Yavuz,et al.  S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing , 2017, IACR Cryptol. ePrint Arch..

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

[7]  Dario Fiore,et al.  Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data , 2015, CCS.

[8]  Rafail Ostrovsky,et al.  Distributed Oblivious RAM for Secure Two-Party Computation , 2013, TCC.

[9]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[10]  Gerardo Pelosi,et al.  A Dynamic Tree-Based Data Structure for Access Privacy in the Cloud , 2016, 2016 IEEE International Conference on Cloud Computing Technology and Science (CloudCom).

[11]  Gerardo Pelosi,et al.  Efficient and Private Access to Outsourced Data , 2011, 2011 31st International Conference on Distributed Computing Systems.

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

[13]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[15]  Tarik Moataz,et al.  CHf-ORAM : A Constant Communication ORAM without Homomorphic Encryption , 2016 .

[16]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[17]  Michael T. Goodrich,et al.  Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.

[18]  Travis Mayberry,et al.  Efficient Private File Retrieval by Combining ORAM and PIR , 2014, NDSS.

[19]  Kartik Nayak,et al.  Asymptotically Tight Bounds for Composing ORAM with PIR , 2017, Public Key Cryptography.

[20]  Kai-Min Chung,et al.  Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead , 2013, ArXiv.

[21]  Craig Gentry,et al.  Optimizing ORAM and Using It Efficiently for Secure Computation , 2013, Privacy Enhancing Technologies.

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

[23]  Tarik Moataz,et al.  Constant Communication ORAM with Small Blocksize , 2015, CCS.

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

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

[26]  Michael T. Goodrich,et al.  Oblivious RAM simulation with efficient worst-case access overhead , 2011, CCSW '11.

[27]  Craig Gentry,et al.  Single-Database Private Information Retrieval with Constant Communication Rate , 2005, ICALP.