Compact proofs of retrievability
From MaRDI portal
Publication:2392096
DOI10.1007/S00145-012-9129-2zbMATH Open1323.68258OpenAlexW2038704326MaRDI QIDQ2392096FDOQ2392096
Authors: Hovav Shacham, Brent Waters 
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
Recommendations
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cites Work
- Short signatures from the Weil pairing
- A taxonomy of pairing-friendly elliptic curves
- Title not available (Why is that?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Pairing-Friendly Elliptic Curves of Prime Order
- Efficient dispersal of information for security, load balancing, and fault tolerance
- A sample of samplers: a computational perspective on sampling
- Title not available (Why is that?)
- Proofs of Retrievability via Hardness Amplification
- Tweakable block ciphers
- Proofs of storage from homomorphic identification protocols
- The complexity of online memory checking
- A linear time erasure-resilient code with nearly optimal recovery
- An enciphering scheme based on a card shuffle
Cited In (31)
- An alternative approach to public cloud data auditing supporting data dynamics
- Proofs of retrievability via fountain code
- Tight proofs of space and replication
- Structure-preserving compilers from new notions of obfuscations
- Symmetric-key based proofs of retrievability supporting public verification
- Proofs of storage from homomorphic identification protocols
- Memory checking for parallel RAMs
- Towards proofs of ownership beyond bounded leakage
- Multi-prover proof of retrievability
- Is extracting data the same as possessing data?
- Primary-secondary-resolver membership proof systems
- Proofs of Retrievability via Hardness Amplification
- Efficient Proofs of Secure Erasure
- Lightweight delegatable proofs of storage
- Proofs of replicated storage without timing assumptions
- Secure auditing and deduplication for encrypted cloud data supporting ownership modification
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
- Proofs of storage: theory, constructions and applications
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- Zero-knowledge proofs of retrievability
- Simple proofs of space-time and rational proofs of storage
- Integrity verification for multiple data copies in cloud storage based on spatiotemporal chaos
- Publicly verifiable static proofs of storage: a novel scheme and efficiency comparisons
- Accountable storage
- Generic constructions of PoRs from codes and instantiations
- Dynamic proofs of retrievability via oblivious RAM
- Dynamic proofs of retrievability via oblivious RAM
- Keyword-Based Delegable Proofs of Storage
- New techniques in replica encodings with client setup
- Homomorphic linear authentication schemes from \(\varepsilon\)-ASU\(_2\) functions for proofs of retrievability
This page was built for publication: Compact proofs of retrievability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392096)
