Preservation of Attribute Couplet Attack by Node Addition in Social Networks

M. Kiranmayi, N. Maheswari, M. Sivagami
{"title":"Preservation of Attribute Couplet Attack by Node Addition in Social Networks","authors":"M. Kiranmayi, N. Maheswari, M. Sivagami","doi":"10.1109/ICCCT2.2019.8824873","DOIUrl":null,"url":null,"abstract":"Social Network is one of the most desired platform where an immense amount of data are available from many different social platforms. Publishing data without hiding sensitive data or diplomatic data about individuals is a crucial problem which cannot guarantees the privacy. Therefore published data needs to remove identifying particulars of the individuals (anonymized) before the data is released. Anonymizing data is more challenging and a popular privacy preserving model for data publishing in social networks. However even after anonymizing the data sets, attackers try to find new methods to derive private information of individuals with some background knowledge and identify them. One of such method is attribute couplet attack where the attacker has some background information about the data and derive the identity using a pair of node attributes. In the existing approach, the k-couplet anonymity achieves the privacy under the attribute couplet attack by using edge modification approach. This will change the distance properties between nodes and might also introduce undesirable and misleading fake relations. In this paper, we design an algorithm named Couplet Anonymization by using node addition approach. Adding new nodes and connecting them to some of the nodes in the original network can avoid this attribute couplet attack and gives a better chance to preserve the network properties. This node addition helps to reduce the misleading fake relations and also preserves the utility of the social networks.","PeriodicalId":445544,"journal":{"name":"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT2.2019.8824873","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Social Network is one of the most desired platform where an immense amount of data are available from many different social platforms. Publishing data without hiding sensitive data or diplomatic data about individuals is a crucial problem which cannot guarantees the privacy. Therefore published data needs to remove identifying particulars of the individuals (anonymized) before the data is released. Anonymizing data is more challenging and a popular privacy preserving model for data publishing in social networks. However even after anonymizing the data sets, attackers try to find new methods to derive private information of individuals with some background knowledge and identify them. One of such method is attribute couplet attack where the attacker has some background information about the data and derive the identity using a pair of node attributes. In the existing approach, the k-couplet anonymity achieves the privacy under the attribute couplet attack by using edge modification approach. This will change the distance properties between nodes and might also introduce undesirable and misleading fake relations. In this paper, we design an algorithm named Couplet Anonymization by using node addition approach. Adding new nodes and connecting them to some of the nodes in the original network can avoid this attribute couplet attack and gives a better chance to preserve the network properties. This node addition helps to reduce the misleading fake relations and also preserves the utility of the social networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于节点添加的社交网络属性对联攻击保护
社交网络是最理想的平台之一,在那里可以从许多不同的社交平台获得大量的数据。发布数据时不隐藏个人敏感数据或外交数据是一个不能保证隐私的关键问题。因此,公布的数据需要在公布之前删除个人的识别细节(匿名)。匿名数据更具挑战性,也是社交网络中数据发布的一种流行的隐私保护模式。然而,即使在对数据集进行匿名化处理后,攻击者仍试图找到新的方法来获取具有一定背景知识的个人的私人信息并对其进行识别。其中一种方法是属性对偶攻击,攻击者掌握数据的一些背景信息,利用一对节点属性派生出身份。在现有方法中,k-对偶匿名利用边缘修改方法实现了属性对偶攻击下的隐私性。这将改变节点之间的距离属性,还可能引入不希望的和误导性的假关系。本文采用节点加法的方法设计了一种名为“对联匿名化”的算法。添加新节点并将其连接到原网络中的一些节点可以避免这种属性对偶攻击,并且可以更好地保留网络属性。这种节点的增加有助于减少虚假关系的误导,同时也保持了社交网络的效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sustainability and Fog Computing: Applications, Advantages and Challenges Human Gait Recognition using Deep Convolutional Neural Network A Systematic analysis of Data-intensive MOOCs and their key Challenges Forensic Based Cloud Computing Architecture – Exploration and Implementation SPICE Modelling of CNTFET based Neuron Architecture for Low Power and High Speed applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1