Dynamic proofs of retrievability via oblivious RAM
type: Item
instance of: scholarly article
title: Dynamic proofs of retrievability via oblivious RAM
zbMATH Open document ID: 1372.68085
author: David Cash
author: Alptekin Küpçü
author: Daniel Wichs
published in: Journal of Cryptology
publication date: 2017-03-02T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 6690815
zbMATH Keywords: cloud storage
zbMATH Keywords: oblivious RAM
zbMATH Keywords: outsourced data integrity
zbMATH Keywords: proof of retrievability
zbMATH Keywords: provable data possession
Wikidata QID: Q113906169
MaRDI profile type: Publication
full work available at URL: s00145-015-9216-2
OpenAlex ID: W2220842785
cites work: More Robust Hashing: Cuckoo Hashing with a Stash
cites work: Proofs of Storage from Homomorphic Identification Protocols
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Q4318711
cites work: Checking the correctness of memories
cites work: Cuckoo hashing
cites work: Dynamic Proofs of Retrievability via Oblivious RAM
cites work: Locally Updatable and Locally Decodable Codes
cites work: Proofs of Retrievability via Hardness Amplification
cites work: How Efficient Can Memory Checking Be?
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Software protection and simulation on oblivious RAMs
cites work: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
cites work: Q5743386
cites work: Q4526994
cites work: Oblivious RAM Revisited
cites work: Compact Proofs of Retrievability
cites work: Oblivious RAM with O((logN)3) Worst-Case Cost
cites work: Path ORAM
DOI: 10.1007/S00145-015-9216-2
description: scientific article; zbMATH DE number 6690815