what-when-how
In Depth Tutorials and Information
==
then
For each attribute within
h d
If any
a S o
( ( ))
a N h d
(
( (
)))
(
)
that matches in
o
j
+ =
(
o
h N
)
Else
Add new attribute from
h d
(
)
to
o
with a
o
j
=
(
h N
)
End
For any edge within
e
that matches an edge within
g
i
+ =
(
e
h N
)
Else
i
=
(
Add non-matching edges within set
g
to set
e
with
e
h N
)
End
Else
Add new node and edge set
N h d g
( (
),
)
to
S
End
Next
In Reference 19, the result of the experiment shows that the creation algorithm
converges quickly as well as achieves the validation of the data.
10.5.2 Privacy Problem 2: Network Updating Issues
Reference 19 uses a pull architecture where the centralized server periodically pulls
updates from the involved STNs. In order to save the bandwidth and the process
time, this architecture equips each subnet with an addition list and a revocation list.
10.5.2.1 Collaborative Social Network Revocation Protocol
=
1
For
N d
(
[ ... ],
n g
)
=
1
If any
a S o
R d
(
[ ... ],
n g is sent toS
)
==
then
For each attribute within
h d
( ( ))
a R h d
(
( (
)))
(
)
that matches in
o
o
j
− =
(
h R
)
If
o
j
empty then remove
o
End
