English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16716/19011 (88%)
Visitors : 5855965      Online Users : 329
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://ir.cnu.edu.tw/handle/310902800/29691


    標題: K-anonymity against neighborhood attacks in weighted social networks
    作者: Liu, Chuan-Gang
    Liu, I-Hsien
    Yao, Wun-Sheng
    Li, Jung-Shian
    貢獻者: 資訊多媒體應用系
    關鍵字: weightedsocialnetworks
    neighborhoodattacks
    privacyprotection
    k-anonymity
    日期: 2015-12
    上傳時間: 2016-04-19 19:04:47 (UTC+8)
    出版者: Wiley-Blackwell
    摘要: Nowadays, with the advance of Internet technology, social network is getting popular, which combines the virtual network and the real world. People employ this network to communicate with all social things of their interest, including shopping, making friends, sharing experiences of life, and so on. In social networks, the social data expands rapidly and the malicious users can easily get the social data. With the social information, they could conjecture the relationship among social network data via the systematical analysis tool. Hence, the personal privacy data in social network may be exposed to some unknown risks, and recently, these issues arising in such a network catch much attention. The protection of personal privacy social data becomes an important and urgent research in social networks. One of personal privacy social information is the relations between the individuals and their social groups, namely human relationships.

    Neighborhood attacks are incident to the exposure of human relationships. Previous studies try to conceal human relationships information with well-known k-anonymity protection to resist this attack in social networks. However, those researches do not take care of those attacks in weighted social network, which does not make sense due to the fact that people should have different relationships with different persons. In such weighted social network, the edge denotes the human relationship and the weight denotes the degree of this human relationship in social networks. Our study focuses on the k-anonymity protection scheme in weighted social networks, and our scheme can achieve k-anonymity protection under the expected conditions, less virtual edges added and fewer weights changed. Through the analysis with MATLAB tool, we show that our k-anonymity algorithm can achieve high anonymity protection rate under various k-anonymity policies. Copyright (C) 2015 John Wiley & Sons, Ltd.
    關聯: Security And Communication Networks, v.8 n.18, pp.3864-3882
    Appears in Collections:[資訊多媒體應用系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML297View/Open


    All items in CNU IR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback