Efficient dynamic provable data possession from dynamic binary tree (Q2953852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6671073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient dynamic provable data possession from dynamic binary tree |
scientific article; zbMATH DE number 6671073 |
Statements
Efficient Dynamic Provable Data Possession from Dynamic Binary Tree (English)
0 references
6 January 2017
0 references
cloud computing
0 references
dynamic provable data possession
0 references
binary tree
0 references
0.8691110610961914
0 references
0.8507892489433289
0 references
0.8334251642227173
0 references
0.8236672282218933
0 references
0.8193367123603821
0 references
