Dynamic proofs of retrievability via oblivious RAM

DOI10.1007/s00145-015-9216-2zbMath1372.68085OpenAlexW2220842785WikidataQ113906169 ScholiaQ113906169MaRDI QIDQ514467

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

Publication date: 2 March 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-015-9216-2

zbMATH Keywords

cloud storageoblivious RAMoutsourced data integrityproof of retrievabilityprovable data possession

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Internet topics (68M11)

Related Items (1)

A logarithmic lower bound for oblivious RAM (for all Parameters)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking the correctness of memories
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Oblivious RAM Revisited
• Compact Proofs of Retrievability
• Proofs of Retrievability via Hardness Amplification
• How Efficient Can Memory Checking Be?
• Proofs of Storage from Homomorphic Identification Protocols
• The Knowledge Complexity of Interactive Proof Systems
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Cuckoo hashing
• Dynamic Proofs of Retrievability via Oblivious RAM
• Probability Inequalities for Sums of Bounded Random Variables
• Locally Updatable and Locally Decodable Codes
• More Robust Hashing: Cuckoo Hashing with a Stash

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