Publication: M-ORAM revisited: Security and construction updates
Issued Date
2018-01-01
Resource Type
ISSN
16113349
03029743
03029743
Other identifier(s)
2-s2.0-85054387363
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.11125 LNCS, (2018), 521-532
Suggested Citation
Karin Sumongkayothin M-ORAM revisited: Security and construction updates. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.11125 LNCS, (2018), 521-532. doi:10.1007/978-3-319-99807-7_33 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/45664
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
M-ORAM revisited: Security and construction updates
Author(s)
Other Contributor(s)
Abstract
© Springer Nature Switzerland AG 2018. 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.