A Personalized -Anonymity Model of Social Network for Protecting Privacy

Algorithm 1

Personalized -anonymity algorithm.

Inputs:

Initial anonymous graph G = (V, E),

Sensitivity parameters: k’(k’ ≥2); l(2 ≤ l ≤ k’); m(l ≤ m ≤ |V|);

Node attributes table: AS = {v_i^S,v_i^N(1),…,v_i^N(s),v_i^C(1),…,v_i^C(t)};

Edge attributes table: AS = {v_j^S,v_j^N(1),…,v_j^N(s),v_j^C(1),…,v_j^C(t)};

All the classified attribute inheritance tree H_C

Input parameters α =0 and β

Outputs:

Anonymous graph Gp = {g₁, g₂, …, g_e};

The whole VCS, ECS and their attribute information;

Steps:

1 anonymous graph Gp, groups VCS and ECS are caught;

2 read α to judge the generalizing type;

3 got the group number:N_VCS = |N_VP|/k, N_ECS = |N_EP|/k;

4 fori =1 to N_VCSdo//QI attributes generalization

5 forj =1 to sdo//numeric type attributes generalization

6  gen(VCS_i)[N_j] = [min{v₁^N(j), …,v_k^N(j)},max{v₁^N(j), …,v_k^N(j)}]

7  end for

8  forj =1 to tdo//t type QI attributes generalization

9   gen(VCS_i)[C_j] = {v₁^C(j),…,v_k^C(j)}

10  end for

11  whiledo

12   if(sensitive attributes are classified) then

13    forj =0 to kdo

14     v_j^C is replaced by its parents node in classified inheritance tree of sensitive attribute

15     ifthen jump while loop

16    end for

17   Else

18    forj =1 to kdo

19     the interval of v_j^N is changed to its neighborhood;

20     ifthen jump while loop

21    end for

22   end if

23  end while

24 end for

25 fori =1 to N_ECSdo

26  forj =1 to pdo

27  gen(ECS_i)[N_j] = [min{v₁^N(j),…,v_k^N(j)},max{v₁^N(j), …,v_k^N(j)}]

28  end for

29  forj =1 to qdo

30   gen(ECS_i)[C_j] = {e₁^C(j),…,e_k^C(j)}

31  end for

32  whiledo

33   if(sensitive attributes are classified) then

34    forj =1 to kdo

35     v_j^C is replaced by its parents node in classified inheritance tree of sensitive attribute

36     ifthen jump while loop

37    end for

38   Else

39    forj =1 to kdo

40     the interval of n_j^N is changed to its neighborhood;

41     ifthen jump while loop

42    end for

43   end if

44  end while

45 end for

46 anonymous graph G_p is published; all the VCS nodes, ECS edges and their attribute information are published