Dynamic proofs of retrievability via oblivious RAM

DOI10.1007/978-3-642-38348-9_17MaRDI QIDQ4924416zbMATH OpenOpenAlexFDO

Authors David Cash, Alptekin Küpçü, Daniel Wichs

Publication date 31 May 2013

Published in Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38348-9_17

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Dynamic proofs of retrievability via oblivious RAM
• Compact proofs of retrievability
• Proofs of Retrievability via Hardness Amplification
• Compact Proofs of Retrievability
• Verifiable oblivious storage

Cited in

(14)

• Cryptanalysis of a public authentication protocol for outsourced databases with multi-user modification
• Improved secure fuzzy auditing protocol for cloud data storage
• Efficient dynamic provable data possession from dynamic binary tree
• DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
• Symmetric-key based proofs of retrievability supporting public verification
• Dynamic proofs of retrievability via oblivious RAM
• Verifiable oblivious storage
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound for online reads?
• Keyword-Based Delegable Proofs of Storage
• Accountable storage
• Multi-client Oblivious RAM Secure Against Malicious Servers
• FRIDA: data availability sampling from FRI
• Foundations of data availability sampling

This page was built for publication: Dynamic proofs of retrievability via oblivious RAM

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