Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

We describe schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithmic amortized increase in access times, with a very high probability of success, while keeping the external storage to be of size O(n).

[1]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[2]  Michael T. Goodrich,et al.  Randomized Shellsort: a simple oblivious sorting algorithm , 2009, SODA '10.

[3]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[4]  Philippe Olivier Alexandre Navaux,et al.  MigBSP: A Novel Migration Model for Bulk-Synchronous Parallel Processes Rescheduling , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[5]  Michael Drmota,et al.  A precise analysis of Cuckoo hashing , 2012, TALG.

[6]  Leslie G. Valiant,et al.  A bridging model for multi-core computing , 2008, J. Comput. Syst. Sci..

[7]  C. McDiarmid.  Concentration , 1862, The Dental register.

[8]  Jon Feldman,et al.  On distributing symmetric streaming computations , 2008, SODA '08.

[9]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1994, J. Parallel Distributed Comput..

[10]  Peter Williams,et al.  Usable PIR , 2008, NDSS.

[11]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[12]  Miklós Ajtai,et al.  Oblivious RAMs without cryptogrpahic assumptions , 2010, STOC '10.

[13]  Michael Mitzenmacher,et al.  Some Open Questions Related to Cuckoo Hashing , 2009, ESA.

[14]  Sergei Vassilvitskii,et al.  A model of computation for MapReduce , 2010, SODA '10.

[15]  Martin Dietzfelbinger,et al.  Balanced allocation and dictionaries with tightly packed constant size bins , 2005, Theor. Comput. Sci..

[16]  Michael Mitzenmacher,et al.  More Robust Hashing: Cuckoo Hashing with a Stash , 2008, ESA.

[17]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[18]  Tom White,et al.  Hadoop: The Definitive Guide , 2009 .

[19]  Friedhelm Meyer auf der Heide,et al.  Simple, efficient shared memory simulations , 1993, SPAA '93.

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

[21]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[22]  Jeffrey Scott Vitter,et al.  External Sorting and Permuting , 2008, Encyclopedia of Algorithms.

[23]  Kun Zhou,et al.  BSGP: bulk-synchronous GPU programming , 2008, ACM Trans. Graph..

[24]  Thomas H. Cormen,et al.  Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters , 2006, Algorithmica.

[25]  Pat Morin,et al.  Cuckoo hashing: Further analysis , 2003, Inf. Process. Lett..

[26]  Moni Naor,et al.  De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results , 2009, ICALP.

[27]  Ivan Damgård,et al.  Perfectly Secure Oblivious RAM Without Random Oracles , 2011, IACR Cryptol. ePrint Arch..

[28]  Michael T. Goodrich,et al.  MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations , 2010, ArXiv.

[29]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[30]  Peter Williams,et al.  Building castles out of mud: practical access pattern privacy and correctness on untrusted storage , 2008, CCS.

[31]  Kenneth E. Batcher,et al.  A Multiway Merge Sorting Network , 1995, IEEE Trans. Parallel Distributed Syst..

[32]  Michael T. Goodrich,et al.  Privacy-preserving group data access via stateless oblivious RAM simulation , 2011, SODA.

[33]  Rasmus Pagh,et al.  Cuckoo Hashing , 2001, Encyclopedia of Algorithms.

[34]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[35]  Micah Adler,et al.  Parallel randomized load balancing , 1995, STOC '95.

[36]  S. Muthukrishnan,et al.  Monitoring algorithms for negative feedback systems , 2010, WWW '10.

[37]  Mark Braverman.  Poly-logarithmic Independence Fools AC0 Circuits , 2009, Computational Complexity Conference.

[38]  Moni Naor,et al.  History-Independent Cuckoo Hashing , 2008, ICALP.

[39]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[40]  Paul Beame,et al.  Making RAMs Oblivious Requires Superlogarithmic Overhead , 2010, Electron. Colloquium Comput. Complex..

[41]  Paul G. Spirakis,et al.  Space Efficient Hash Tables with Worst Case Constant Access Time , 2003, Theory of Computing Systems.

[42]  Benny Pinkas,et al.  Oblivious RAM Revisited , 2010, CRYPTO.

[43]  Rui Wang,et al.  Side-Channel Leaks in Web Applications: A Reality Today, a Challenge Tomorrow , 2010, 2010 IEEE Symposium on Security and Privacy.

[44]  John D. Owens,et al.  Real-time parallel hashing on the GPU , 2009, SIGGRAPH 2009.

[45]  Friedhelm Meyer auf der Heide,et al.  Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.