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

Karin Sumongkayothin; Steven Gordon; Atsuko Miyaji; Chunhua Su; Komwut Wipusitwarakun

doi:10.1007/978-981-10-2741-3_11

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

Karin Sumongkayothin
, Steven Gordon
, Atsuko Miyaji
, Chunhua Su
, Komwut Wipusitwarakun

Japan Advanced Institute of Science and Technology
Sirindhorn International Institute of Technology, Thammasat University
Central Queensland University
Japan Sci. and Technol. Corp. (JST)
Osaka University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

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).

Original language	English
Title of host publication	Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings
Editors	Lynn Batten, Gang Li
Publisher	Springer Verlag
Pages	130-141
Number of pages	12
ISBN (Print)	9789811027406
DOIs	https://doi.org/10.1007/978-981-10-2741-3_11
Publication status	Published - 2016
Externally published	Yes
Event	6th International Conference on Applications and Techniques in Information Security, ATIS 2016 - Cairns, Australia Duration: 26 Oct 2016 → 28 Oct 2016

Publication series

Name	Communications in Computer and Information Science
Volume	651
ISSN (Print)	1865-0929

Conference

Conference	6th International Conference on Applications and Techniques in Information Security, ATIS 2016
Country/Territory	Australia
City	Cairns
Period	26/10/16 → 28/10/16

Access to Document

10.1007/978-981-10-2741-3_11

Cite this

Sumongkayothin, K., Gordon, S., Miyaji, A., Su, C., & Wipusitwarakun, K. (2016). Recursive M-ORAM: A matrix ORAM for clients with constrained storage space. In L. Batten, & G. Li (Eds.), Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings (pp. 130-141). (Communications in Computer and Information Science; Vol. 651). Springer Verlag. https://doi.org/10.1007/978-981-10-2741-3_11

Sumongkayothin, Karin ; Gordon, Steven ; Miyaji, Atsuko et al. / Recursive M-ORAM : A matrix ORAM for clients with constrained storage space. Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings. editor / Lynn Batten ; Gang Li. Springer Verlag, 2016. pp. 130-141 (Communications in Computer and Information Science).

@inproceedings{1f4d6b92889a47fdbf63286717f5c7ef,

title = "Recursive M-ORAM: A matrix ORAM for clients with constrained storage space",

abstract = "Although oblivious RAM (ORAM) can hide a client{\textquoteright}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).",

author = "Karin Sumongkayothin and Steven Gordon and Atsuko Miyaji and Chunhua Su and Komwut Wipusitwarakun",

note = "Publisher Copyright: {\textcopyright} Springer Nature Singapore Pte Ltd. 2016.; 6th International Conference on Applications and Techniques in Information Security, ATIS 2016 ; Conference date: 26-10-2016 Through 28-10-2016",

year = "2016",

doi = "10.1007/978-981-10-2741-3\_11",

language = "English",

isbn = "9789811027406",

series = "Communications in Computer and Information Science",

publisher = "Springer Verlag",

pages = "130--141",

editor = "Lynn Batten and Gang Li",

booktitle = "Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings",

}

Sumongkayothin, K, Gordon, S, Miyaji, A, Su, C & Wipusitwarakun, K 2016, Recursive M-ORAM: A matrix ORAM for clients with constrained storage space. in L Batten & G Li (eds), Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings. Communications in Computer and Information Science, vol. 651, Springer Verlag, pp. 130-141, 6th International Conference on Applications and Techniques in Information Security, ATIS 2016, Cairns, Australia, 26/10/16. https://doi.org/10.1007/978-981-10-2741-3_11

Recursive M-ORAM: A matrix ORAM for clients with constrained storage space. / Sumongkayothin, Karin; Gordon, Steven; Miyaji, Atsuko et al.
Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings. ed. / Lynn Batten; Gang Li. Springer Verlag, 2016. p. 130-141 (Communications in Computer and Information Science; Vol. 651).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Recursive M-ORAM

T2 - 6th International Conference on Applications and Techniques in Information Security, ATIS 2016

AU - Sumongkayothin, Karin

AU - Gordon, Steven

AU - Miyaji, Atsuko

AU - Su, Chunhua

AU - Wipusitwarakun, Komwut

PY - 2016

Y1 - 2016

N2 - 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).

AB - 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).

UR - https://www.scopus.com/pages/publications/84989855172

U2 - 10.1007/978-981-10-2741-3_11

DO - 10.1007/978-981-10-2741-3_11

M3 - Conference contribution

AN - SCOPUS:84989855172

SN - 9789811027406

T3 - Communications in Computer and Information Science

SP - 130

EP - 141

BT - Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings

A2 - Batten, Lynn

A2 - Li, Gang

PB - Springer Verlag

Y2 - 26 October 2016 through 28 October 2016

ER -

Sumongkayothin K, Gordon S, Miyaji A, Su C, Wipusitwarakun K. Recursive M-ORAM: A matrix ORAM for clients with constrained storage space. In Batten L, Li G, editors, Applications and Techniques in Information Security - 6th International Conference, ATIS 2016, Proceedings. Springer Verlag. 2016. p. 130-141. (Communications in Computer and Information Science). doi: 10.1007/978-981-10-2741-3_11

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this