Statistically-secure ORAM with Õ(log2 n) overhead

Kai Min Chung*, Zhenming Liu, Rafael Pass

*Corresponding author for this work

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

Abstract

We demonstrate a simple, statistically secure, ORAM with computational overhead Õ(log2 n); previous ORAM protocols achieve only computational security (under computational assumptions) or require Ω(log3 n) overheard. An additional benefit of our ORAM is its conceptual simplicity, which makes it easy to implement in both software and (commercially available) hardware.

Our construction is based on recent ORAM constructions due to Shi, Chan, Stefanov, and Li (Asiacrypt 2011) and Stefanov and Shi (ArXiv 2012), but with some crucial modifications in the algorithm that simplifies the ORAM and enable our analysis. A central component in our analysis is reducing the analysis of our algorithm to a “supermarket” problem; of independent interest (and of importance to our analysis,) we provide an upper bound on the rate of “upset” customers in the “supermarket” problem.

Original languageEnglish
Title of host publicationAdvances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II
EditorsPalash Sarkar, Tetsu Iwata
PublisherSpringer Verlag
Pages62-81
Number of pages20
ISBN (Electronic)9783662456071
DOIs
StatePublished - 2014
Externally publishedYes
Event20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014 - Kaoshiung, Taiwan, Province of China
Duration: 7 Dec 201411 Dec 2014

Publication series

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

Conference

Conference20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014
Country/TerritoryTaiwan, Province of China
CityKaoshiung
Period7/12/1411/12/14

Fingerprint

Dive into the research topics of 'Statistically-secure ORAM with Õ(log2 n) overhead'. Together they form a unique fingerprint.

Cite this