Research On Dynamic And Certificateless Provable Data Possession Scheme

With the development of technology and network,cloud computing has gradually been widely used by people.The development of cloud computing has also driven the development of cloud storage.As cloud storage can provide users with convenient services of on-demand use and on-demand rental,while also reducing users' local storage costs,so more and more users choose to outsource data to cloud service providers(CSP).However,cloud storage not only loses users' direct control over the data,but also exposes users to the risk of data being leaked,tampered with,and deleted by CSP.In addition,cloud storage security issues are becoming more and more serious.so it is of great significance to study the issue of user data integrity verification in cloud storage.The Provable Data Possession(PDP)scheme can help users verify the integrity of data in cloud storage.However,the existing PDP schemes have the following two problems.On the one hand,the PDP scheme mainly considers the problem from the perspective of the user to prevent the CSP from deceiving the user and ignores the problem of the user deceiving the CSP.Therefore,the PDP scheme should avoid this situation.On the other hand,in the PDP scheme that supports user data sharing,the revocation of users is an important function,and how to achieve efficient user revocation is a question that has always been worth studying.Therefore,this paper conducts related research from the above two aspects.The main research work and main contributions are as follows:1.Aiming at the situation where the user deceives the CSP,and the existing PDP schemes rarely pay attention to the occurrence of this problem,a dynamic PDP scheme with an undeniable function is proposed.A new dynamic storage structure is presented to better meet the undeniable and dynamic characteristics of the scheme.Based on the new dynamic structure,a corresponding dynamic operation algorithm is proposed to achieve the dynamic characteristics of the scheme.Finally,theoretical analysis and experimental results show that the scheme has less calculation,storage overhead,and higher security than other schemes.2.Aiming at the problem of how to improve user revocation efficiency,an efficient and revocable certificateless PDP(RE-CL-PDP)scheme was proposed.According to the CL-PDP scheme,a system model and definition of the RE-CL-PDP scheme were constructed;the third-party trust level was taken into consideration to increase the trust level of the third-party scheme;and the scheme entrusted the CSP with the cancellation function,thereby reducing The computational burden of KGC;the security model of the scheme is given,and it proves that the scheme can resist the adversary attack model in the CL-PDP scheme under the elliptic discrete logarithm.Finally,theoretical analysis and experimental results show that the scheme has less calculation,revocation overhead and higher credibility than other schemes.