IJMTES -ACHIEVE DATA INTEGRITY THROUGH CERTIFICATE-LESS VERIFICATIONS

Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : B Jaswanth Reddy | Dr.R.Kalpana  unnamed

Volume 03 Issue 06 2016

ISSN no:  2348-3121

Page no: 14-16

Abstract – Distributed file system for cloud is a file system that allows many clients to have access to the same data/file providing important operations (create, delete, modify, read, write). Each file may be partitioned into several parts called chunks. Each chunk is stored in remote machines. Typically, data is stored in files in a hierarchical tree where the nodes represent the directories. Hence, it facilitates the parallel execution of applications. There are several ways to share files in a distributed architecture. Each solution must be suitable for a certain type of application relying on how complex is the application, or how simple it is. Meanwhile, the security of the system must be ensured. Confidentiality, availability and integrity are the main keys for a secure system. We propose ID-DPDP (identity-based distributed provable data possession). In which the proposed system achieve the integrity of the cloud. And also eliminate the certificate verification. So that it can reduce the communication overhead.

Keywords— Remote Machine; Distributed Architecture; ID-DPDP (Identify-based distributed provable data possession 

Reference

  1. B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22,2012.
  2. G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2011, pp. 598–609.
  3. A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2010, pp. 584–597.
  4. G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm, 2008, pp. 1–10.
  5. C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222.
  6. H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107.
  7. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in ACM CCS’07, Full paper available on e-print (2007/202), 2007.
  8. A. Juels and B. Kaliski, “PORs: Proofs of retrievability for large files,” in ACM CCS’07, Full paper available on e-print (2007/243), 2007.
  9. Y. Deswarte and J.-J.Quisquater, “Remote Integrity Checking,” in Sixth Working Conference on Integrity and Internal Control in Information Systems (IICIS) (S. J. L. Strous, ed.), pp. 1–11, Kluwer Academic Publishers, 1 2006.
  10. D. L. G. Filho and P. S. L. M. Barreto, “Demonstrating data possession and uncheatable data transfer.” Cryptology ePrint Archive, Report 2006/150, 2006. http://eprint.iacr.org/.
  11. M. A. Shah, M. Baker, J. C. Mogul, and R. Swaminathan, “Auditing to keep online storage services honest,” in Proc. of HotOS XI., Usenix, 2007.
  12. A. Heitzmann, B. Palazzi, C. Papamanthou, and R. Tamassia, “Efficient integrity checking of untrusted network storage,” in Storage SS’08: Proceedings of the 4th ACM international workshop on Storage security and survivability, (New York, NY, USA), pp. 43–54, ACM, 2008.
  13. M. T. Goodrich, R. Tamassia, and A. Schwerin, “Implementation of an authenticated dictionary with skip lists and commutative hashing,” DARPA Information Survivability Conference and Exposition,, vol. 2, p. 1068, 2009.
  14. L.Kalaivani and Kalpana . R “ Efficient Secured Two Party Computing with Encrypted Data for Public Cloud”, International Journal of Innovative Research in Computer Science & Technology, ISSN: 2347-5552, Vol 3, Issue 2 March 2015.