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.
Originalsprog | Engelsk |
---|---|
Bogserie | Lecture Notes in Computer Science |
Vol/bind | 6597 |
Sider (fra-til) | 144-163 |
Antal sider | 20 |
ISSN | 0302-9743 |
DOI | |
Status | Udgivet - 2011 |
Begivenhed | 8th Theory of Cryptography Conference. TCC 2011 - Providence, RI, USA Varighed: 28 mar. 2011 → 30 mar. 2011 |
Konference
Konference | 8th Theory of Cryptography Conference. TCC 2011 |
---|---|
Land/Område | USA |
By | Providence, RI |
Periode | 28/03/2011 → 30/03/2011 |