M-ORAM Revisited: Security and Construction Updates

DOI10.1007/978-3-319-99807-7_33MaRDI QIDQ6108627zbMATH OpenOpenAlexFDO

Authors

Publication date 30 June 2023

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99807-7_33

Mathematics Subject Classification ID

Computer security (68M25) Information storage and retrieval of data (68P20)

Recommendations

• Optimizing ORAM and Using It Efficiently for Secure Computation
• Stronger lower bounds for online ORAM
• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Maliciously secure multi-client ORAM
• Yes, there is an oblivious RAM lower bound!

Cites work

• Oblivious RAM Revisited
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Software protection and simulation on oblivious RAMs

Cited in

(1)

• Multi-user binary tree based ORAM scheme

This page was built for publication: M-ORAM Revisited: Security and Construction Updates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108627)