• DocumentCode
    2775036
  • Title

    Relationship Privacy Preservation in Publishing Online Social Networks

  • Author

    Li, Na ; Zhang, Nan ; Das, Sajal K.

  • Author_Institution
    CSE Dept., Univ. of Texas at Arlington, Arlington, TX, USA
  • fYear
    2011
  • fDate
    9-11 Oct. 2011
  • Firstpage
    443
  • Lastpage
    450
  • Abstract
    The third-party enterprises, such as sociologists and commercial companies, are mining data published from online social network (OSN) websites (e.g., Face book, Twitter) to serve their diverse purposes. This process leads to critical user concerns over their privacy, especially sensitive relationship with others on OSNs. Existing anonymization techniques in publishing online social data are focused on user identities, as users´ relationship privacy will be automatically protected in general, if their identities are hidden. However, in reality, some users can still be identified from an identity-anonymized OSN by an attacker, as an individual user may publish his personal information to the public, through blog for example, which can be exploited by the attacker to re-identify the user from the published data. Therefore, we intend to preserve relationship privacy between two users one of whom can even be identified in the released OSN data. We define the ℓ-diversity anonymization model to preserve users´ relationship privacy. Additionally, we devise two algorithms to achieve the ℓ-diversity anonymization - one only removes edges while the other only inserts vertices/edges for maintaining as many topological properties of the original social networks as possible, thus retaining the utility of the published data for the third-parties. Extensive experiments are conducted on both synthetic and real-world social network data sets to demonstrate that except from the achievement of privacy preservation, the utility loss caused by our proposed graph manipulation based techniques is acceptable. Besides, we analyze the influence of social network topology (e.g., average degree, network scalability) on the performance of our algorithms.
  • Keywords
    data mining; data privacy; publishing; social networking (online); OSN websites; anonymization techniques; commercial companies; data mining; graph manipulation based techniques; l-diversity anonymization; online social data publishing; online social networks; personal information; relationship privacy preservation; sociologists; third-party enterprises; user relationship privacy; Complexity theory; Data models; Data privacy; Privacy; Publishing; Social network services; Topology; k-anonymity; l-diversity; online social network; relationship privacy; utility loss;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), 2011 IEEE Third International Conference on
  • Conference_Location
    Boston, MA
  • Print_ISBN
    978-1-4577-1931-8
  • Type

    conf

  • DOI
    10.1109/PASSAT/SocialCom.2011.191
  • Filename
    6113146