z-logo
Premium
New public auditing protocol based on homomorphic tags for secure cloud storage
Author(s) -
Zhang Jindan,
Wang Baocang,
Ogiela Marek R.,
Wang Xu An,
Sangaiah Arun Kumar
Publication year - 2020
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.5600
Subject(s) - computer science , homomorphic encryption , cloud computing , cloud storage , protocol (science) , computer security , retrievability , server , geodetic datum , merkle tree , outsourcing , hash function , universal composability , cryptographic protocol , cryptography , public key cryptography , computer network , encryption , cryptographic hash function , operating system , medicine , precision and recall , alternative medicine , cartography , pathology , political science , law , geography , machine learning
Summary Outsourcing datum to the cloud servers is more and more popular for most data owners and enterprises. However, how to ensure the outsourced datum to be kept secure is very important. Especially, how to check the outsourced datum's integrity is a very challenge problem. Until now, there are many cryptographic protocols proposed to solve this problem, such as (dynamic) provable data position protocol, (dynamic) proof of retrievability protocol, etc. Recently, Tian et al proposed a dynamic‐hash‐table‐based public auditing scheme for secure cloud storage, which aims at simultaneously supporting secure dynamic data updating and secure public auditing for cloud storage. However, we find a security flaw in this protocol; concretely, the signature algorithm for the data blocks in their protocol is not secure; the cloud servers can easily modify the outsourced data blocks without detecting. Finally, we give a new protocol by using homomorphic tags based on their protocol and roughly analysis its security.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here