Efficient dynamic provable data possession from dynamic binary tree

DOI10.1007/978-3-319-47422-9_6MaRDI QIDQ2953852zbMATH OpenOpenAlexFDO

Authors Huaqun Wang, C. F. Li

Publication date 6 January 2017

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-47422-9_6

zbMATH Keywords

binary treecloud computingdynamic provable data possession

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient dynamic provable data possession with public verifiability and data privacy
• Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
• A provable data possession scheme with data hierarchy in cloud
• Provably Secure Identity Based Provable Data Possession
• A position-aware Merkle tree for dynamic cloud data integrity verification

Cites work

• Compact Proofs of Retrievability
• Dynamic proofs of retrievability via oblivious RAM
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)

Cited in

(7)

• A position-aware Merkle tree for dynamic cloud data integrity verification
• Privacy-enhanced remote data integrity checking with updatable timestamp
• LBT-based cloud data integrity verification scheme
• Efficient dynamic provable data possession with public verifiability and data privacy
• DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
• Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy
• A provable data possession scheme with data hierarchy in cloud

This page was built for publication: Efficient dynamic provable data possession from dynamic binary tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953852)