메뉴 건너뛰기




Volumn , Issue , 2011, Pages 847-852

Attack vector analysis and privacy-preserving social network data publishing

Author keywords

Data publications; Privacy disclosure; Social networks; Threat analysis

Indexed keywords

ATTACK VECTOR; DATA COLLECTION; DATA MINING TECHNIQUES; DATA PUBLICATIONS; DATA PUBLISHING; PRIVACY ATTACKS; PRIVACY PRESERVING; SENSITIVE INFORMATIONS; SOCIAL NETWORKS; THREAT ANALYSIS;

EID: 84856200926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TrustCom.2011.113     Document Type: Conference Paper
Times cited : (10)

References (26)
  • 1
    • 84856191070 scopus 로고    scopus 로고
    • A Survey of Privacy-Preservation of Graphs and Social Networks
    • X. Wu, et al., "A Survey of Privacy-Preservation of Graphs and Social Networks," Managing and Mining Graph Data, pp. 421-453, 2010.
    • (2010) Managing and Mining Graph Data , pp. 421-453
    • Wu, X.1
  • 2
    • 70350632870 scopus 로고    scopus 로고
    • A brief survey on anonymization techniques for privacy preserving publishing of social network data
    • B. Zhou, et al., "A brief survey on anonymization techniques for privacy preserving publishing of social network data," ACM SIGKDD Explorations Newsletter, vol. 10, pp. 12-22, 2008.
    • (2008) ACM SIGKDD Explorations Newsletter , vol.10 , pp. 12-22
    • Zhou, B.1
  • 4
    • 34250001672 scopus 로고    scopus 로고
    • What anyone can know: The privacy risks of social networking sites
    • D. Rosenblum, "What anyone can know: The privacy risks of social networking sites," IEEE Security & Privacy, pp. 40-49, 2007.
    • (2007) IEEE Security & Privacy , pp. 40-49
    • Rosenblum, D.1
  • 5
    • 41849097852 scopus 로고    scopus 로고
    • AOL removes search data on vast group of web users
    • S. Hansell, "AOL removes search data on vast group of web users," New York Times, vol. 8, p. C4, 2006.
    • (2006) New York Times , vol.8
    • Hansell, S.1
  • 6
    • 77954581824 scopus 로고    scopus 로고
    • How to break anonymity of the netflix prize dataset
    • A. Narayanan and V. Shmatikov, "How to break anonymity of the netflix prize dataset," Proc. of IEEE S, vol. 38.
    • Proc. of IEEE S , vol.38
    • Narayanan, A.1    Shmatikov, V.2
  • 7
    • 77951201056 scopus 로고    scopus 로고
    • Privacy-preserving data publishing: A survey of recent developments
    • B. Fung, et al., "Privacy-preserving data publishing: A survey of recent developments," ACM Computing Surveys (CSUR), vol. 42, pp. 1-53, 2010.
    • (2010) ACM Computing Surveys (CSUR) , vol.42 , pp. 1-53
    • Fung, B.1
  • 8
    • 71149088987 scopus 로고    scopus 로고
    • Users of the world, unite! The challenges and opportunities of Social Media
    • A. M. Kaplan and M. Haenlein, "Users of the world, unite! The challenges and opportunities of Social Media," Business Horizons, vol. 53, pp. 59-68, 2010.
    • (2010) Business Horizons , vol.53 , pp. 59-68
    • Kaplan, A.M.1    Haenlein, M.2
  • 9
    • 77952944272 scopus 로고    scopus 로고
    • Available
    • Facebook. (2011, Facebook Statistic. Available: http://www.facebook.com/ press/info.php?statistics
    • (2011) Facebook Statistic
  • 13
    • 84856185416 scopus 로고    scopus 로고
    • The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks
    • B. Zhou and J. Pei, "The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks," Knowledge and Information Systems, pp. 1-31, 2010.
    • (2010) Knowledge and Information Systems , pp. 1-31
    • Zhou, B.1    Pei, J.2
  • 14
    • 84865065669 scopus 로고    scopus 로고
    • K-automorphism: A general framework for privacy preserving network publication
    • L. Zou, et al., "K-automorphism: A general framework for privacy preserving network publication," Proceedings of the VLDB Endowment, vol. 2, pp. 946-957, 2009.
    • (2009) Proceedings of the VLDB Endowment , vol.2 , pp. 946-957
    • Zou, L.1
  • 19
    • 84859194833 scopus 로고    scopus 로고
    • Resisting structural re-identification in anonymized social networks
    • M. Hay, et al., "Resisting structural re-identification in anonymized social networks," Proceedings of the VLDB Endowment, vol. 1, pp. 102-114, 2008.
    • (2008) Proceedings of the VLDB Endowment , vol.1 , pp. 102-114
    • Hay, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.