|
|
【答案】应助回帖
 商家已经主动声明此回帖可能含有宣传内容
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ...
erickcwang: 金币+200, 翻译EPI+1, ★★★很有帮助, 非常感谢！ 2015-11-05 15:11:02
定义2.5 图的d-领域攻击。假设 图Gp是 社会网络图 G的 匿名发布图，如果 攻击者 获得 与目标个体A 在 G中 相对应顶点 v的 d-领域子图信息，并且 在Gp中 获得与 目标个体A 相对应的 真实信息，则 这种推断 称为 图的d-领域攻击Definition 2.5 d-domain attack of graph. Suppose graph Gp is the anonymously released graph of social network graph G, if the attacker acquires the d-domain subgraph information of the vertex v corresponded to the target object A in graph G, and acquires the real information corresponded to target object A in graph Gp as well, such deduction is called d-domain attack of graph.
定义 2.6 顶点的（d,k）-匿名。给定一个无向图G=（V,E）, 令Gp=(Vp,Ep)为G
的匿名发布图，如果顶点v∈V,在Gp中至少存在k-1个几点u1, u2,…,uk∈Vp,使得Neighbord(v)≌Neighbord(ui)且v≠ui，其中i=1，2…k-1,则称顶点v是（d,k）-匿名的。
Definition 2.6. the（d,k）- anonymity of the vertex. Providing there is a undirected graph G=（V,E）, order Gp=(Vp,Ep) is the anonymously released graph of G, if the vertex v∈V, there are at least k-1 points (u1, u2,…,uk∈Vp) in Gp, which makes Neighbord(v)≌Neighbord(ui), (v≠ui wherein, i=1，2…k-1), thus, it can call the vertex is of （d,k）- anonymity.
定义2.7 图的（d,k）-匿名。给定一个无向图G=（V,E），令Gp=(Vp,Ep)为G
的匿名发布图，如果G中每个顶点都满足（d,k）-匿名， 则称Gp是（d,k）-匿名的。
Definition 2.7. the（d,k）- anonymity of graph. Providing there is a undirected graph G=（V,E）, order Gp=(Vp,Ep) is the anonymously released graph of G, if all vertexes in G meet （d,k）- anonymity, then it can call Gp is of （d,k）- anonymity.
定义 2.8 抗领域攻击的（d,k）-匿名问题。 给定一个无向图G=（V,E），令Gp=(Vp,Ep)为G
的匿名发布图，对于给定的领域参数d和参数系统k, 抗领域攻击的（d,k）-匿名问题要求Ｇｐ满足：（１）Ｇｐ是（d,k）-匿名的； （２）从G到Gp匿名过程产生的匿名成本cost（G, Gp）是最小的。
Definition 2.8 the（d,k）- anonymity of anti-domain attack. Providing there is a undirected graph G=（V,E）, order Gp=(Vp,Ep) is the anonymously released graph of G. Regarding the given domain parameter d and parameter system k, the（d,k）- anonymity of anti-domain attack propose two requirements on Gp: (1 ) Gp is of （d,k）- anonymity; (2) The cost of anonymous process from G to Gp cost（G, Gp）is the minimum. |
|
回复此楼