Efficient Dynamic Provable Data Possession from Dynamic Binary Tree

DOI10.1007/978-3-319-47422-9_6zbMath1381.94100OpenAlexW2531587333MaRDI QIDQ2953852

Huaqun Wang, Chang-Feng 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)

Cites Work

• Compact Proofs of Retrievability
• Dynamic Proofs of Retrievability via Oblivious RAM
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Dynamic Provable Data Possession from Dynamic Binary Tree