Compact proofs of retrievability

DOI10.1007/s00145-012-9129-2zbMath1323.68258OpenAlexW2038704326MaRDI QIDQ2392096

Brent Waters, Hovav Shacham

Publication date: 1 August 2013

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

Full work available at URL: https://doi.org/10.1007/s00145-012-9129-2

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)

Related Items

Secure auditing and deduplication for encrypted cloud data supporting ownership modification ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness ⋮ Keyword-Based Delegable Proofs of Storage ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Generic constructions of PoRs from codes and instantiations ⋮ An alternative approach to public cloud data auditing supporting data dynamics ⋮ Integrity Verification for Multiple Data Copies in Cloud Storage Based on Spatiotemporal Chaos

Cites Work

• Unnamed Item
• Unnamed Item
• Tweakable block ciphers
• Short signatures from the Weil pairing
• A taxonomy of pairing-friendly elliptic curves
• An Enciphering Scheme Based on a Card Shuffle
• A Sample of Samplers: A Computational Perspective on Sampling
• A linear time erasure-resilient code with nearly optimal recovery
• The complexity of online memory checking
• Proofs of Retrievability via Hardness Amplification
• Proofs of Storage from Homomorphic Identification Protocols
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Compact proofs of retrievability