Efficient Method Based on Blockchain Ensuring Data Integrity Auditing with Deduplication in Cloud.

Mohamed El Ghazouani; My Ahmed El Kiram; Latifa Er-Rajy; Yassine El Khanboubi

doi:10.9781/ijimai.2020.08.001

Authors

Mohamed El Ghazouani Cadi Ayyad University
My Ahmed El Kiram Cadi Ayyad University
Latifa Er-Rajy Cadi Ayyad University
Yassine El Khanboubi University of Hassan II Casablanca

DOI:

https://doi.org/10.9781/ijimai.2020.08.001

Keywords:

Auditing, Blockchain, Cloud Computing, Deduplication, Integrity

Abstract

With the rapid development of cloud storage, more and more cloud clients can store and access their data anytime, from anywhere and using any device. Data deduplication may be considered an excellent choice to ensure data storage efficiency. Although cloud technology offers many advantages for storage service, it also introduces security challenges, especially with regards to data integrity, which is one of the most critical elements in any system. A data owner should thus enable data integrity auditing mechanisms. Much research has recently been undertaken to deal with these issues. In this paper, we propose a novel blockchain-based method, which can preserve cloud data integrity checking with data deduplication. In our method, a mediator performs data deduplication on the client side, which permits a reduction in the amount of outsourced data and a decrease in the computation time and the bandwidth used between the enterprise and the cloud service provider. This method supports private and public auditability. Our method also ensures the confidentiality of a client's data against auditors during the auditing process.

Downloads

Download data is not yet available.

References

[1] P. Mell and T. Grance, “The NIST Definition of Cloud Computing Recommendations of the National Institute of Standards and Technology,” Nist Spec. Publ., vol. 145, p. 7, 2011. https://doi.org/10.1136/emj.2010.096966.

[2] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson et al., “Provable data possession at untrusted stores,” Proc. 14th ACM Conf. Comput. Commun. Secur. - CCS ’07, p. 598, 2007. https://doi.org/10.1145/1315245.1315318.

[3] G. Ateniese, R. Burns, R. Curtmola, J. Herring, O. Khan, L. Kissner et al., “Remote data checking using provable data possession,” ACM Trans. Inf. Syst. Secur., vol. 14, no. 1, pp. 1–34, 2011. https://doi.org/10.1145/1952982.1952994.

[4] A. Juels and B. S. Kaliski Jr., “Pors: Proofs of retrievability for large files,” Proc. ACM Conf. Comput. Commun. Secur., pp. 584–597, 2007. https://doi.org/10.1145/1315245.1315317.

[5] C. C. Erway, A. Küpçü, C. Papamanthou, and R. Tamassia, “Dynamic Provable Data Possession,” ACM Trans. Inf. Syst. Secur., vol. 17, no. 4, pp. 1–29, 2015. https://doi.org/10.1145/2699909.

[6] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, “Enabling public auditability and data dynamics for storage security in cloud computing,” IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 847–859, 2011. https://doi.org/10.1109/TPDS.2010.183.

[7] L. Chang, J. Chen, L. T. Yang, X. Zhang, C. Yang, R. Ranjan et al., “Authorized public auditing of dynamic big data storage on cloud with efficient verifiable fine-grained updates,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 9, pp. 2234–2244, 2014. https://doi.org/10.1109/TPDS.2013.191.

[8] Y. Zhang and M. Blanton, “Efficient Dynamic Provable Possession of Remote Data via Update Trees,” ACM Trans. Storage, vol. 12, no. 2, pp. 1–45, 2016. https://doi.org/10.1145/2747877.

[9] Y. Zhu, G. J. Ahn, H. Hu, S. S. Yau, H. G. An, and C. J. Hu, “Dynamic audit services for outsourced storages in clouds,” IEEE Trans. Serv. Comput., vol. 6, no. 2, pp. 227–238, 2013. https://doi.org/10.1109/TSC.2011.51.

[10] T. Hui, Y. Chen, C. Chen Chang, H. Jiang, Y. Huang, Y. Chen et al., “Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage,” IEEE Trans. Serv. Comput., vol. 10, no. 5, pp. 701–714, 2017. https://doi.org/10.1109/TSC.2015.2512589.

