Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-AM-1-2
Session:
Number:We-AM-1-2.1
On Hiding Access Timings in ORAM
Yuma Kanai, Kazuki Yoneyama,
pp.548-551
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-AM-1-2.1
PDF download
Summary:
Oblivious RAM (ORAM) is a cryptographic primitive for hiding access patterns in cloud environments. Though the ordinary security definition of ORAM guarantees indistinguishability between access sequences of the same length, it cannot be guaranteed for access sequences of different lengths. Hence, ORAM cannot hide access timings or frequency. In this paper, we propose an ORAM scheme that can hide access timings. First, we extend the ordinary security definition. We formulate the hiding property of access timings by defining indistinguishability between access sequences of different lengths. Furthermore, we introduce a new ORAM scheme by adapting the dummy access technique. We prove that our scheme is secure in the proposed definition.