IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i6idhcseit1726300.html

A Solution for Multiparty Privacy Conflicts Detection in OSN

Author

Listed:
  • Muppa Dedeepya
  • Ch.Ravindra Babu

Abstract

Multi-Party Privacy Conflicts is a major issue in OSN. from last few years there is lot of change in usage of social media .Information and images shared through Social Media may affect more than one user’s privacy -e.g., Information that depict different users, comments that mention different users, events in which different users are invited, etc. In this paper , Many types of privacy management support in present mainstream Social Media foundation makes users unable to appropriately control the sender and receiver. Computational mechanisms that are able to merge the privacy preferences of different users into a single policy for an item can help solve this problem. Merging different user’s personal preferences is difficult hence conflicts occur in privacy preferences, so methods to resolve conflicts are needed. Moreover, these techniques need to consider how users’ would actually reach an engagement about a solution to the conflict in order to propose solutions that can be acceptable by all of the users affected by the information to be shared. present approaches are either too demanding or only consider fixed ways of aggregating privacy preferences. Here, we introduce the basic computational procedure to overcome problems in Social Media that is able to adapt to different situations by modeling the concessions that users make to reach a answers to the conflicts. The present results of a user study in which our introduced mechanism outperformed other present approaches in terms of how many times each approach matched users’ action.

Suggested Citation

  • Muppa Dedeepya & Ch.Ravindra Babu, 2017. "A Solution for Multiparty Privacy Conflicts Detection in OSN," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(6), pages 1004-1008, December.
  • Handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit1726300
    Note: Article URL: https://ijsrcseit.com/CSEIT1726300
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1726300
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1726300.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit1726300. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.