Multi-user binary tree based ORAM scheme

DOI10.13328/J.CNKI.JOS.005002MaRDI QIDQ2951204zbMATH OpenFDO

Authors Xiaoni Sun, Han Jiang, Qiuliang Xu

Publication date 6 January 2017

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.005002

zbMATH Keywords

cloud computingbinary treemulti-useraccess patternoblivious random access memory

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Recommendations

• Optimizing ORAM and Using It Efficiently for Secure Computation
• Maliciously secure multi-client ORAM
• Succinct oblivious RAM
• M-ORAM Revisited: Security and Construction Updates
• Multi-client Oblivious RAM Secure Against Malicious Servers

Cited in

(1)

• Simple and efficient two-server ORAM

This page was built for publication: Multi-user binary tree based ORAM scheme

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