You are looking at a specific version 20100302:063920 of this paper.
See the latest version.
Paper 2010/108
Perfectly Secure Oblivious RAM Without Random Oracles
Ivan Damg\aa{}rd and Sigurd Meldgaard and Jesper Buus Nielsen
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 lover bound on the amount of randomness needed for information theoretically secure oblivious RAM.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- protocolsoblivious RAM
- Contact author(s)
-
ivan @ cs au dk
stm @ cs au dk
jbn @ cs au dk - History
- 2010-03-02: revised
- 2010-03-01: received
- See all versions
- Short URL
- https://ia.cr/2010/108
- License
-
CC BY