Please use this identifier to cite or link to this item:
標題: 有效率的可搜尋多關鍵字之對稱加密法
Efficient Conjunctive Keyword-Based Symmetric Searchable Encryption
作者: 張儷子
Chang, Li-Tzu
關鍵字: 對稱式加密、可搜尋加密、多關鍵字搜尋、暗門(Trapdoor)
出版社: 資訊科學與工程學系所
引用: [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,”, 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。

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.
Appears in Collections:資訊科學與工程學系所

Show full item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.