| 研究生: |
林禹妡 Lin, Yu-Hsin |
|---|---|
| 論文名稱: |
雲端環境中運用多項式函式提供隱私保護多關鍵字排序搜尋機制 A Secure Ranked Multi-Keyword Fuzzy Search over Encrypted Data with Polynomial Function in Cloud Computing |
| 指導教授: |
李忠憲
Li, Jung-Shian |
| 學位類別: |
碩士 Master |
| 系所名稱: |
電機資訊學院 - 電腦與通信工程研究所 Institute of Computer & Communication Engineering |
| 論文出版年: | 2016 |
| 畢業學年度: | 104 |
| 語文別: | 英文 |
| 論文頁數: | 42 |
| 中文關鍵詞: | 雲端運算 、模糊搜尋 、加密搜尋 、多關鍵字搜尋 、排名搜尋 |
| 外文關鍵詞: | Cloud computing, Fuzzy search, Searchable encryption, Multi-keyword search, Ranked search |
| 相關次數: | 點閱:56 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
近年來,使用雲端計算在資訊領域中已經成為一個熱門的趨勢。將資料放在雲端上,可以減緩其儲存負載,減少在硬體及軟體上需要花費。基於以上優點,用戶開始將資料上傳到雲端環境中做存放,許多敏感的資訊開始被蒐集到雲端上。由於使用者無法全然的信任雲端伺服器,為了確保資料的安全性,在資料託付給雲端之前,使用者會先將資料做加密的動作,讓雲端伺服器無法輕易地得知資料內容。隨著資料量日益龐大的關係,如何替已加密的文件找到有效的關鍵字搜尋方法變成了一個重要的議題。目前大多數的加密搜尋僅支援正確並完整的關鍵字搜尋,若是使用者鍵入錯誤的字,像是與欲查詢關鍵字格式不一致或是僅輕微的輸入錯誤都無法找到正確的答案,而輸入錯誤的字在現實中是非常容易發生的。本研究將原本僅支援的精確匹配搜尋的多項式函數加密方法結合有效率的模糊關鍵字集,讓原始系統能夠實現在雲端儲存環境中密文模糊搜尋的功能。
In recent years, cloud computing is a trend in the networking industry. Storing the data in the cloud can alleviate the storage overhead and reduce the expense of both hardware and software. Based on these advantages, users start to outsource their data to the cloud. Therefore, amounts of the sensitive information is collected by the cloud. Because users cannot trust the cloud server completely, users encrypt the data before sending it to the cloud, so as to ensure the security of the data. With the growth of the dataset, finding an efficient keyword search method becomes an important issue now. Most of the keyword search approaches only support the exact keyword search. It is unpractical to implement in reality. Our research integrates multi-keyword search constructed by polynomial functions with the fuzzy set, in order to make the system have the capacity to search the fuzzy word.
[1] Song, D., Wagner, D., & Perrig, A., “Practical Techniques for Searches on Encrypted Data”, in Proceedings of the 2000 IEEE Symposium on Security and Privacy, pp. 44 -55, Berkeley, California, USA, 2000.
[2] Goh, E., “Secure Indexes”, Cryptology ePrint Archive, http://eprint.iacr.org/2003/216, 2003.
[3] Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R., “Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions”, Journal of Computer Security, Vol. 19, No. 5, pp. 895-934, 2011.
[4] Boneh, D., Crescenzo, G., Ostrovsky, R., & Persiano, G., “Public Key Encryption with Keyword Search”, in Proceedings of EUROCRYPT, Vol.3027, pp. 506-522, Interlaken, Switzerland, 2004.
[5] Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W., “Fuzzy Keyword Search over Encrypted Data in Cloud Computing”, in Proceedings of IEEE INFOCOM 2010, mini-conference, pp. 1-5, San Diego, CA, USA, 2010.
[6] Levenshtein, V., “Binary Codes Capable of Correcting Spurious Insertions and Deletions of Ones”, Problems of Information Transmission, Vol.1, p. 8-17. 1965.
[7] Ji, S., Li, G., Li, C., & Feng, J., “Efficient Interactive Fuzzy Keyword Search”, in Proceedings of WWW’09, pp. 371-380, New York, USA, 2009.
[8] Chaudhuri, S., Ganti, V., & Motwani, R., “Robust Identification of Fuzzy Duplicates”, in Proceedings of ICDE’05, pp. 865-876, Washington, DC, USA, 2005.
[9] Arasu, A., Ganti, V., & Kaushik, R., “Efficient Exact Set-Similarity Joins”, in Proceedings of VLDB’06, pp. 918-929, Seoul, Korea, 2006.
[10] Chakrabarti, K., Chaudhuri, S., Ganti, V., & Xin, D., “An Efficient Filter for Approximate Membership Checking”, in Proceedings of SIGMOD’08, pp. 805-818, Vancouver, Canada, 2008.
[11] Hwang, Y., & Lee, P., “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, in Proceedings of International Conference on Pairing-Based Cryptography, Vol. 4575, pp. 2-22, Tokyo, Japan , 2007.
[12] Golle, P., Staddon, J., & Waters, B., “Secure Conjunctive Keyword Search over Encrypted Data”, in Proceedings of 2nd International Conference on Applied Cryptography and Network Security, Vol. 3089, pp. 31-45, Yellow Mountain, China, 2004.
[13] Hou, S., & Uehara, T., Yiu, S., Lucas, C., & Chow, K., “Privacy Preserving Confidential Forensic Investigation for Shared or Remote Servers”, in Proceedings of IIH-MSP, pp. 378-383, Dalian, China, 2011.
[14] Boneh, D., & Waters, B., “Conjunctive, Subset, and Range Queries on Encrypted Data”, in Proceedings of TCC'07, Vol. 4392, pp. 535-554, Amsterdam, The Netherlands, 2007.
[15] Cao, N., Wang, C., Li, M., Ren, K., & Lou, W., “Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data”, in Proceedings of IEEE INFOCOM, pp. 829-837, 2011.
[16] Cao, N., Wang, C., Li, M., Ren, K., & Lou, W., “Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data”, IEEE Transactions on Parallel and Distributed Systems, Vol. 25, Iss. 1, pp. 222-233, 2014.
[17] Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y., & Li, H., “Privacy-preserving Multi-keyword Text Search in the Cloud Supporting Similarity-based Ranking”, in Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, pp. 71-82, Hangzhou, China, 2013.
[18] Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y., & Li, H., “Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking”, IEEE Transactions on Parallel and Distributed Systems, Vol. 25, Iss. 11, pp. 3025-3035, 2014.
[19] Wang, B., Hou, Y., Li, M., Wang, H., & Li, H., “Maple: Scalable multi-dimensional range search over encrypted cloud data with tree-based index”, in Proceedings of ACM ASIACCS, pp. 111-122, Kyoto, Japan, 2014.
[20] Ren, Y., Chen, Y., Yang, J., & Xie, B., “Privacy-preserving Ranked Multi-Keyword Search Leveraging Polynomial Function in Cloud Computing”, in Proceedings of IEEE GLOBECOM, pp. 594 - 600, Austin, Texas, USA, 2014.
[21] Yu, S., Wang, C., Ren, K., & Lou, W., “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing”, in Proceedings of INFOCOM, San Diego, CA , USA, pp. 534-542, 2010.
[22] Wang, C., Wang, Q., Ren, K., & Lou, W., “Privacy-preserving public auditing for data storage security in cloud computing”, in Proceedings of INFOCOM, San Diego, CA , USA, pp. 525-533, 2010.
[23] Wong, W., Cheung, D., Kao, B., & Mamoulis, N., “Secure knn computation on encrypted databases”, in Proceedings of the ACM SIGMOD International Conference on Management of data, pp. 139-152, Providence, USA, 2009.
校內:2021-08-24公開