Oblivious RAM revisited

Benny Pinkas, Tzachy Reinman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

168 Scopus citations

Abstract

We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely n data items, and access them while hiding the identities of the items which are being accessed. Oblivious RAM is often cited as a powerful tool, but is also commonly considered to be impractical due to its overhead, which is asymptotically efficient but is quite high.We redesign the oblivious RAM protocol using modern tools, namely Cuckoo hashing and a new oblivious sorting algorithm. The resulting protocol uses only O(n) external memory, and replaces each data request by only O(log 2 n) requests.

Original languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings
Pages502-519
Number of pages18
DOIs
StatePublished - 2010
Externally publishedYes
Event30th Annual International Cryptology Conference, CRYPTO 2010 - Santa Barbara, CA, United States
Duration: 15 Aug 201019 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference30th Annual International Cryptology Conference, CRYPTO 2010
Country/TerritoryUnited States
CitySanta Barbara, CA
Period15/08/1019/08/10

Keywords

  • Secure two-party computation
  • oblivious RAM

Fingerprint

Dive into the research topics of 'Oblivious RAM revisited'. Together they form a unique fingerprint.

Cite this