Perfectly Secure Oblivious RAM without Random Oracles

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Department of Computer Science
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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume6597
Pages (from-to)144-163
Number of pages20
ISSN0302-9743
DOIs
Publication statusPublished - 2011
Event8th Theory of Cryptography Conference. TCC 2011 - Providence, RI, United States
Duration: 28 Mar 201130 Mar 2011

Conference

Conference8th Theory of Cryptography Conference. TCC 2011
CountryUnited States
CityProvidence, RI
Period28/03/201130/03/2011

Bibliographical note

Title of the vol.: Theory of Cryptography. Proceedings. / Yuval Ishai (ed.)
ISBN: 978-3-642-19570-9

See relations at Aarhus University Citationformats

ID: 35559621