國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

社會網絡最短路徑度數隱私保護之探討 = Degree Anonymiza...

國立高雄大學資訊管理學系碩士班

社會網絡最短路徑度數隱私保護之探討 = Degree Anonymization of Shortest Path Privacy on Social Networks

紀錄類型:	書目-語言資料,印刷品 : 單行本
並列題名:	Degree Anonymization of Shortest Path Privacy on Social Networks
作者:	施慶銓,
其他團體作者:	國立高雄大學
出版地:	[高雄市]
出版者:	撰者;
出版年:	2013[民102]
面頁冊數:	61面圖，表格 : 30公分;
標題:	(k1 k2)最短路徑隱私保護
標題:	edge weights
電子資源:	http://handle.ncl.edu.tw/11296/ndltd/62133641311144240670
附註:	參考書目：面53-54
附註:	102年10月31日公開
摘要註:	過去許多的社會網絡隱私保護研究，主要著重於無權重的圖形上，而具權重的圖形上所包含的重要資訊反而被忽略，尤其在權重圖中的最短路徑，往往代表著個人或商業間最敏感、最重要的資訊。在過去的最短路徑隱私保護方法中，Wang et al.(2011)提出以擾動權重的方式來保護最短路徑隱私，但當攻擊者利用節點分支度數的背景知識，仍有辦法辨識出真正的最短路徑。故本研究將針對具權重的網絡圖形，提出一個新的最短路徑隱私保護方法(k1, k2) – anonymous shortest path privacy，其目的是當圖形上的一對起、終點包含了k1條最短路徑時，則在此k1條路徑上的任意一節點，必存在其他k2-1個節點具有同樣的分支度數，以防止攻擊者利用分支度數的背景知識來辨識出真實的最短路徑。本研究將提出三種不同的節點分群方法及兩種加邊方法來達成節點分支度數的隱匿，並從實驗數據中，分析各種分群與加邊的配對組合，讓圖形隱匿的成本與圖形修改程度降到最低。 Preserving privacy in social networking environment has been studied extensively in recent years. Although more works have adopted un-weighted graphs to model network relationships, weighted graph modeling can provide deeper analysis of the degree of relationships. Previous works on weighted graph privacy have concentrated on preserving the shortest path characteristic between pairs of vertices. Two common types of privacy have been proposed. One type of privacy tried to add random noise edge weights to the graph but still maintain the same shortest path. The other privacy, k–anonymous path privacy, minimally perturbed edge weights so that there exist k shortest paths. However, the k-shortest path privacy did not consider degree attacks on the nodes of anonymized shortest paths. In this work, we present a new concept called (k1, k2)-shortest path privacy to prevent such privacy breach. A published network graph with (k1, k2)-shortest path privacy has at least k1 indistinguishable shortest paths between the source and destination vertices. In addition, for the non-overlapping vertices on the k1 shortest paths, there exits k2 vertices with the same node degree and lie on more than one shortest path. Three heuristic algorithms and two edge insertion techniques are proposed. The weight determination technique is also proposed to effectively achieve the proposed privacy. Numerical comparisons based on four evaluative criterions showing the pros and cons of each technique are presented.

社會網絡最短路徑度數隱私保護之探討 = Degree Anonymization of Shortest Path Privacy on Social Networks
施, 慶銓

社會網絡最短路徑度數隱私保護之探討 = Degree Anonymization of Shortest Path Privacy on Social Networks / 施慶銓撰 - [高雄市] : 撰者, 2013[民102]. - 61面 ; 圖，表格 ; 30公分.
參考書目：面53-54102年10月31日公開.
(k1 k2)最短路徑隱私保護edge weights

社會網絡最短路徑度數隱私保護之探討 = Degree Anonymization of Shortest Path Privacy on Social Networks
LDR:03851nam0a2200289 450 001 389701
005 20170214094019.0
009 389701
010 0 $b 精裝
010 0 $b 平裝
100 $a 20170214d2013 k y0chiy05 e
101 1 $a chi $d chi $d eng
102 $a tw
105 $a ak am 000yy
200 1 $a 社會網絡最短路徑度數隱私保護之探討 $d Degree Anonymization of Shortest Path Privacy on Social Networks $z eng $f 施慶銓撰
210 $a [高雄市] $c 撰者 $d 2013[民102]
215 0 $a 61面 $c 圖，表格 $d 30公分
300 $a 參考書目：面53-54
300 $a 102年10月31日公開
314 $a 指導教授：王學亮
328 $a 碩士論文--國立高雄大學資訊管理學系碩士班
330 $a 過去許多的社會網絡隱私保護研究，主要著重於無權重的圖形上，而具權重的圖形上所包含的重要資訊反而被忽略，尤其在權重圖中的最短路徑，往往代表著個人或商業間最敏感、最重要的資訊。在過去的最短路徑隱私保護方法中，Wang et al.(2011)提出以擾動權重的方式來保護最短路徑隱私，但當攻擊者利用節點分支度數的背景知識，仍有辦法辨識出真正的最短路徑。故本研究將針對具權重的網絡圖形，提出一個新的最短路徑隱私保護方法(k1, k2) – anonymous shortest path privacy，其目的是當圖形上的一對起、終點包含了k1條最短路徑時，則在此k1條路徑上的任意一節點，必存在其他k2-1個節點具有同樣的分支度數，以防止攻擊者利用分支度數的背景知識來辨識出真實的最短路徑。本研究將提出三種不同的節點分群方法及兩種加邊方法來達成節點分支度數的隱匿，並從實驗數據中，分析各種分群與加邊的配對組合，讓圖形隱匿的成本與圖形修改程度降到最低。 Preserving privacy in social networking environment has been studied extensively in recent years. Although more works have adopted un-weighted graphs to model network relationships, weighted graph modeling can provide deeper analysis of the degree of relationships. Previous works on weighted graph privacy have concentrated on preserving the shortest path characteristic between pairs of vertices. Two common types of privacy have been proposed. One type of privacy tried to add random noise edge weights to the graph but still maintain the same shortest path. The other privacy, k–anonymous path privacy, minimally perturbed edge weights so that there exist k shortest paths. However, the k-shortest path privacy did not consider degree attacks on the nodes of anonymized shortest paths. In this work, we present a new concept called (k1, k2)-shortest path privacy to prevent such privacy breach. A published network graph with (k1, k2)-shortest path privacy has at least k1 indistinguishable shortest paths between the source and destination vertices. In addition, for the non-overlapping vertices on the k1 shortest paths, there exits k2 vertices with the same node degree and lie on more than one shortest path. Three heuristic algorithms and two edge insertion techniques are proposed. The weight determination technique is also proposed to effectively achieve the proposed privacy. Numerical comparisons based on four evaluative criterions showing the pros and cons of each technique are presented.
510 1 $a Degree Anonymization of Shortest Path Privacy on Social Networks $z eng
610 0 $a (k1 k2)最短路徑隱私保護 $a 社會網絡 $a 隱私保護 $a 權重 $a 最短路徑之k隱匿
610 1 $a edge weights $a (k1 k2)-shortest path privacy $a k-shortest path privacy $a privacy preserving $a social networks
681 $a 008M/0019 $b 464105 0808 $v 2007年版
700 1 $a 施 $b 慶銓 $4 撰 $3 614561
712 0 2 $a 國立高雄大學 $b 資訊管理學系碩士班 $3 353936
801 0 $a tw $b NUK $c 20130925 $g CCR
856 7 $z 電子資源 $2 http $u http://handle.ncl.edu.tw/11296/ndltd/62133641311144240670