DivORAM: Towards a practical oblivious RAM with variable block size

Liu, Zheli, Huang, Yanyu, Li, Jin, Cheng, Xiaochun ORCID: https://orcid.org/0000-0003-0371-9646 and Shen, Chao (2018) DivORAM: Towards a practical oblivious RAM with variable block size. Information Sciences, 447 . pp. 1-11. ISSN 0020-0255 [Article] (doi:10.1016/j.ins.2018.02.071)

Preview

PDF - Final accepted version (with author's formatting) Available under License Creative Commons Attribution-NonCommercial-NoDerivatives 4.0. Download (939kB) | Preview

Abstract

Oblivious RAM (ORAM) is important for applications that require hiding access patterns. Many ORAM schemes have been proposed but most of them support only storing blocks of the same size. For the variable length data blocks, they usually fill them upto the same length before uploading, which leads to an increase in storage space and network bandwidth usage. To develop the first practical ORAM with variable block size, we proposed the “DivORAM” by remodeling the tree-based ORAM structure. It employs an additively homomorphic encryption scheme (Damgård–Jurik cryptosystem) executing at the server side to save the client computing overhead and the network bandwidth cost. As a result, it saves network bandwidth 30% comparing with Ring ORAM and 40% comparing with HIRB ORAM. Experiment results show that the response time of DivORAM is 10 ×  improved over Ring ORAM for practical parameters.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

277Downloads

6 month trend

478Hits

Additional statistics are available via IRStats2.