@inproceedings{af6b065c23f341b9a121c83b33837971,
title = "M-ORAM revisited: Security and construction updates",
abstract = "Oblivious Random Access Machine (ORAM) [4] was introduced in regard to secure the access patterns seen by a server when the data have been retrieved. Matrix based ORAM (M-ORAM) [5] is one of ORAM constructions. It has been introduced in the matrix data structure format and can achieve O(1) for both bandwidth overhead and computation complexity. With the impressive performance results; however, the given security proof is not well defined. We therefore revisit the paper to give a new proper proof method to construct the access sequence which is statically indistinguishable from random accesses. In addition according to our new security proof, M-ORAM has a security weakness in a specific circumstance. Hence, the improved M-ORAM construction which can solve the problem is also introduced.",
author = "Karin Sumongkayothin",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 14th International Conference on Information Security Practice and Experience, ISPEC 2018 ; Conference date: 25-09-2018 Through 27-09-2018",
year = "2018",
doi = "10.1007/978-3-319-99807-7\_33",
language = "English",
isbn = "9783319998060",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "521--532",
editor = "Hiroaki Kikuchi and Chunhua Su",
booktitle = "Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings",
}