Dynamic Proofs of Retrievability via Oblivious RAM

DOI10.1007/978-3-642-38348-9_17zbMath1306.94037OpenAlexW44164607MaRDI QIDQ4924416

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

Publication date: 31 May 2013

Published in: Advances in Cryptology – EUROCRYPT 2013 (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

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

Related Items (8)

DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability ⋮ Efficient Dynamic Provable Data Possession from Dynamic Binary Tree ⋮ Keyword-Based Delegable Proofs of Storage ⋮ Cryptanalysis of a public authentication protocol for outsourced databases with multi-user modification ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Improved secure fuzzy auditing protocol for cloud data storage

This page was built for publication: Dynamic Proofs of Retrievability via Oblivious RAM