Using Cloud Storage, users can store their data
remotely and utilize the high quality applications and
services from a shared pool of configurable computing
resources, eliminating the burden of local data storage and
maintenance. With data storage and sharing services in the
cloud, users can easily modify and share data. The main aim
of this study is to check the integrity of the user in order to
prevent data being attacked by unauthorized user. Hence,
enabling public auditability for cloud storage is of critical
importance so that users can resort to a third party auditor
(TPA) to check the integrity of shared data and be worryfree.
But if TPA gets hacked, then data can be accessed by
any unauthorized user. To overcome this problem ,we are
coming with the model of service which will replace TPA by
Data Auditing service.
Published In : IJCAT Journal Volume 2, Issue 4
Date of Publication : April 2015
Pages : 125 - 129
Figures :01
Tables : --
Publication Link :Public Auditing for the Shared Data in the Cloud
Anmol Achhra : Final Year Computer Department, Pune University
Dr. D.Y. Patil College Of Engineering, Pune,India
Priyanka Vaswani : Final Year Computer Department, Pune University
Dr. D.Y. Patil College Of Engineering, Pune,India
Rajeshwari Agale : Final Year Computer Department, Pune University
Dr. D.Y. Patil College Of Engineering, Pune,India
Meera Chheda : Final Year Computer Department, Pune University
Dr. D.Y. Patil College Of Engineering, Pune,India
Cloud Computing
Auditability
Integrity
A Proposing module study of data security with respect to
data leakage, fake profile, insecure interface and their
factors. Rest network base security threats like Distributed
Denial Of Service(DDOS) attack, Bruit force attack are to
be target in future enhancement.
[1] Razali, A.M. and S. Ali, “Generating treatment plan
in medicine: A data mining approach”. In the
Proceedings of Am. J. Applied Sci., 6 2009: pp. 345-
351.
[2] Oliveira, S., &Zaiane, O. “Privacy preserving
frequent itemset mining” In the Proceedings of IEEE
International Conference On Data Mining,November
2002,pp. 43–54.
[3] Saygin, Y., V.S. Verykios and A.K. Elmagarmid.
“Privacy preserving association rule mining”. In the
Proceedings of the 12th International Workshop on
Research Issues in Data Engineering: Engineering ECommerce/
E-Business Systems, Feb. 24-25, IEEE
Xplore Press, SanJose, CA. USA.2002, pp. 151-158.
[4] Vaidya, J., H. Yu and X. Jiang. “Privacy preserving
SVM classification”.In the Proceedings of Knowl.
Inform.2008 Syst., pp. 161-178.
[5] Verykios, V.S., A.K. Elmagarmid, E. Bertino, Y.
Saygin and E. Dasseni. “Association rule hiding”. In
the Proceedings of IEEE Trans. Knowl. Data
Eng.,2004 16:pp.434-447.
[6] Evfimievski, A., R. Srikant, R. Agrawal and J.
Gehrke. “Privacy preserving mining of association
rules”. Proceedings of the 8th ACMSIGKDD
International Conference on Knowledge Discovery
and Data Mining, July 23-25, ACM Press,
Edmonton, AB., Canada,2002 pp. 1-12.
[7] Wang, S.L., B. Parikh and A. Jafari. ” Hiding
informative association rule sets”. Exp. Syst. Appli.,
33: pp. 316-323, 2007.
[8] Y. H. Wu, C.M. Chiang and A.L.P. Chen. “Hiding
Sensitive Association Rules with Limited Side
Effects”, In the Proceedings of IEEE Transactions on
Knowledge and Data Engineering, vol.19 (1), pp.
29–42, Jan. 2007.
[9] V.S. Verykios, A.K. Elmagarmid, E. Bertino, Y.
Saygin, and E. DasseniIn the Proceedings of
“Association rule hiding, IEEE Transactions on
Knowledge and Data engineering”, vol. 16(4), pp.
434–447, April 2004. [10] K. Duraiswamy, and D. Manjula, “Advanced
Approach in Sensitive Rule Hiding”, In the
Proceedings of Modern Applied Science, vol. 3(2),
Feb. 2009.
[11] X. Sun and P.S. Yu, “A Border-Based Approach for
Hiding Sensitive Frequent Itemsets”, In Proc. Fifth
IEEE Int’l Conf. Data Mining (ICDM ’05), pp. 426–
433, Nov. 2005.
[12] Y. Saygin, V. S. Verykios, and A. K. Elmagarmid,
“Privacy preserving association rule mining”, In
Proc. Int’l Workshop on ResearchIssues in Data
Engineering (RIDE 2002), pp. 151–163, 2002.
[13] T. Mielikainen, “On inverse frequent set mining,” In
Proc. 3rd IEEE ICDM Workshop on Privacy
Preserving Data Mining. IEEE Computer Society,
pp.18–23, 2003.
[14] J. Vaidya and C. Clifton, “Privacy preserving
association rule mining in vertically partitioned
data,” In proc. Int’l Conf. Knowledge Discovery and
Data Mining, pp. 639–644, July 2002.
[15] R. Agrawal and R. Srikant, “ Privacy preserving data
mining “,In the Proceedings of ACM SIGMOD
Conference on Management of Data pages 439-
450,Dallas, Texas, May 2000.
[16] Yogendra Kumar Jain et al. / International Journal on
Computer Science and Engineering (IJCSE) ISSN
