English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/133264
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


An Algorithm For $k$-Degree Anonymity On Large Networks

AuthorsCasas, Jordi; Herrera, Jordi; Torra, Vicenç
KeywordsData privacy
Network theory
k-degree anonymity
Social networking
Graph theory
Issue Date25-Aug-2013
PublisherInstitute of Electrical and Electronics Engineers
CitationASONAM '13 Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 671-675
AbstractIn this paper, we consider the problem of anonymization on large networks. There are some anonymization methods for networks, but most of them can not be applied on large networks because of their complexity. We present an algorithm for k-degree anonymity on large networks. Given a network G, we construct a k-degree anonymous network, G, by the minimum number of edge modifications. We devise a simple and efficient algorithm for solving this problem on large networks. Our algorithm uses univariate micro-aggregation to anonymize the degree sequence, and then it modifies the graph structure to meet the k-degree anonymous sequence. We apply our algorithm to a different large real datasets and demonstrate their efficiency and practical utility.
Identifiersdoi: 10.1145/2492517.2492643
isbn: 978-1-4503-2240-9
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.