|
|
【答案】應助回帖
商家已經(jīng)主動聲明此回帖可能含有宣傳內(nèi)容
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ... erickcwang: 金幣+200, 翻譯EPI+1, ★★★很有幫助, 非常感謝! 2015-11-05 15:11:02
定義2.5 圖的d-領域攻擊。假設 圖Gp是 社會網(wǎng)絡圖 G的 匿名發(fā)布圖,如果 攻擊者 獲得 與目標個體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
的匿名發(fā)布圖,如果頂點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
的匿名發(fā)布圖,如果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
的匿名發(fā)布圖,對于給定的領域參數(shù)d和參數(shù)系統(tǒng)k, 抗領域攻擊的(d,k)-匿名問題要求Gp滿足:(1)Gp是(d,k)-匿名的; (2)從G到Gp匿名過程產(chǎn)生的匿名成本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. |
|