| Summary: | 碩士 === 國立彰化師範大學 === 數學系 === 105 === In cloud storage systems, users can upload their data along with associated tag (authentication information) to cloud storage servers. To ensure the availability and integrity of the outsourced data, a provable data possession (PDP) scheme convince verifiers (users or third party) that users’ data stored in the cloud storage server is correct and unchanged. Recently, several PDP schemes with designated verifier (DV-PDP) have been proposed to concern with this issue. 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 article, we propose the first non-repudiable PDP scheme with designated verifier (DV-NRPDP) to address the non-repudiation issue and resolve the possible disputation between users and the cloud storage server. We first define the new system model, framework and adversary model of DV-NRPDP schemes. Afterwards, a concrete DV-NRPDP scheme is presented. Based on the computing discrete logarithm (DL) 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.
|
|---|
