2015
DOI: 10.1002/sec.1306
|View full text |Cite
|
Sign up to set email alerts
|

K‐anonymity against neighborhood attacks in weighted social networks

Abstract: 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 syst… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…Li and col. (29)(30)(31) have proposed several enzymatic biosensors obtained by L-b-L selfassembling of PDDA and different enzymes on a glassy carbon (GCE) surface modified with oxidized multi-walled carbon nanotubes. In previous works we have proposed a highly successful strategy to immobilize biomolecules on GCE modified by deposition of multi-walled carbon nanotubes dispersed in different agents.…”
Section: Introductionmentioning
confidence: 99%
“…Li and col. (29)(30)(31) have proposed several enzymatic biosensors obtained by L-b-L selfassembling of PDDA and different enzymes on a glassy carbon (GCE) surface modified with oxidized multi-walled carbon nanotubes. In previous works we have proposed a highly successful strategy to immobilize biomolecules on GCE modified by deposition of multi-walled carbon nanotubes dispersed in different agents.…”
Section: Introductionmentioning
confidence: 99%
“…Neighborhood anonymization methods have been developed for anonymizing labelled neighborhoods 38 , 39 , in an attack where the attacker has also a background knowledge of the labels of the nodes part of the target’s neighborhood, besides of its structure. Additional information in links can be considered by treating the problem of neighborhood anonymization in weighted unlabelled networks, and anonymizing the network by edge additions and weight modifications 40 .…”
Section: Privacy In Social Networkmentioning
confidence: 99%
“…Liu et al [30] proposed a k-anonymous algorithm, which generates an initial weighted social network and reduces the adjustment of relation weight through the sorting process. It improves anonymity efficiency and resists against 2…”
Section: Related Workmentioning
confidence: 99%