TY - JOUR
T1 - Non-Repudiable Provable Data Possession Scheme with Designated Verifier in Cloud Storage Systems
AU - Wu, Tsu Yang
AU - Tseng, Yuh Min
AU - Huang, Sen Shan
AU - Lai, Yi Chen
N1 - Funding Information:
This work was supported by the Ministry of Science and Technology, Taiwan, under Grant MOST106-2221-E-018-007-MY2.
PY - 2017/9/15
Y1 - 2017/9/15
N2 - In cloud storage systems, users can upload their data along with associated tags (authentication information) to cloud storage servers. To ensure the availability and integrity of the outsourced data, provable data possession (PDP) schemes convince verifiers (users or third parties) that the outsourced data stored in the cloud storage server is correct and unchanged. Recently, several PDP schemes with designated verifier (DV-PDP) were proposed to provide the flexibility of arbitrary designated verifier. A designated verifier (private verifier) is trustable and designated by a user to check the integrity of the outsourced data. However, these DV-PDP schemes are either inefficient or insecure under some circumstances. In this paper, we propose the first non-repudiable PDP scheme with designated verifier (DV-NRPDP) to address the non-repudiation issue and resolve possible disputations between users and cloud storage servers. We define the system model, framework and adversary model of DV-NRPDP schemes. Afterward, a concrete DV-NRPDP scheme is presented. Based on the computing discrete logarithm assumption, we formally prove that the proposed DV-NRPDP scheme is secure against several forgery attacks in the random oracle model. Comparisons with the previously proposed schemes are given to demonstrate the advantages of our scheme.
AB - In cloud storage systems, users can upload their data along with associated tags (authentication information) to cloud storage servers. To ensure the availability and integrity of the outsourced data, provable data possession (PDP) schemes convince verifiers (users or third parties) that the outsourced data stored in the cloud storage server is correct and unchanged. Recently, several PDP schemes with designated verifier (DV-PDP) were proposed to provide the flexibility of arbitrary designated verifier. A designated verifier (private verifier) is trustable and designated by a user to check the integrity of the outsourced data. However, these DV-PDP schemes are either inefficient or insecure under some circumstances. In this paper, we propose the first non-repudiable PDP scheme with designated verifier (DV-NRPDP) to address the non-repudiation issue and resolve possible disputations between users and cloud storage servers. We define the system model, framework and adversary model of DV-NRPDP schemes. Afterward, a concrete DV-NRPDP scheme is presented. Based on the computing discrete logarithm assumption, we formally prove that the proposed DV-NRPDP scheme is secure against several forgery attacks in the random oracle model. Comparisons with the previously proposed schemes are given to demonstrate the advantages of our scheme.
UR - http://www.scopus.com/inward/record.url?scp=85030631147&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85030631147&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2017.2753243
DO - 10.1109/ACCESS.2017.2753243
M3 - Article
AN - SCOPUS:85030631147
VL - 5
SP - 19333
EP - 19341
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 8039158
ER -