File(s) not publicly available

Recursive M-ORAM: A matrix ORAM for clients with constrained storage space

journal contribution
posted on 13.11.2018, 00:00 by K Sumongkayothin, Steven GordonSteven Gordon, A Miyaji, C Su, K Wipusitwarakun
Although oblivious RAM (ORAM) can hide a client’s access pattern from an untrusted server, bandwidth and local storage requirements can be excessive. Path ORAM, Matrix ORAM and other schemes can greatly bandwidth cost, but on devices with constrained storage space they require too much local storage. We design a recursive version of Matrix ORAM, where data addresses are stored on the server instead of client, and are recursively accessed with revealing important information. We analyse our algorithm and show it keeps bandwidth, client storage and computational overhead each to O(log N).

Funding

Category 3 - Industry and Other Research Income

History

Editor

Batten L LG

Volume

651

Start Page

130

End Page

141

eISSN

0378-9845

ISSN

1865-0929

Publisher

Springer Verlag

Peer Reviewed

Yes

Open Access

No

Era Eligible

No

Journal

Communications in Computer and Information Science

Usage metrics

Exports