雲端環境中利用k-isomorphism保護圖形結構隱私的技術之研究

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Thesis > Item 987654321/102546

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/102546

Title:	雲端環境中利用k-isomorphism保護圖形結構隱私的技術之研究
Other Titles:	The study of privacy preserving graph structure in cloud by using K-isomorphism
Authors:	吳政軒;Wu, Cheng-Hsuan
Contributors:	淡江大學資訊工程學系碩士班黃仁俊
Keywords:	圖形;雲端計算;隱私保護;k-isomorphism;graph;Cloud Computing;Privacy Preserving
Date:	2014
Issue Date:	2015-05-04 09:58:32 (UTC+8)
Abstract:	日益成長的雲端技術使得雲端應用愈趨成熟，圖形是目前許多資訊處理與應用極為重要並倚賴的資料結構，因此使用者與企業在運用雲端之同時極有可能須將圖形的結構資料寄存至雲端，除善用其儲存系統儲存大量圖形資料，並借重其計算能力做有效率的處理，但圖形內含有許多重要且敏感的資訊，因此在上傳圖形結構前必須轉換成能夠隱藏資訊的外儲圖(outsource graph)以確保使用者的隱私。本論文提出方法將圖形轉換成k-isomorphism圖，該演算法酌量加入虛擬假節點(dummy vertex)與虛擬假邊(dummy edge)以及多個不同面向的策略挑選出k個互相同構的子圖，藉以將原始圖轉換成外儲圖；外儲圖即為寄存至雲端的實際圖形；雲端供應商雖可在此外儲圖上協助使用者進行各項運算與應用，但卻與第三者一樣無法了解或還原使用者的原始圖，達到保護圖形隱私之目的，本論文方法滿足k-security安全性，亦可以有效抵擋neighborhood attack、node identifier attack、structural attack與reconstruction attack。 The growing popularity of cloud technology makes the application of cloud become maturer. When data structure of graph becomes more important for processing data and application, user and companies always store structure of graph in cloud. They use data structure of graph by cloud’s large storage and efficient computation in cloud. But graphs have many important and sensitive information, those must transform to outsource graph for anonymity and ensure user’s privacy. This thesis designs an algorithm to add dummy vertices and dummy edges in the right time, and use some different strategies to select k subgraphs which are isomorphic to each other. The proposed algorithm transforms origin graphs to k-isomorphism graphs which are outsource graphs. Users store those outsource graphs in cloud. The suppliers of cloud provide some service to the user based on those outsource graphs, but the suppliers can’t know the connection of any two nodes in users’ original graphs. The graphs’ privacy is protected. The proposed algorithm satisfy k-security, and also resist neighborhood attack, node identifier attack, structural attack and reconstruction attack.
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	118	View/Open

Loading...