Open Access   Article Go Back

Resolving Multi-party Privacy Clashes in Online P TO P Social Networking

R. Tandon1 , Prabadevi B.2

  1. School of Information Technology and Engineering, VIT University, Vellore, India.
  2. School of Information Technology and Engineering, VIT University, Vellore, India.

Correspondence should be addressed to: rajattandon93@yahoo.in.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-5 , Page no. 71-76, May-2017

Online published on May 30, 2017

Copyright © R. Tandon, Prabadevi B. . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: R. Tandon, Prabadevi B., “Resolving Multi-party Privacy Clashes in Online P TO P Social Networking,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.71-76, 2017.

MLA Style Citation: R. Tandon, Prabadevi B. "Resolving Multi-party Privacy Clashes in Online P TO P Social Networking." International Journal of Computer Sciences and Engineering 5.5 (2017): 71-76.

APA Style Citation: R. Tandon, Prabadevi B., (2017). Resolving Multi-party Privacy Clashes in Online P TO P Social Networking. International Journal of Computer Sciences and Engineering, 5(5), 71-76.

BibTex Style Citation:
@article{Tandon_2017,
author = {R. Tandon, Prabadevi B.},
title = {Resolving Multi-party Privacy Clashes in Online P TO P Social Networking},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2017},
volume = {5},
Issue = {5},
month = {5},
year = {2017},
issn = {2347-2693},
pages = {71-76},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1266},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1266
TI - Resolving Multi-party Privacy Clashes in Online P TO P Social Networking
T2 - International Journal of Computer Sciences and Engineering
AU - R. Tandon, Prabadevi B.
PY - 2017
DA - 2017/05/30
PB - IJCSE, Indore, INDIA
SP - 71-76
IS - 5
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
744 675 downloads 550 downloads
  
  
           

Abstract

OnlineSocial Networking (OSN) incurs many problems such as – privacy of each time shared in OSN may not be secured e.g. twitter, Facebook and Unauthorized data can be shared easily to their timeline. The existing algorithm is Interaction Algorithm which is totally based on “what the framework does. ’It is implemented as so Roles which are played objects at run time entity. But this problem is resolved by using – the Conflict Detection Algorithm in the proposed system. In this algorithm the individual assurance slants of every mastermind clients with a particular deciding objective recognizes the conflicts among them. The nonappearance of online networking event protection association bolsters in current standard Social Media bases, which makes clients not prepared to fittingly control to whom these things are really shared?. Current framework or system are either nonsensically requesting or basically considers only settled techniques for social affair security inclines. I propose the basic computational system to choose clashes for multi-party security association in Online networking that can adjust to various conditions by showing the concessions that clients make to achieve a reaction for the debate. The result for Privacy of each item shared in online networking will be more secured.

Key-Words / Index Term

online networking, unauthorized photos, items, Interaction Algorithm, Conflict Detection Algorithm

References

[1]. K. Thomas, G. Chris, MN Davi, “Antagonistic: Multi-Party Protection Chances in Interpersonal organizations”, In International Symposium on Privacy Enhancing Technologies Symposium, Heidelberg, pp.236-252, 2010.
[2]. A. Laminar, L. Vilma, A. Lehmuskallio, S. Tamminen, “We’re in It Together: Relational Administration of Divulgence in Informal community Administrations”, In Proceedings of the SIGCHI conference on human factors in computing systems, USA, pp. 3217-3226, 2011.
[3]. SM Jose, "Security and Self –divulgences in Multivalent Systems", In the 10th International Conference on Autonomous Agents and Multivalent Systems, NY, pp.1333-1334. 2011.
[4]. Yu Lei, Huan Liu, "Productive Component Determination by means of Examination of Importance and Excess”, Journal of machine learning research, Vol.5, Issue.10, pp.1205-1224, 2004.
[5]. SM Jose, Natalia Criado, "Verstile Clash Determination Component for Multi-Party Security Administration in Online Networking", In Proceedings of the 13th Workshop on Privacy in the Electronic Society, USA, pp. 69-72, 2014.
[6]. Fang, Lujun, Kristen Lefebvre, "Protection Wizards for person to person Communication Locales", In Proceedings of the 19th international conference on World Wide Web, USA, pp.351-360, 2010.
[7]. Hu, Hongxin, Gail-Joon Ahn, Ziming Zhao, Dejun Yang, "Amusement Theoretic Examination of Multiparty Get to Control in Online Informal Communities", In Proceedings of the 19th ACM symposium on Access control models and technologies, NY, pp. 93-102, 2014.
[8]. Mazzia Alessandra, Kristen LeFevre, Eytan Adar, "The Pviz Understanding Instrument for Informal Community Protection Settings", In Proceedings of the Eighth Symposium on Usable Privacy and Security, US, pp.1-13, 2012.