Advances in Computer Science : an International Journal
Provable Data Possession Scheme based on Homomorphic Hash Function in Cloud Storage
Abstract
Cloud storage can satisfy the demand of accessing data at anytime, anyplace. In cloud storage, only when the users can verify that the cloud storage server possesses the data correctly, users shall feel relax to use cloud storage. Provable data possession(PDP) makes it easy for a third party to verify whether the data is integrity in the cloud storage server. We analyze the existing PDP schemes, find that these schemes have some drawbacks, such as computationally expensive, only performing a limited number provable data possession. This paper proposes a provable data possession scheme based on homomorphic hash function according to the problems exist in the existing algorithms. The advantage of homomorphic hash function is that it provides provable data possession and data integrity protection. The scheme is a good way to ensure the integrity of remote data and reduce redundant storage space and bandwidth consumption on the premise that users do not retrieve data. The main cost of the scheme is in the server side, it is suitable for mobile devices in the cloud storage environments. We prove that the scheme is feasible by analyzing the security and performance of the scheme.
Keywords
Full Text:
PDFReferences
Feng Dengguo, Zhang Min, Zhang Yan, et al. Study on cloud computing security. Journal of Software, 2011, 22(1): 71-83
Juels A，Kaliski B S，Por S. Proof of rerievability for large files. Proc of the 14th ACM Conf on Computer and Communications Security. New York: ACM， 2007: 584-597.
Ateniese G，Burns R，Curtmola R， et al． Provable data possession at untrusted stores. Proc of the 14th ACM Conf on Computer and Communications Security. New York: ACM， 2007: 598-609.
Johnson R, Molnar D, Song D, et al. Homomorphic signature schemes. Proc of CT-RSA． New York: Springer, 2002:244-262.
Da Xiao，Jiwu Shu，Kang Chen,et al． A practical data possession checking scheme for networked archival storage. Journal of Computer Research and Development, 2009, 46(10):1660-1668.
Deswarte Y, Quisquater J J, and Saidane A. Remote integrity checking. Proc of IICIS'03, Switzerland, Nov.13-14, 2003: 1-11.
Ateniese G, Dipr, Mangini L V, et al. Scalable and efficient provable data possession. Proc of the 4th International Confon Security and Privacy in Communication Netowrks (SecureComm 2008). New York: ACM, 2008:1-10.
Erway C，Kupcu A，Papamanthou C，et al. Dynamic provable data possession. Proc of the 16th ACM Conf on Computer and Communications Security (CCS 2009). New York: ACM,2009: 213-222.
Chen B，Curtmola R. Robust dynamic provable data possession. Distributed Computing Systems Workshops (ICDCSW), 32nd International Conference on． Macau: IEEE, 2012: 515-525.
Zhu Y, Wang H, Hu Z, et al. Cooperative provable data possession. Beijing: Peking University and Arizona University，2010.
Krohn M, Freedman M J，Mazieres D. On-the-fly verification of rateless erasure codes for efficient content distribution. Proc of IEEE Symposium on Security and Privacy． Lee Badger: IEEE, 2004: 226-240.
Bruce Schneier. Schneier on Security. http://www.schneier.com/blog/archives/2009/07/ homomorphic_enc.html.
Bellare M, Goldreich O, and Goldwasser S. Incremental cryptography: the case of hashing and signing. Advances in Cryptology-CRYPTO'94, Santa Barbara, CA, Aug. 1994: 216-233.
Zhao Kaiyong, Chu Xiaowen, Wang Mea. Speeding up homomorpic Hashing using GPUs. The 2009 (44th) IEEE Conference on Communication (ICC 2009), Dresden, Germany, June 14-18, 2009: 1-5.
Bowers K D, Juels A, and Oprea A. HAIL: a high-vailability and integrity layer for cloud storage. Proceedings of ACMCCS'09, Chicago, Illinois, USA, Nov. 9-13, 2009: 187-198.
Shacham H and Waters B. Compact proofs of retrievability. Proceedings of ASIACRYPT '08, Melbourne, Australia, Dec.7-11, 2008: 90-107.
