Journal on Communications ›› 2016, Vol. 37 ›› Issue (10): 117-127.doi: 10.11959/j.issn.1000-436x.2016203

• Papers • Previous Articles     Next Articles

Provable data possession scheme with authentication

Hao-xing LI1,Feng-hua LI1,2,Cheng-gen SONG3,Ya-long YAN3   

  1. 1 State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
    2 State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China
    3 Information Security Institute,Beijing Electronic Science and Technology Institute,Beijing 100070,China
  • Online:2016-10-25 Published:2016-10-25
  • Supported by:
    The National Natural Science Foundation of China General Project;The National High Technol-ogy Research and Development Program of China (863 Program);The National Natural Science Foundation of China-Guangdong Provincial People’s Government of the Joint Natural Science Fund Projects

Abstract:

To satisfy the requirements of identity authentication and data possession proven in the cloud application scenarios,a provable data possession scheme with authentication was proposed.Based on data tag signature and randomness reusing,the proposed scheme could accomplish several issues with three interactions,including the possession proof of cloud data,the mutual authentication between user and cloud computing server,the session key agreement and confirmation.Compared to the simple combination of authentication key agreement and provable data possession schemes,the proposed scheme has less computation and interactions,and better provable securities.In the random oracle model,the security proof of the proposed scheme is given under the computational Diffie-Hellman assumption.

Key words: authentication, data possession, cloud computing, provable security, random oracle

No Suggested Reading articles found!