4/2017 - 14 |
k-Degree Anonymity Model for Social Network Data PublishingMACWAN, K. R. , PATEL, S. J. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (1,454 KB) | Citation | Downloads: 745 | Views: 3,212 |
Author keywords
data privacy, data processing, publishing, social network services, utility programs
References keywords
data(8), social(7), privacy(6), networks(6), preserving(5), network(5), information(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2017-11-30
Volume 17, Issue 4, Year 2017, On page(s): 117 - 124
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2017.04014
Web of Science Accession Number: 000417674300014
SCOPUS ID: 85035757216
Abstract
Publicly accessible platform for social networking has gained special attraction because of its easy data sharing. Data generated on such social network is analyzed for various activities like marketing, social psychology, etc. This requires preservation of sensitive attributes before it becomes easily accessible. Simply removing the personal identities of the users before publishing data is not enough to maintain the privacy of the individuals. The structure of the social network data itself reveals much information regarding its users and their connections. To resolve this problem, k-degree anonymous method is adopted. It emphasizes on the modification of the graph to provide at least k number of nodes that contain the same degree. However, this approach is not efficient on a huge amount of social data and the modification of the original data fails to maintain data usefulness. In addition to this, the current anonymization approaches focus on a degree sequence-based graph model which leads to major modification of the graph topological properties. In this paper, we have proposed an improved k-degree anonymity model that retain the social network structural properties and also to provide privacy to the individuals. Utility measurement approach for community based graph model is used to verify the performance of the proposed technique. |
References | | | Cited By |
Web of Science® Times Cited: 6 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated 3 days, 23 hours ago
SCOPUS® Times Cited: 1
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
[1] Privacy-preserving big data analytics a comprehensive survey, Tran, Hong-Yen, Hu, Jiankun, Journal of Parallel and Distributed Computing, ISSN 0743-7315, Issue , 2019.
Digital Object Identifier: 10.1016/j.jpdc.2019.08.007 [CrossRef]
[2] Node Differential Privacy in Social Graph Degree Publishing, Macwan, Kamalkumar R., Patel, Sankita J., Procedia Computer Science, ISSN 1877-0509, Issue , 2018.
Digital Object Identifier: 10.1016/j.procs.2018.10.388 [CrossRef]
[3] Large-Scale Dynamic Social Network Directed Graph K-In&Out-Degree Anonymity Algorithm for Protecting Community Structure, Zhang, Xiaolin, Liu, Jiao, Li, Jian, Liu, Lixin, IEEE Access, ISSN 2169-3536, Issue , 2019.
Digital Object Identifier: 10.1109/ACCESS.2019.2933151 [CrossRef]
[4] A fast graph modification method for social network anonymization, Kiabod, Maryam, Naderi Dehkordi, Mohammad, Barekatain, Behrang, Expert Systems with Applications, ISSN 0957-4174, Issue , 2021.
Digital Object Identifier: 10.1016/j.eswa.2021.115148 [CrossRef]
[5] k-NMF Anonymization in Social Network Data Publishing, Macwan, Kamalkumar R, Patel, Sankita J, Furnell, Steven, The Computer Journal, ISSN 0010-4620, Issue 4, Volume 61, 2018.
Digital Object Identifier: 10.1093/comjnl/bxy012 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.