[11] C. ming Tang and X. jun Zhang, “A new publicly verifiable data possession on remote storage,” J. Supercomput., vol. 75, pp. 77–91, 2019. https://doi.org/10.1007/s11227-015-1556-z.

[12] A. Li, S. Tan, and Y. Jia, “A method for achieving provable data integrity in cloud computing,” J. Supercomput., vol. 75, pp. 92–108, 2019. https://doi.org/10.1007/s11227-015-1598-2.

[13] Y. Yong, L. Xue, M. H. Au, W. Susilo, J. Ni, Y. Zhang et al., “Cloud data integrity checking with an identity-based auditing mechanism from RSA,” Futur. Gener. Comput. Syst., vol. 62, pp. 85–91, 2016. https://doi.org/10.1016/j.future.2016.02.003.

[14] Z. Xu, L. Wu, M. K. Khan, K. K. R. Choo, and D. He, “A secure and efficient public auditing scheme using RSA algorithm for cloud storage,” J. Supercomput., vol. 73, no. 12, pp. 5285–5309, 2017. https://doi.org/10.1007/s11227-017-2085-8.

[15] K. M. Lee, K. M. Lee, and S. H. Lee, “Remote data integrity check for remotely acquired and stored stream data,” J. Supercomput., vol. 74, no. 3, pp. 1182–1201, 2018. https://doi.org/10.1007/s11227-017-2117-4.

[16] J. Yuan and S. Yu, “Secure and constant cost public cloud storage auditing with deduplication,” in 2013 IEEE Conference on Communications and Network Security, CNS 2013, 2013, pp. 145–153. https://doi.org/10.1109/CNS.2013.6682702.

[17] Z. Yucheng, D. Feng, H. Jiang, W. Xia, M. Fu, F. Huang et al., “A Fast Asymmetric Extremum Content Defined Chunking Algorithm for Data Deduplication in Backup Storage Systems,” IEEE Trans. Comput., vol. 66, no. 2, pp. 199–211, 2017. https://doi.org/10.1109/TC.2016.2595565.

[18] E. Gaetani, L. Aniello, R. Baldoni, F. Lombardi, A. Margheri, and V. Sassone, “Blockchain-based database to ensure data integrity in cloud computing environments,” CEUR Workshop Proc., vol. 1816, pp. 146– 155, 2017.

[19] Y. El Khanboubi and M. Hanoune, “Exploiting Blockchains to improve Data Upload and Storage in the Cloud,” vol. 11, no. 3, pp. 357–364, 2019.

[20] S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Www. Bitcoin.Org, p. 9, 2008. https://doi.org/10.1007/s10838-008-9062-0.

[21] R. C. Merkle, “I NFORMAT I ON SYSTEMS LABORATORY By,” 1979.

[22] Siva Sankar K. Venish A., “Study of Chunking Algorithm in Data Deduplication,” Proc. Int. Conf. Soft Comput. Syst. Adv. Intell. Syst. Comput., vol. 398, pp. 319–329, 2016. https://doi.org/10.1007/978-81-322-2674-1.

[23] I. C. Lin and T. C. Liao, “A survey of blockchain security issues and challenges,” Int. J. Netw. Secur., vol. 19, no. 5, pp. 653–659, 2017. https://doi.org/10.6633/IJNS.201709.19(5).01.

[24] Sasaki Y., Aoki K. (2009) “Finding Preimages in Full MD5 Faster Than Exhaustive Search” In: Joux A. (eds) Advances in Cryptology - EUROCRYPT 2009. Lecture Notes in Computer Science, vol 5479. Springer, Berlin, Heidelberg.

[25] J. Gantz and D. Reinsel, “The Digital Universe Decade – Are You Ready?”, Idc, vol. 2009, no. May, p. 16, 2010.

[26] F. Coelho, “An (almost) constant-effort solution-verification proof-ofwork protocol based on Merkle trees,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 5023 LNCS, pp. 80–93, 2008. https://doi.org/10.1007/97 8-3-540-68164-9_6.