臺灣博碩士論文加值系統

雲端計算越來越普及，個人的私密訊息可以隨時隨地的公開存放於網路伺服器當中。如何保護個人的私密資訊以及通訊的隱密性成為重要的議題。我們希望存放於伺服器的資料是安全的，提供使用者方便地搜尋加密的資料及防止攻擊者取得重要資料。例如，在開放式的伺服器當中存入加密的資料，讓使用者透過網路取得這些加密過的資料，且確保攻擊者無法取得重要的訊息。在本文中，我們提出一個可搜尋多關鍵字的對稱式加密機制。本研究所提出的機制可以安全抵擋動態選擇關鍵字攻擊。此外，本研究所提出的方法和前人方法比較，降低通訊成本的計算量和提升時間上的效率。

In the era of cloud computing, private information in the open network server can be accessed anywhere and anytime. As a result, the protection of personal private informa-tion becomes very important. Keyword-searchable encryption has been proposed to protect private information stored in servers while allowing clients to retrieve needed information based on keyword searching. In this thesis, we propose an efficient key-word-searchable encryption scheme. The proposed scheme with conjunctive keyword search is secure against adaptive chosen keyword attacks. Moreover, comparing to pre-vious schemes, the proposed scheme has lower communication overhead and computa-tion cost.

致　謝 I
摘　要 II
ABSTRACT III
目　錄 IV
圖目錄 VII
表目錄 VIII
第一章、緒論 1
1.1　問題的描述與動機 1
1.2　問題定義 3
1.3　本論文之貢獻 4
1.4　論文結構 5
第二章、基礎知識 6
2.1對稱式加密搜尋機制 6
2.1.1系統架構 6
2.1.2 安全定義 9
2.2雙線性配對(BILINEAR PAIRING) 14
2.3困難問題的假設 15
2.3.1 Decision Diffie-Hellman Problem 15
2.3.2 Bilinear Diffie-Hellman Inversion 15
2.3.3 External Diffie-Hellman Problem 16
2.3.4 Co-external Diffie-Hellman Problem 16
2.3.5 Varied Co-external Diffie-Hellman Problem 16
第三章、相關研究 18
3.1 BALLARD等人所提出之方法 19
3.2 RYU等人所提出之方法 20
3.3 GOLLE等人所提出的方法 21
第四章、有效率的可搜尋多關鍵字之對稱加密機制 23
4.1系統MODEL 23
4.2協定架構 25
4.3安全性分析 27
第五章、分析與討論 31
第六章、結論與未來研究方向 33
參考文獻 34

[1]J. Baek, R. Safavi-Naini, andW. Susilo, “Public key encryption with key-word search revisited”, Computational Science and Its Applications 2008, LNCS 5072, pp. 1249-1259, 2008.
[2]J. Baek, R. Safavi-Naini, and W. Susilo. “Certificateless public key encryp-tion without pairing”, Information Security: 8thInternational Conference , LNCS 3650, pp. 134-148, 2005.
[3]L. Ballard, S. Kamara, and F. Monrose, “Achieving Efficient Conjunctive Keyword Searches over Encrypted Data”, ICICS 2005, LNCS 3783, pp. 414-426, 2005.
[4]D. Boneh. “The Decision Diffie-Hellman Problem”, ANTS-III, LNCS1423, pp. 48-63, 1998.
[5]D. Boneh, G.D. Crescenzo, R. Ostrovsky, G. “Persiano, Public key encryp-tion with keyword search”, Eurocrypt 2004, LNCS 3089, pp. 31-45, 2004.
[6]D. Boneh and B. Waters, “Conjunctive, subset, and range queries on en-crypted data”, proceedings of TCC''07, LNCS 4392, pp. 535-554, 2007.
[7]D. Boneh and X. Boyen, “Efficient selective-ID secure identity based en-cryption without random oracle”, EUROCRYPT 2004, LNCS 3027, pp. 223–238, Springer-Verlag, 2004.
[8]J. Byun, D. Lee, and J. Lim, “Efficient Conjunctive Keyword Search on Encrypted Data Storage System”, EuroPKI 2006, LNCS 4043, pp. 184-196, 2006.
[9]Y.C. Chen and G. Horng, “Timestamped Conjunctive Keyword-Searchable Public Key Encryption”, Fourth International Conference on Innovative Computing, Information and Control, pp. 729 -732, 2009.
[10]E.J. Goh, “Secure index”, Ryptology ePrint Archive: Report 2003/216, 2003.
[11]P. Golle, J. Staddon, B. Waters, “Secure conjunctive keyword search over encrypted data”, Proceedings of Applied Cryptography and Network Secu-rity Conference, LNCS 3089, pp. 31-45, Springer-Verlag , 2004.
[12]I.R. Jeong , J.O. Kwon, D. Hong, and D.H. Lee, “Constructing PEKS schemes against keyword guessing attacks is possible? ”, Computer Com-munications 32, pp. 394-396, 2009.
[13]D.J. Park, K. Kim, P.J. Lee, “Public key encryption with conjunctive field keyword search”, Proc. WISA 2004, LNCS 3325, , pp. 73-86, Sprin-ger-Verlag, 2004.
[14]E. K. Ryu and T. Takagi, “Efficient Conjunctive Keyword-Searchable En-cryption”, Advanced Information Networking and ApplicationsWorkshops, pp. 409-414, 2007.
[15]D. Song, D.Wagner, A. Perrige, “Practical techniques for searches on en-crypted data”, Proceedings of the IEEE Security and Privacy Symposium, pp. 44-55, 2000.
[16]Q. Tang. “Revisit the Concept of PEKS: Problems and a Possible Solution”, Technical Report TR-CTIT-08-54, Centre for Telematics and Information Technology, University of Twente, Enschede, 2008.
[17]V. Miller, “Short programs for functions on curve”, unpublished manuscript, 1986.
[18]C. Liu, G. Horng, and T. Chen, “Further refinement of pairing computation based on Miller''s algorithm”, Applied Mathematics and Computation 189, pp.395-409,2007.
[19]A. Saxena, “The BLS Scheme to Identity Based Signatures,” http://sites.google.com/site/saxenaamitabh/saxena05ibs.pdf, 2006.
[20]C. Wang, N. Cao, J, Li, K. Reb, W. Lou, “Secure Ranked Keyword Search over Encrypted Cloud Data”, 2010 International Conference on Distri-buted Computing Systems, pp.253-262, 2010.
[21]丁培毅，溫玎蕙，張書瑋， “支援關鍵字搜尋的身分識別廣播加密方法”, 第二十一屆資訊安全會議，2011。