%0 Book Section %1 Damgard11 %A Damg\aard, Ivan %A Meldgaard, Sigurd %A Nielsen, Jesper Buus %B Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings %D 2011 %E Ishai, Yuval %I Springer %K crypto sorting.network %P 144--163 %R 10.1007/978-3-642-19571-6_10 %T Perfectly Secure Oblivious RAM without Random Oracles %X 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. %@ 978-3-642-19571-6

@inbook{Damgard11, 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.}, added-at = {2016-11-07T01:07:02.000+0100}, author = {Damg{\aa}rd, Ivan and Meldgaard, Sigurd and Nielsen, Jesper Buus}, biburl = {https://www.bibsonomy.org/bibtex/2bc6224f5367ff03719568337ad2ad0ac/ytyoun}, booktitle = {Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings}, doi = {10.1007/978-3-642-19571-6_10}, editor = {Ishai, Yuval}, interhash = {2bb71f46ea195e85a30d3fa5eaecbc22}, intrahash = {bc6224f5367ff03719568337ad2ad0ac}, isbn = {978-3-642-19571-6}, keywords = {crypto sorting.network}, pages = {144--163}, publisher = {Springer}, timestamp = {2016-11-08T08:58:16.000+0100}, title = {Perfectly Secure Oblivious {RAM} without Random Oracles}, year = 2011 }