Compact Proofs of Retrievability
From MaRDI portal
Publication:3600367
DOI10.1007/978-3-540-89255-7_7zbMath1206.68110OpenAlexW89553247MaRDI QIDQ3600367
Publication date: 10 February 2009
Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_7
Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Related Items (39)
Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy ⋮ Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy ⋮ Multi-instance publicly verifiable time-lock puzzle and its applications ⋮ Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ A New Public Remote Integrity Checking Scheme with User Privacy ⋮ Efficient Dynamic Provable Data Possession with Public Verifiability and Data 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 ⋮ Zero-knowledge proofs of retrievability ⋮ Privacy-preserving certificateless provable data possession scheme for big data storage on cloud, revisited ⋮ A secure and effective anonymous integrity checking protocol for data storage in multicloud ⋮ Privacy-enhanced remote data integrity checking with updatable timestamp ⋮ \texttt{FlipIt}: the game of ``stealthy takeover ⋮ Efficient Dynamic Provable Data Possession from Dynamic Binary Tree ⋮ Cloud data auditing with designated verifier ⋮ Efficient proofs of retrievability using expander codes ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ A position-aware Merkle tree for dynamic cloud data integrity verification ⋮ Cryptanalysis of a public authentication protocol for outsourced databases with multi-user modification ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Multi-prover proof of retrievability ⋮ Efficient attribute-based encryption with attribute revocation for assured data deletion ⋮ Compact Proofs of Retrievability ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud ⋮ Efficient Privacy Preserving Data Audit in Cloud ⋮ Public Cloud Data Auditing with Practical Key Update and Zero Knowledge Privacy ⋮ Blockchain-based efficient public integrity auditing for cloud storage against malicious auditors ⋮ Improved secure fuzzy auditing protocol for cloud data storage ⋮ Public audit for operation behavior logs with error locating in cloud storage ⋮ An alternative approach to public cloud data auditing supporting data dynamics ⋮ Hash function design for cloud storage data auditing ⋮ Still wrong use of pairings in cryptography ⋮ Incompressible encodings ⋮ Security of Auditing Protocols Against Subversion Attacks ⋮ Key management for outsourced data security
Cites Work
This page was built for publication: Compact Proofs of Retrievability
