Verifiable oblivious storage

DOI10.1007/978-3-642-54631-0_8MaRDI QIDQ5402968zbMATH OpenOpenAlexFDO

Authors Daniel Apon, Elaine Shi, Aishwarya Thiruvengadam, Jonathan Katz

Publication date 25 March 2014

Published in Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54631-0_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Dynamic proofs of retrievability via oblivious RAM
• Dynamic proofs of retrievability via oblivious RAM
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Oblivious RAM Revisited
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost

Cited in

(16)

• 3-party distributed ORAM from oblivious set membership
• Is there an oblivious RAM lower bound for online reads?
• New unbounded verifiable data streaming for batch query with almost optimal overhead
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• SQL on structurally-encrypted databases
• Simple and efficient two-server ORAM
• Asymptotically tight bounds for composing ORAM with PIR
• Is there an oblivious RAM lower bound for online reads?
• \textsf{MacORAMa}: optimal oblivious RAM with integrity
• Locality-preserving oblivious RAM
• Maliciously secure multi-client ORAM
• Disappearing cryptography in the bounded storage model
• Dynamic proofs of retrievability via oblivious RAM
• Dynamic proofs of retrievability via oblivious RAM
• STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement

This page was built for publication: Verifiable oblivious storage

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