Compact Proofs of Retrievability
From MaRDI portal
Publication:3600367
Recommendations
- Entropy and the Law of Small Numbers
- Nonuniform bounds in the Poisson approximation with applications to informational distances. II
- Improved lower bounds on the total variation distance for the Poisson approximation
- Non-uniform bounds in the Poisson approximation with applications to informational distances. I
- Poisson approximation in \(\chi^2\) distance by the Stein-Chen approach
Cites work
Cited in
(67)- Homomorphic linear authentication schemes from -ASU₂ functions for proofs of retrievability
- An alternative approach to public cloud data auditing supporting data dynamics
- Tight proofs of space and replication
- stoRNA: stateless transparent proofs of storage-time
- Proofs of retrievability via fountain code
- Cryptanalysis of a public authentication protocol for outsourced databases with multi-user modification
- Still wrong use of pairings in cryptography
- \textsf{GoAT}: file \underline{g}e\underline{o}location via \underline{a}nchor \underline{t}imestamping
- Efficient attribute-based encryption with attribute revocation for assured data deletion
- Symmetric-key based proofs of retrievability supporting public verification
- Proofs of storage from homomorphic identification protocols
- Practical homomorphic message authenticators for arithmetic circuits
- Efficient dynamic provable data possession from dynamic binary tree
- Compact proofs of retrievability
- Multi-prover proof of retrievability
- Towards a theory of data entanglement
- Is extracting data the same as possessing data?
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Key management for outsourced data security
- On cloud security requirements, threats, vulnerabilities and countermeasures: a survey
- Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy
- Efficient Proofs of Secure Erasure
- Compact Proofs of Retrievability
- Proofs of Retrievability via Hardness Amplification
- Public audit for operation behavior logs with error locating in cloud storage
- Multi-instance publicly verifiable time-lock puzzle and its applications
- Lightweight delegatable proofs of storage
- Security of auditing protocols against subversion attacks
- Efficient dynamic provable data possession with public verifiability and data privacy
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud, revisited
- A new public remote integrity checking scheme with user privacy
- Private certificate-based remote data integrity checking in public clouds
- DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
- Cloud data auditing with designated verifier
- Privacy-enhanced remote data integrity checking with updatable timestamp
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- A secure and effective anonymous integrity checking protocol for data storage in multicloud
- Blockchain-based efficient public integrity auditing for cloud storage against malicious auditors
- Practical techniques building on encryption for protecting and managing data in the cloud
- Multi-theorem preprocessing NIZKs from lattices
- Proofs of storage: theory, constructions and applications
- Zero-knowledge proofs of retrievability
- Auditable Compressed Storage
- Efficient identity-based multi-copy data sharing auditing scheme with decentralized trust management
- SecDedup: secure data deduplication with dynamic auditing in the cloud
- Simple proofs of space-time and rational proofs of storage
- Publicly verifiable static proofs of storage: a novel scheme and efficiency comparisons
- Non-uniform bounds in the Poisson approximation with applications to informational distances. I
- FRIDA: data availability sampling from FRI
- Leakage-resilient identification schemes from zero-knowledge proofs of storage
- Efficient privacy preserving data audit in cloud
- Nonuniform bounds in the Poisson approximation with applications to informational distances. II
- Entropy and the Law of Small Numbers
- Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
- Generic constructions of PoRs from codes and instantiations
- A position-aware Merkle tree for dynamic cloud data integrity verification
- Efficient proofs of retrievability using expander codes
- Accountable storage
- \texttt{FlipIt}: the game of ``stealthy takeover
- Public cloud data auditing with practical key update and zero knowledge privacy
- Dynamic proofs of retrievability via oblivious RAM
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices
- Dynamic proofs of retrievability via oblivious RAM
- Improved secure fuzzy auditing protocol for cloud data storage
- Incompressible encodings
- New techniques in replica encodings with client setup
- Hash function design for cloud storage data auditing
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 Q3600367)
