Data Integrity Verification Using MPT (Merkle Patricia Tree) in Cloud Computing

  • Authors

    • Subasri Mathiyalahan
    • Shobana Manivannan
    • Mahalakshmi Nagasundaram
    • R Ezhilarasie
    2018-04-25
    https://doi.org/10.14419/ijet.v7i2.24.12146
  • Data Integrity, Provable Data Possession (PDP), Patricia Tree, Merkle Hash Tree, Merkle Patricia Tree, Block chain.

  • Abstract

    Data integrity of outsourced data is main problem in CSP (cloud service provider). Space overhead and computation complexity are very high issue in recent PDP(Provable Data Possession) verification schemes. To overcome such issues MPDP (Mobile Provable Data Possession) schemes using hash tree data structure and Boneh-Lynn-Snacham short signature scheme have been used over decade. Data dynamics is well supported in MPDP scheme via block less verification, dynamic data operations, stateless verification, and verification out sourcing. But still there are some operations which can be performed much more efficiently in some other way than that of the two methods prescribed above. Operations in particular, data modification operations like insertion and deletion operations is somewhat difficult or in other words time consuming in hash tree data structure. In this paper, we have deployed an improved hash tree structure called MPT (Merkle Patricia Tree) for integrity checking.MPT is combination of MHT (Merkle Hash Tree) and patricia tree where each node consists of key-value pairs.  As of now, MPT has been used only in block chain technology for providing authentication of transactions through Ethereum.

     

  • References

    1. [1] M. S. Niaz and G. Saake, “Merkle hash tree based techniques for data integrity of outsourced data,†CEUR Workshop Proc., vol. 1366, pp. 66–71, 2015.

      [2] A. Shoufan, N. Huber, and H. Gregor Molter, “A novel cryptoprocessor architecture for chained Merkle signature scheme,†Microprocess. Microsyst., vol. 35, no. 1, pp. 34–47, 2011.

      [3] V. Verma, “An Efficient Signcryption Algorithm using Bilinear Mapping,†Computing for Sustainable Global Development (INDIACom), 3rd International Conference,pp. 680–682, 2016.

      [4] C. Lin, Z. Shen, Q. Chen, and F. T. Sheldon, “A data integrity verification scheme in mobile cloud computing,†J. Netw. Comput. Appl., vol. 77, pp. 146–151, 2017.

      [5] N. Garg and S. Bawa, “RITS-MHT: Relative indexed and time stamped Merkle hash tree based data auditing protocol for cloud computing,†J. Netw. Comput. Appl., vol. 84, no. January, pp. 1–13, 2017.

      [6] G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,†Proc. 4th Int. Conf. Secur. Priv. Commun. netowrks - Secur., 2008.

      [7] D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the weil pairing,†J. Cryptol., vol. 17, no. 4, pp. 297–319, 2004.

      [8] V. Kher and Y. Kim, “Building trust in storage outsourcing: Secure accounting of utility storage,†Proc. IEEE Symp. Reliab. Distrib. Syst., pp. 55–65, 2007.

      [9] A. . Juels and B. S. . Kaliski Jr., “Pors: Proofs of retrievability for large files,†Proc. ACM Conf. Comput. Commun. Secur., pp. 584–597, 2007.

      [10] G. Xu, Z. Sun, C. Yan, and Y. Gan, “A rapid detection algorithm of corrupted data in cloud storage,†J. Parallel Distrib. Comput., vol. 111, pp. 115–125, 2018.

      [11] E. Mykletun, M. Narasimha, and G. Tsudik, “Authentication and integrity in outsourced databases,†ACM Trans. Storage, vol. 2, no. 2, pp. 107–138, 2006.

      [12] J. Zhang, Z. Zhang, and H. Guo, “Mobile Cloud Computing,†vol. 16, no. 11, pp. 3222–3235, 2017.

      [13] J. Xu and E. Chang, “Towards Efficient Provable Data Possession,†Organization, pp. 1–16, 2007.

      [14] R. Arora and A. Parashar, “Secure User Data in Cloud Computing Using Encryption Algorithms,†Int. J. Eng. Res. Appl., vol. 3, no. 4, pp. 1922–1926, 2013.

      [15] R. Popa, J. Lorch, and D. Molnar, “Enabling security in cloud storage SLAs with CloudProof,†Proc. USENIX, pp. 355–368, 2011.

      [16] J. Yuan and S. Yu, “Public Integrity Auditing for Dynamic Data Sharing With Multiuser Modification,†vol. 10, no. 8, pp. 1717–1726, 2015.

      [17] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing Computer Security – ESORICS,†IEEE Trans. Parallel Distrib. Syst., vol. 5789, no. 5, pp. 355–370, 2009.

      [18] P. Ora and C. Scienc, “Data Security and Integrity in Cloud Computing Based On RSA Partial Homomorphic and MD5 Cryptography,†International Conference on Computer, Communication and Control (IC4), 2015.

      [19] C. Sarika and R. M. Jasmine, “An Outsourced Proof of Retrievability for Dynamic Data Operation in Cloud Abstract,†International Journal for Research in Science Engineering and Technology, vol. 3, no. 1, pp. 19–22, 2016.

      [20] G. Ateniese et al., “Provable data possession at untrusted stores,†Proc. 14th ACM Conf. Comput. Commun. Secur. CCS, no. 1, pp. 598, 2007.

      [21] SHUBHANSHU GUPTA, S. KOLANGIAMMAL, T.PADMAPRIYA, “Smart Curtain Using Internet Of Things†International Innovative Research Journal of Engineering and Technology, Vol. 2, Special Issue, pp. 4-8.

      [22] M. Rajesh, Manikanthan, “ANNOYED REALM OUTLOOK TAXONOMY USING TWIN TRANSFER LEARNINGâ€, International Journal of Pure and Applied Mathematics, ISSN NO: 1314-3395, Vol-116, No. 21, Oct 2017.

  • Downloads

  • How to Cite

    Mathiyalahan, S., Manivannan, S., Nagasundaram, M., & Ezhilarasie, R. (2018). Data Integrity Verification Using MPT (Merkle Patricia Tree) in Cloud Computing. International Journal of Engineering & Technology, 7(2.24), 500-503. https://doi.org/10.14419/ijet.v7i2.24.12146

    Received date: 2018-04-25

    Accepted date: 2018-04-25

    Published date: 2018-04-25