Please use this identifier to cite or link to this item:
標題: 多關鍵字可搜尋公開金鑰加密法之效能改善
Improving the Efficiency of Public Key Conjunctive Keyword Searchable Encryption
作者: 陳昱圻
Chen, Yu-Chi
關鍵字: searchable encryption
conjunctive keywords search
出版社: 資訊科學與工程學系所
引用: [1] 陳昱圻, 洪國寶, 多關鍵字可搜尋加密法, 全國資安會議, 2009. [2] G. Amanatidis, A. Boldyreva, and A. O''Neill, New security models and provably-secure schemes for basic query support in outsourced databases, Working Conference on Data and Applications Security, (DBSec ''07), 2007. [3] S. Artzi, A. Kiezun, C. Newport and D. Schultz, Encrypted Keyword Search in a Distributed Storage System. MIT CSAIL Tech Report MIT-CSAIL-TR-2006-010, 2006. [4] J. Baek, R. Safavi-Naini, and W. Susilo, A Public key encryption with keyword search revisited, Cryptology ePrint Archive, 2005. [5] J. Baek, R. Safavi-Naini, and W. Susilo, Certificateless Public Key Encryption without Pairing, Information Security: 8th International Conference, ISC 2005, LNCS 3650, pp.134-148, 2005. [6] L.Ballad, S.Kamara, and F.Monrose, Achieving Efficient Conjunctive Keyword Searches over Encrypted Data, ICICS 2005, LNCS 3783, pp.414- 426, 2005. [7] M. Bellare, A. Boldyreva and A. O''Neill, Deterministic and Efficiently Searchable Encryption, Advances in Cryptology - CRYPTO 2007, pp.535-552, 2007. [8] D. Boneh, The decision Diffie-Hellman problem, Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag,, pp.48-63 IEEE, 1998. [9] D. Boneh, G.D. Crescenzo, R. Ostrovsky and G. Persiano, Public Key Encryption with Keyword Search, Advances in Cryptology - Eurocrypt 2004, LNCS 3027, Springer-Verlag, pp.506-522, 2004. [10] D. Boneh and M. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of CRYPTO 2001, LNCS 2139, Springer-Verlag, pp.213-229, 2001. [11] R. Brinkman, L. Feng, J. M. Doumen, P. H. Hartel, and W. Jonker, Efficient tree search in encrypted data, Technical Report TR-CTIT-04-15, Mar 2004. [12] R. Brinkman, B. Schoenmakers, J.M. Doumen, and W. Jonker, Experiments with Queries over Encrypted Data Using Secret Sharing, Secure Data Management (SDM), pp.33-46, 2005. [13] J. Byun, D. Lee, and J. Lim, E±cient Conjunctive Keyword Search on Encrypted Data Storage System, Proceedings of EuroPKI 2006, LNCS 4043, Springer-Verlag, pp. 184-196, 2006. [14] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2th ed., MIT Press and McGraw-Hill, pp.221-252, 2001. [15] R. Curtmola, J. Garay, S. Kamara and R. Ostrovsky, Searchable symmetric encryption: improved deffinitions and efficient constructions, Proceedings of ACM conference on Computer and communications security, pp.79-88 ACM CCS 2006. [16] E.J. Goh, Secure Indexes, The Cryptology ePrint Archive, Report 2003/216, Mar 16, 2004. [17] P. Golle, J. Staddon, and B. Waters, Secure Conjunctive Keyword Search over Encrypted Data, Proceedings of Applied Cryptography and Network Security Conference, LNCS 3089, Springer-Verlag, pp.31-45, 2004. [18] I.R. Jeong and J.O. Kwon, Analysis of Some Keyword Search Schemes in Encrypted Data, IEEE Communications Letters, Vol. 12, No. 3, March 2008. [19] I. Jeong , J. Kwon, D. Hong, and D. Lee, Constructing PEKS schemes against keyword guessing attacks is possible? Computer Communications 32, pp394-396, 2009 [20] L.T.A. Joseph, A. Samsudin, and B. Belaton, Efficient Search on Encrypted Data, Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication, pp.6, Nov 2005. [21] N. Koblitz, Elliptic Curve Cryptosystems, Mathematics of Computation, No.48, pp. 203-209, 1987. [22] P. Lee, Searchable Keyword-Based Encryption, The Cryptology ePrint Archive, Report 2005/367, Oct 19, 2005. [23] C. Liu, G. Horng and T. Chen, Further refinement of pairing computation based on Miller''s algorithm, Applied Mathematics and Computation, Vol. 189, Issue 1, pp. 95-409, 2007. [24] V.S. Miller, Use of Elliptic Curve in Cryptography, Advances in Cryptology-Proceedings of Crypto''87, Springer-Verlag LNCS 218, pp. 417-426, 1986. [25] MIRACL, Multiprecision Integer and Rational Arithmetic C/C++ Library, [26] D.J. Park, K. Kim, and P.J. Lee, Public key encryption with conjunctive field keyword search, Proc. WISA 2004, pp. 73-86, Springer-Verlag, 2004. [27] H.S. Rhee, W. Susilo, and H.J. Kim, Secure searchable public key encryption scheme against keyword guessing attacks, IEICE Electron. Express, Vol. 6, No.5, pp.237-243, 2009. [28] E. K. Ryu and T. Takagi, E±cient Conjunctive Keyword-Searchable Encryption, Advanced Information Networking and Applications Workshops, pp. 409-414, 2007. [29] D. Song, D. Wagner and A. Perrig, Practical Techniques for Searches on Encrpted Data, Proceedings of 2000 IEEE Symposium on Security and Privacy, IEEE Press, pp.44-55, 2000. [30] W. Stallings, Cryptography and Network Security: Principles and Practices, Prentice Hall, Fourth Edition, 2007. [31] B. Waters, D. Balfanz, G. Durfee, and D. Smetters, Building an Encrypted and Searchable Audit Log, Proceedings of 2004 Network and Distributed System Security Symposium, 2004. [32] A. Wiles, Modular Elliptic Curves and Fermat''s Last Theorem, Annals of Mathematics 141, pp. 443-551, 1995.
摘要: 在現在資訊發達的時代裡,保護個人資料的隱私也益形重要。我們希望能夠將機密性資料,存放於開放式網路環境的伺服器端,而不被資料儲存的伺服器甚至攻擊者獲知存放訊息之內容,且資料擁有者又能隨心所欲的對資料進行存取,甚至修改。最早由Boneh等人提出公開金鑰加密關鍵字可搜尋加密法。主要利用pairing設計的機制,讓送方可以用收方的公鑰對文件內關鍵字進行可搜尋加密法並加密送出文件。收方可以藉由私鑰產生搜尋關鍵字的暗門;伺服器針對暗門以及可搜尋密文進行比對,若成功則回傳文件給收方。而後Park等學者提出了在公開金鑰系統下能支援多個關鍵字搜尋的架構,但在通訊成本與計算量上仍有改進之處。我們在這篇論文中提出以多個關鍵字的搜尋架構來達到搜尋加密文件上的訴求,且能用於不安全的通訊上。同時我們的架構比起之前的研究在效率上有了改善,而在儲存上也有較低的成本。此外,我們的機制在random oracle model下對adaptive chosen keyword attack,其安全性等價於decision Diffie-Hellman assumption。
Protecting personal private information is very important. We want that the private information in the open network server can be accessed from anywhere, at anytime. Furthermore, the server or attackers cannot obtain any significant information. In 2004, Boneh et al. proposed public key encryption keyword search (PEKS) schemes. Park et al. proposed another PEKS with conjunctive keyword search. They are not efficient and require secure channel. In this thesis, we propose a more efficient conjunctive keywords public key searchable encryption scheme. The proposed construction is semantically security against adaptive chosen keyword attacks based on decision Diffie-Hellman Problem.
其他識別: U0005-1307200914393800
Appears in Collections:資訊科學與工程學系所



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