國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

社會網絡權重路徑隱匿之探討 = Study of Weighted Pa...

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

社會網絡權重路徑隱匿之探討 = Study of Weighted Path Anonymization on Social Networks

紀錄類型:	書目-語言資料,印刷品 : 單行本
並列題名:	Study of Weighted Path Anonymization on Social Networks
作者:	蔡政哲,
其他團體作者:	國立高雄大學
出版地:	[高雄市]
出版者:	撰者;
出版年:	2012[民100]
面頁冊數:	41面圖，表格 : 30公分;
標題:	社會網絡
標題:	Social Network
電子資源:	http://handle.ncl.edu.tw/11296/ndltd/03622488089931561020
附註:	參考書目：面31-33
摘要註:	近年來，許多社群應用網站紛紛崛起，如：Facebook、Twitter…等，加速了社會網絡在世界上的發展。然而，這些應用網站也可能對使用者的隱私帶來許多威脅。為了防範社會網絡中的隱私被揭露，有許多的研究探討了很多不同的方式來保護敏感的資料，像是圖形上的點的分支度、圖形結構或是權重流量等等。但是這些探討卻沒有考量到，對社會網絡應用之使用者來說，最短路徑也是一種私有的資訊。若有心的攻擊者知曉社會網絡上兩個特定節點的最短路徑，可能會因此而暴露敏感資訊，如：好友關係甚至是公司的交易資訊。本論文中，我們考量在權重網絡圖形中，隱匿權重路徑之問題。為了保護於權重圖形中兩個特定節點的最短路徑之資訊，我們提供了一個新概念：最短路徑之k隱匿（k-anonymous path privacy）。發布一個受到最短路徑之k隱匿所保護的圖形，會擁有k條無法分辨地最短路徑，使得攻擊者無法透過此圖形，輕易地找出原始節點配對之最短路徑。本研究不僅僅提供方法針對不同的隱私層級來保護最短路徑之隱私，我們的實驗結果也建議了隱私層級，使圖形保有實用性與保護性之效果。 Social network applications, such as Facebook and Twitter et al., have become very popular in recent years. However, these applications may cause certain threats to users privacy. To prevent the disclosure of privacy in social network, many researches have studied different ways to protect sensitive data, such as vertex degree, graph structure or weight flow. However, they did not consider that the shortest path is also private information for users. If adversary knew the shortest path between two specific nodes in a social network, sensitive information such as friendships between individuals and transactions between companies, will be leaked. In this work, we consider the path anonymity problem in weighted social network graphs. To protect the shortest path information between two specific nodes in a weighted graph, we propose a new concept called k-anonymous path privacy. A published social network with k-anonymous path privacy will have k indistinguishable shortest path so that adversary cannot identify the original shortest path. We propose algorithm to modify different edge weights for different privacy levels. Numerical experiments show if the levels of privacy and utilities are given.

社會網絡權重路徑隱匿之探討 = Study of Weighted Path Anonymization on Social Networks
蔡, 政哲

社會網絡權重路徑隱匿之探討 = Study of Weighted Path Anonymization on Social Networks / 蔡政哲撰 - [高雄市] : 撰者, 2012[民100]. - 41面 ; 圖，表格 ; 30公分.
參考書目：面31-33.
社會網絡Social Network

社會網絡權重路徑隱匿之探討 = Study of Weighted Path Anonymization on Social Networks
LDR:03643nam0a2200277 450 001 346201
005 20170214094020.0
009 346201
010 0 $b 精裝
010 0 $b 平裝
100 $a 20170214d2011 k y0chiy05 e
101 1 $a chi $d chi $d eng
102 $a tw
105 $a ak am 000yy
200 1 $a 社會網絡權重路徑隱匿之探討 $d Study of Weighted Path Anonymization on Social Networks $z eng $f 蔡政哲撰
210 $a [高雄市] $c 撰者 $d 2012[民100]
215 0 $a 41面 $c 圖，表格 $d 30公分
300 $a 參考書目：面31-33
314 $a 指導教授：王學亮博士
328 $a 碩士論文--國立高雄大學資訊管理學系碩士班
330 $a 近年來，許多社群應用網站紛紛崛起，如：Facebook、Twitter…等，加速了社會網絡在世界上的發展。然而，這些應用網站也可能對使用者的隱私帶來許多威脅。為了防範社會網絡中的隱私被揭露，有許多的研究探討了很多不同的方式來保護敏感的資料，像是圖形上的點的分支度、圖形結構或是權重流量等等。但是這些探討卻沒有考量到，對社會網絡應用之使用者來說，最短路徑也是一種私有的資訊。若有心的攻擊者知曉社會網絡上兩個特定節點的最短路徑，可能會因此而暴露敏感資訊，如：好友關係甚至是公司的交易資訊。本論文中，我們考量在權重網絡圖形中，隱匿權重路徑之問題。為了保護於權重圖形中兩個特定節點的最短路徑之資訊，我們提供了一個新概念：最短路徑之k隱匿（k-anonymous path privacy）。發布一個受到最短路徑之k隱匿所保護的圖形，會擁有k條無法分辨地最短路徑，使得攻擊者無法透過此圖形，輕易地找出原始節點配對之最短路徑。本研究不僅僅提供方法針對不同的隱私層級來保護最短路徑之隱私，我們的實驗結果也建議了隱私層級，使圖形保有實用性與保護性之效果。 Social network applications, such as Facebook and Twitter et al., have become very popular in recent years. However, these applications may cause certain threats to users privacy. To prevent the disclosure of privacy in social network, many researches have studied different ways to protect sensitive data, such as vertex degree, graph structure or weight flow. However, they did not consider that the shortest path is also private information for users. If adversary knew the shortest path between two specific nodes in a social network, sensitive information such as friendships between individuals and transactions between companies, will be leaked. In this work, we consider the path anonymity problem in weighted social network graphs. To protect the shortest path information between two specific nodes in a weighted graph, we propose a new concept called k-anonymous path privacy. A published social network with k-anonymous path privacy will have k indistinguishable shortest path so that adversary cannot identify the original shortest path. We propose algorithm to modify different edge weights for different privacy levels. Numerical experiments show if the levels of privacy and utilities are given.
510 1 $a Study of Weighted Path Anonymization on Social Networks $z eng
610 0 $a 社會網絡 $a 最短路徑之k隱匿 $a 權重圖形 $a 隱私保護 $a k隱匿
610 1 $a Social Network $a privacy preserving $a k-anonymous path privacy $a weighted graph $a k-anonymity
681 $a 008M/0019 $b 464105 4415 $v 2007年版
700 1 $a 蔡 $b 政哲 $4 撰 $3 81818
712 0 2 $a 國立高雄大學 $b 資訊管理學系碩士班 $3 353936
801 0 $a tw $b NUK $c 20121107 $g CCR
856 7 $z 電子資源 $2 http $u http://handle.ncl.edu.tw/11296/ndltd/03622488089931561020