Compact proofs of retrievability
From MaRDI portal
Publication:2392096
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 2001186 (Why is no real title available?)
- A linear time erasure-resilient code with nearly optimal recovery
- A sample of samplers: a computational perspective on sampling
- A taxonomy of pairing-friendly elliptic curves
- An enciphering scheme based on a card shuffle
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Pairing-Friendly Elliptic Curves of Prime Order
- Proofs of Retrievability via Hardness Amplification
- Proofs of storage from homomorphic identification protocols
- Short signatures from the Weil pairing
- The complexity of online memory checking
- Tweakable block ciphers
Cited in
(31)- Structure-preserving compilers from new notions of obfuscations
- Towards proofs of ownership beyond bounded leakage
- Efficient Proofs of Secure Erasure
- Proofs of Retrievability via Hardness Amplification
- Lightweight delegatable proofs of storage
- Keyword-Based Delegable Proofs of Storage
- New techniques in replica encodings with client setup
- Accountable storage
- An alternative approach to public cloud data auditing supporting data dynamics
- Simple proofs of space-time and rational proofs of storage
- Memory checking for parallel RAMs
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- Is extracting data the same as possessing data?
- Proofs of storage from homomorphic identification protocols
- Proofs of storage: theory, constructions and applications
- Secure auditing and deduplication for encrypted cloud data supporting ownership modification
- Zero-knowledge proofs of retrievability
- Homomorphic linear authentication schemes from \(\varepsilon\)-ASU\(_2\) functions for proofs of retrievability
- Proofs of retrievability via fountain code
- 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
- Dynamic proofs of retrievability via oblivious RAM
- Tight proofs of space and replication
- Generic constructions of PoRs from codes and instantiations
- Dynamic proofs of retrievability via oblivious RAM
- Primary-secondary-resolver membership proof systems
- Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
- Symmetric-key based proofs of retrievability supporting public verification
- Proofs of replicated storage without timing assumptions
- Multi-prover proof of retrievability
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
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)
