Oblivious RAM Revisited

  • Benny Pinkas
  • Tzachy Reinman
Conference paper

DOI: 10.1007/978-3-642-14623-7_27

Volume 6223 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Pinkas B., Reinman T. (2010) Oblivious RAM Revisited. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely n data items, and access them while hiding the identities of the items which are being accessed. Oblivious RAM is often cited as a powerful tool, but is also commonly considered to be impractical due to its overhead, which is asymptotically efficient but is quite high.We redesign the oblivious RAM protocol using modern tools, namely Cuckoo hashing and a new oblivious sorting algorithm. The resulting protocol uses only O(n) external memory, and replaces each data request by only O(log2n) requests.

Keywords

Secure two-party computation oblivious RAM 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Benny Pinkas
    • 1
  • Tzachy Reinman
    • 2
  1. 1.Dept. of Computer ScienceUniversity of HaifaHaifaIsrael
  2. 2.School of Computer Science and EngineeringThe Hebrew University of JerusalemJerusalemIsrael