研究生: |
韓欣蓓 Han, Hsin-Pei |
---|---|
論文名稱: |
Path ORAM的改良:更嚴密的分析與雲端儲存空間優化 A variant of Path ORAM: Tighter analysis & Storage improvement |
指導教授: |
韓永楷
Hon, Wing-Kai |
口試委員: |
盧錦隆
Lu, Chin-Lung 姚兆明 Yiu, Siu-Ming |
學位類別: |
碩士 Master |
系所名稱: |
|
論文出版年: | 2018 |
畢業學年度: | 106 |
語文別: | 英文 |
論文頁數: | 25 |
中文關鍵詞: | PORAM 、改良 、分析 |
外文關鍵詞: | Oblivious, ORAM, variant |
相關次數: | 點閱:1 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在Oblivious RAM (ORAM) 系統中,我們使用的是一個可能被竊聽存取行動的雲端儲存空間,而我們必須同時達到兩個目標:在存取時不會導致資料外洩,並且即使被竊聽了資料存取的行動也不會洩漏任何訊息。Path ORAM[Stefanov et al., 2013] 是一種非常容易建立並且儲存效率很高的ORAM,而這篇論文的主要內容便是將Path ORAM 的分析作得更加緊密。此外,我們提出了在Path ORAM 應用的二元樹上讓每個節點上使用不同儲存容量,使得在不影響安全性的前提下縮小了所需的雲端空間容量。最後,我們也以實驗展示了我們的設計成果。
In an oblivious RAM (ORAM) setting, a remote untrusted server is responsible for storing user data. The major goal is to simultaneously (1) keep the data secure from eavesdroppers during read/write accesses and (2) preserve privacy about the access pattern of the data from the untrusted server. Path ORAM [Stefanov et al., 2013] is a protocol, with extremely simple construction and practical eficiency, that achieves the above goal. In this thesis, we revisit the Path ORAM and show how to improve some of the results by tighter analysis. We also propose a variant of Path ORAM that uses non-uniform bucket size, and show that the server space can be reduced while the client storage remains unchanged. Finally, we perform experiments to demonstrate the practicality of our Path ORAM variant.
E. Stefanov, M. van Dijkz, E. Shi, T.-H. H. Chan, C. Fletcher, L. Ren, X. Yu, and S. Devadas. \Path ORAM: An Extremely Simple Oblivious RAM Protocol." In IACR Cryptology ePrint Archive, 2013.
Oded Goldreich and Rafail Ostrovsky In Software protection and simulation on oblivious RAMs.