Skip to main content
Conference ProceedingsOPEN ACCESS

Perfectly secure oblivious RAM without random oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6597 LNCS 144-163
DOI: 10.1007/978-3-642-19571-6_10
102Citations
Citations of this article
63Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2011 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Damgård, I., Meldgaard, S., & Nielsen, J. B. (2011). Perfectly secure oblivious RAM without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6597 LNCS, pp. 144–163). Springer Verlag. https://doi.org/10.1007/978-3-642-19571-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free