DivORAM: Towards a practical oblivious RAM with variable block size

作者：Liu, Zheli; Huang, Yanyu; Li, Jin^*; Cheng, Xiaochun; Shen, Chao

来源：Information Sciences, 2018, 447: 1-11.

DOI：10.1016/j.ins.2018.02.071

• Oblivious RAM
• Data privacy
• Cloud computing
• Access pattern

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 (Damgard-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 x improved over Ring ORAM for practical parameters.

• 出版日期2018-6
• 单位广州大学; 南开大学; 西安交通大学