2019
DOI: 10.1016/j.future.2019.01.009
|View full text |Cite
|
Sign up to set email alerts
|

Outsourced dynamic provable data possession with batch update for secure cloud storage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(43 citation statements)
references
References 13 publications
0
42
1
Order By: Relevance
“…As shown in Fig.4, with the increasing of the number of users who keep the identical file, the storage overhead of cloud in the scheme [10] linearly increases, however that in our scheme keeps unchanged. As a result, our scheme is more efficient compared with the scheme [10].…”
Section: ) Storage Overheadmentioning
confidence: 81%
See 2 more Smart Citations
“…As shown in Fig.4, with the increasing of the number of users who keep the identical file, the storage overhead of cloud in the scheme [10] linearly increases, however that in our scheme keeps unchanged. As a result, our scheme is more efficient compared with the scheme [10].…”
Section: ) Storage Overheadmentioning
confidence: 81%
“…To reduce user's computation overhead, Ding et al [5] constructed a lightweight cloud storage auditing scheme with data privacy protection, which employs edge server to compute data authenticators and verify data integrity. Guo et al [10] designed a cloud storage auditing scheme, which is able to execute and verify multiple update operations at once. Shen et al [25] proposed a data integrity auditing scheme without private key storage.…”
Section: ) Cloud Storage Auditingmentioning
confidence: 99%
See 1 more Smart Citation
“…In our approach, the server stores only one copy of the encrypted uploaded files even when it is uploaded from different users. We compare our approach with [68] current approach as a standard, because it is a cloud storage and the storage does not support de-duplication. As shown in Figure 7, the number of users who keep similar files is increasing, so our scheme is more efficient in terms of performance and storage.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…These techniques need some additional information to store which may increase storage and computation cost. Guo et al [21] proposed Multi-leafauthenticated (MLA) scheme for dynamic data using Rank based Merkle Tree (RBMT). This scheme authenticates multiple leaf nodes at once without storing height and status value.…”
Section: Introductionmentioning
confidence: 99%