File(s) not publicly available

A matrix based ORAM: Design, implementation and experimental analysis

journal contribution
posted on 20.07.2018, 00:00 authored by Steven GordonSteven Gordon, A Miyaji, C Su, K Sumongkayothin
Oblivious RAM is a technique for hiding the access patterns between a client and an untrusted server. However, current ORAM algorithms incur large communication or storage overhead. We propose a novel ORAM construction using a matrix logical structure for server storage where a client downloads blocks from each row, choosing the column randomly to hide the access pattern. Both a normal construction and recursive construction, where a position map normally stored on the client is also stored on the server, are presented. We show our matrix ORAM achieves constant bandwidth cost for the normal construction, uses similar storage to the existing Path ORAM, and improves open the bandwidth cost compared to Path ORAM under certain conditions in the recursive construction.

Funding

Category 3 - Industry and Other Research Income

History

Volume

E99.D

Issue

8

Start Page

2044

End Page

2055

Number of Pages

12

eISSN

1745-1361

ISSN

0916-8532

Publisher

Institute of Electronics, Information and Communication Engineers

Additional Rights

Free Access provided to this article by The Institute of Electronics, Information and Communication Engineers

Peer Reviewed

Yes

Open Access

Yes

External Author Affiliations

Sirindhorn International Institute of Technology; Japan Advanced Institute of Science and Technology; Graduate School of Engineering, Osaka University

Era Eligible

Yes

Journal

IEICE Transactions on Information and Systems