Protecting Chatting Labels on Social Networks

Authors

  • K. Hemalatha Department of Information Technology, IFET College of Engineering, Gangarampalaiyam, India
  • J. Kalaivani Department of Information Technology, IFET College of Engineering, Gangarampalaiyam, India

DOI:

https://doi.org/10.53555/cse.v2i5.186

Keywords:

SecureChat,, Emailauthentications,, s,Protectattacker,, Sensitivelabels,, PrivateKey

Abstract

In this business world, all information sharing delivering services are done through internet. There should be possibility for the vulnerabilities like brute force attack, cross site scripting, data breaching, SQL injection.Thus Privacy is one of the major concern. However, many solutions like black box testing tool, white box testing tool, web application security scanner etc are enforced, an attacker may still be able to infer one’s private information. Proposed model uses sensitive labels based on private key to prevent the personal information from third persons so that the users can chat securely. Furthermore, a social network like chat application will be created and the private key based sensitive labels are applied to this chatting application to analyse the performance. Also the effectiveness of the proposed technique will be analysed. 

Downloads

Download data is not yet available.

References

L. Backstrom, C. Dwork, and J.M. Kleinberg, “Wherefore Art Thou r3579x?: Anonymized Social Networks,Hidden Patterns, and Structural Steganography,” Proc. Int’l Conf. World Wide Web (WWW), pp. 181-190, 2007.

A.-L. Baraba´si and R. Albert, “Emergence of Scaling in Random Networks,” Science, vol. 286, pp. 509-512,1999.

S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava, “Class-Based Graph Anonymization for

Social Network Data,” Proc. VLDB Endowment, vol. 2, pp. 766- 777, 2009.

A. Campan and T.M. Truta, “A Clustering Approach for Data and Structural Anonymity in Social Networks,”Proc. Second ACM SIGKDD Int’l Workshop Privacy, Security, and Trust in KDD (PinKDD ’08), 2008.

A. Campan, T.M. Truta, and N. Cooper, “P-Sensitive K-Anonymitywith Generalization Constraints,” Trans.Data Privacy, vol. 2, pp. 65-89, 2010.

J. Cheng, A.W.-c. Fu, and J. Liu, “KIsomorphism: Privacy Preserving Network Publication against Structural Attacks,” Proc. Int’l Conf. Management of Data, pp. 459- 470, 2010.

G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, “Anonymizing Bipartite Graph Data Using Safe Groupings,” Proc. VLDB Endowment, vol. 1, pp. 833-844, 2008.

S. Das, O. Egecioglu, and A.E. Abbadi, “Privacy Preserving in Weighted Social Network,” Proc. Int’l Conf. Data Eng. (ICDE ’10), pp. 904-907, 2010.

W. Eberle and L. Holder, “Discovering Structural Anomalies in Graph-Based Data,” Proc. IEEE Seventh Int’l Conf. Data Mining Workshops (ICDM ’07), pp. 393-398, 2007.

K.B. Frikken and P. Golle, “Private Social Network Analysis: ow to Assemble Pieces of a Graph Privately,” Proc. Fifth ACM Workshop Privacy in Electronic Soc. (WPES ’06), pp. 89-98, 2006.

S.R. Ganta, S. asiviswanathan, and A. Smith, “Composition Attacks and Auxiliary Information in Data Privacy,” Proc. ACMSIGKDD Int’l Conf. Knowledge Discovery and Data Mining, pp. 265- 273, 2008

Downloads

Published

2016-05-31

How to Cite

Hemalatha, K., & Kalaivani, J. (2016). Protecting Chatting Labels on Social Networks. International Journal For Research In Advanced Computer Science And Engineering, 2(5), 01–05. https://doi.org/10.53555/cse.v2i5.186

Issue

Vol. 2 No. 5 (2016): International Journal For Research In Advanced Computer Science And Engineering

Section

Articles

License

Copyright (c) 2016 gnpublication@

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

In consideration of the journal, Green Publication taking action in reviewing and editing our manuscript, the authors undersigned hereby transfer, assign, or otherwise convey all copyright ownership to the Editorial Office of the Green Publication in the event that such work is published in the journal. Such conveyance covers any product that may derive from the published journal, whether print or electronic. Green Publication shall have the right to register copyright to the Article in its name as claimant, whether separately
or as part of the journal issue or other medium in which the Article is included.

By signing this Agreement, the author(s), and in the case of a Work Made For Hire, the employer, jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere, and is not being considered for publication elsewhere in any form, except as provided herein. Each author’s signature should appear below. The signing author(s) (and, in