Abstract
Cloud computing has been envisioned as the next-generation architecture of IT enterprise. However the security problem of Cloud computing hinder itself from large-scale application. One major challenge is to verify the integrity of data at untrusted server under the condition of supporting public auditability and dynamic data operation. This paper analyzed the problems of existing schemes, introduced commutative hash into Merkle hash tree, aggregated basic block into subblock and block, constructed a kind of hierarchical Merkle hash tree by using the concept of hierarchical structure in granular computing and proposed an improved scheme to offer effective, multi-granular dynamic operation. We analyzed the efficiency and security of the protocol. The analysis result showed that the protocol is efficient and security.
This work is supported by Natural Science Foundation Project of CQ CSTC of P. R. China (No.cstc2011jjA40031), Science & Technology Research Program of the Municipal Education Committee of Chongqing of P.R.China (No.KJ110505), and Open Program of Key Lab of Computer Network & Communication of Chongqing of P.R.China (No. JK-Y-2010003).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Qian, W., Cong, W., Kui, R., Wenjing, L., Jin, L.: Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing. IEEE Transactions on Parallel and Distributed Systems 22(5), 847–859 (2011)
Long, C., Guoyin, W.: An Efficient Integrity Check Method for Fine-Grained Data over Galois Field. Chinese Journal of Computers 34(5), 847–855 (2011)
Long, C., Guoyin, W.: An integrity check method for fine-grained data. Journal of Software 20(4), 902–909 (2009)
Guoyin, W., Qinghua, Z., Jun, H.: An overview of granular computing. CAAI Transactions on Intelligence Systems 6(2), 8–25 (2007)
Tsauyoung, L.: Granular computing: practices, theories, and future directions. In: Encyclopedia of Complexity and Systems Science, pp. 4339–4355 (2009)
Yiyu, Y.: Granular Computing: Past, Present and Future. In: 2008 IEEE International Conference on Granular Computing, vol. 8, pp. 80–85 (2008)
Cong, W., Qian, W., Kui, R., Wenjing, L.: Privacy-preserving public auditing for data storage security in cloud computing. In: InfoCom2010. IEEE (2010)
Goodrich, M., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and communitative hashing. In: Proceedings of DARPA DISCEX II (June 2001)
Benaloh, J., de Mare, M.: One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274–285. Springer, Heidelberg (1994)
Zhuo, H., Sheng, Z., Nenghai, Y.: Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability. IEEE  23(9), 1432–1437 (2011)
Giuseppe, A., Randal, B., Reza, C.: Provable data possession at untrusted stores. In: De Capitani di Vimercati, S., Syverson, P. (eds.) Proceedings of CCS 2007, vol. 10, pp. 598–609. ACM Press (2007)
Sravan, K.R., Ashutosh, S.: Data Integrity Proofs in Cloud Storage. In: Third InternationalConference on Communication Systems and Networks (COMSNETS), vol. 1, pp. 1–4 (2011)
Chris Erway, C., Alptekin, K., Charalampos, P., Roberto, T.: Dynamic Provable Data Possession. In: Proc. of CCS 2009, pp. 213–222. ACM, Chicago (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Liu, B., Song, W. (2012). An Efficient Data Integrity Verification Method Supporting Multi-granular Operation with Commutative Hash. In: Yao, J., et al. Rough Sets and Current Trends in Computing. RSCTC 2012. Lecture Notes in Computer Science(), vol 7413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32115-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-32115-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32114-6
Online ISBN: 978-3-642-32115-3
eBook Packages: Computer ScienceComputer Science (R0)