Dynamic proofs of retrievability via oblivious RAM (Q514467): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: More Robust Hashing: Cuckoo Hashing with a Stash / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Storage from Homomorphic Identification Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking the correctness of memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuckoo hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Proofs of Retrievability via Oblivious RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Updatable and Locally Decodable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Retrievability via Hardness Amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Efficient Can Memory Checking Be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software protection and simulation on oblivious RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious RAM Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Proofs of Retrievability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious RAM with O((logN)3) Worst-Case Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path ORAM / rank
 
Normal rank

Revision as of 11:45, 13 July 2024

scientific article
Language Label Description Also known as
English
Dynamic proofs of retrievability via oblivious RAM
scientific article

    Statements

    Dynamic proofs of retrievability via oblivious RAM (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2017
    0 references
    cloud storage
    0 references
    oblivious RAM
    0 references
    outsourced data integrity
    0 references
    proof of retrievability
    0 references
    provable data possession
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references