Perfectly Secure Oblivious RAM without Random Oracles

  • Ivan Damgård
  • Sigurd Meldgaard
  • Jesper Buus Nielsen
Conference paper

DOI: 10.1007/978-3-642-19571-6_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6597)
Cite this paper as:
Damgård I., Meldgaard S., Nielsen J.B. (2011) Perfectly Secure Oblivious RAM without Random Oracles. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg

Abstract

We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lower bound on the amount of randomness needed for implementing an information theoretically secure oblivious RAM.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Sigurd Meldgaard
    • 1
  • Jesper Buus Nielsen
    • 1
  1. 1.Department of Computer ScienceAarhus UniversityDenmark

Personalised recommendations