Email this article Determining Multi Party Skirmishes Communal Media
Abstract
Web-based social networking foundations makes clients unable to fittingly control to whom these items are really shared or not. Computational components that can combine the protection inclinations of numerous clients into a solitary arrangement for aitem can help take care of this issue. In any case, consolidating various clients' security inclinations isn't a simple undertaking, since protection inclinations may strife, so strategies to determine clashes are required. Besides, these strategies need to consider how clients' would really achieve an assention about an answer for the contention keeping in mind the end goal to propose arrangements that can be adequate by the greater part of the clients influenced by the item to be shared. Current methodologies are either excessively requesting or just consider settled methods for accumulating security inclinations. In this paper, we propose the primary computational instrument to determine clashes for multi-party protection administration in Social Media that can adjust to various circumstances by displaying the concessions that clients make to achieve an answer for the contentions.
References
Internet.org, “A focus on efficiency,” http://internet.org/efficiencypaper, Retr. 09/2014.
K. Thomas, C. Grier, and D. M. Nicol, “unfriendly: Multi-party privacy risks in social networks,” in Privacy Enhancing Technologies. Springer, 2010, pp. 236–252.
A. Lampinen, V. Lehtinen, A. Lehmuskallio, and S. Tamminen, “We’re in it together: interpersonal management of disclosure in social network services,” in Proc. CHI. ACM, 2011, pp. 3217– 3226.
P.Wisniewski, H. Lipford, and D.Wilson, “Fighting for my space: Coping mechanisms for sns boundary regulation,” in Proc. CHI. ACM, 2012, pp. 609–618.
A. Besmer and H. Richter Lipford, “Moving beyond untagging: photo privacy in a tagged world,” in ACM CHI, 2010, pp. 1563– 1572.
Facebook NewsRoom, “One billion- key metrics,” http://newsroom.fb.com/download-media/4227, Retr. 26/06/2013.
J. M. Such, A. Espinosa, and A. Garc´ıa-Fornes, “A survey of privacy in multi-agent systems,” The Knowledge Engineering Review, vol. 29, no. 03, pp. 314–344, 2014.
R. L. Fogues, J. M. Such, A. Espinosa, and A. Garcia-Fornes, “Open challenges in relationship-based privacy mechanisms for social network services,” International Journal of Human-Computer Interaction, no. In press., 2015.
R. Wishart, D. Corapi, S. Marinovic, and M. Sloman, “Collaborative privacy policy authoring in a social networking context,” in POLICY. IEEE, 2010, pp. 1–8.
A. Squicciarini, M. Shehab, and F. Paci, “Collective privacy management in social networks,” in WWW. ACM, 2009, pp. 521–530.
B. Carminati and E. Ferrari, “Collaborative access control in online social networks,” in IEEE CollaborateCom, 2011, pp. 231–240.
H. Hu, G.-J. Ahn, and J. Jorgensen, “Detecting and resolving privacy conflicts for collaborative data sharing in online social networks,” in Proc. ACSAC. ACM, 2011, pp. 103–112. [Online]. Available: http://doi.acm.org/10.1145/2076732.2076747
H. Hu, G. Ahn, and J. Jorgensen, “Multiparty access control for online social networks: model and mechanisms,” IEEE TKDE, 2013.
B. Carminati, E. Ferrari, and A. Perego, “Enforcing access control in web-based social networks,” ACM TISSEC, vol. 13, no. 1, p. 6, 2009.
P. Fong, “Relationship-based access control: protection model and policy language,” in Procs. ACM CODASPY. ACM, 2011, pp. 191–202
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.