Perfectly Secure Oblivious RAM without Random Oracles
- 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
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.