• DocumentCode
    2865611
  • Title

    Partial Social Network Disclosure and Crawlers

  • Author

    Effendy, Suhendry ; Halim, Felix ; Yap, Roland H C

  • Author_Institution
    Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore
  • fYear
    2011
  • fDate
    12-14 Dec. 2011
  • Firstpage
    808
  • Lastpage
    815
  • Abstract
    The popularity and size of online social networks means the social graph contains valuable data about relationships. Such graph data may be sensitive. Thus, there is a need to protect the data from privacy leaks. On the other hand, public information and crawl ability are needed to support the basic utility and services on top of the social network. We propose policies where the owner of the social network can tradeoff between these two conflicting goals. We experiment with real world social network graphs and show that the owner of the graph can employ policies which can meet particular tradeoffs under different crawlers. Furthermore, the policies are efficient and scalable for the owner of the social network.
  • Keywords
    data privacy; graph theory; social networking (online); crawl ability; data protection; graph data; online social networks; partial social network disclosure; privacy leaks; public information; real world social network graphs; social graph; social network crawlers; Advertising; Crawlers; Facebook; LinkedIn; Privacy; Search engines; crawlers; graphs; privacy; social networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on
  • Conference_Location
    Sydney, NSW
  • Print_ISBN
    978-1-4673-0006-3
  • Type

    conf

  • DOI
    10.1109/DASC.2011.139
  • Filename
    6118897