TY - GEN
T1 - Statistically-secure ORAM with Õ(log2 n) overhead
AU - Chung, Kai Min
AU - Liu, Zhenming
AU - Pass, Rafael
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2014.
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84916220302&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-45608-8_4
DO - 10.1007/978-3-662-45608-8_4
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84916220302
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 62
EP - 81
BT - Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II
A2 - Sarkar, Palash
A2 - Iwata, Tetsu
PB - Springer Verlag
T2 - 20th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2014
Y2 - 7 December 2014 through 11 December 2014
ER -