Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19520
標題: 基於位元映射之有效率可搜尋多個加密文件的索引架構
An Efficient Searchable Encryption Index for Multiple Documents Based on Bit Map
作者: 徐憲驊
Hsu, Hsien-Hua
關鍵字: searchable symmetric encryption;對稱式搜尋加密;trapdoor;pseudo-random permutation;pseudo-random function;index;後門;擬亂隨機排列;擬亂隨機函數;索引
出版社: 資訊科學與工程學系所
引用: [1] D. Song, D. Wagner and A. Perrig, “Practical Techniques for Searches on Encrpted Data,” In Advances in Cryptology - EUROCRYPT 2004, pp.506-522, May 2000. [2] E-J. Goh, “Secure Indexes,” In The Cryptology ePrint Archive, Report 2003/216, Mar 16, 2004. [3] S.M. Bellovin and W.R. Cheswick. Privacy-enhanced searches using encrypted Bloom filters. ” Technical Report 2004/022, IACR ePrint Cryptography Archive, 2004. [4] Y. C. Chang and M. Mitzenmacher, “Privacy preserving keyword seaches on remote encrypted data. In Applied Cryptography and Network Security Conference (ACNS), 2005. [5] Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. “Searchable symmetric encryption: Improved definitions and efficient constructions. ” In Proceedings of the 13st ACM Conference on Computer and Communications Security (CCS), 2006. [6] P. Golle, J. Staddon, and B. Waters. “Secure conjunctive keyword search over encrypted data. In M. Jakobsson, ”M. Yung, and J. Zhou, editors, Applied Cryptography and Network Security Conference (ACNS), volume 3089 of LNCS, pages 31-45. Springer-Verlag, 2004. [7] D.J. Park, K. Kim, and P.J. Lee. “ Public key encryption with conjunctive field keyword search. ” In 5th International Workshop WISA 2004, volume 3325 of LNCS, pages 73-86. Springer, 2004. [8] L. Ballard, S. Kamara, and F. Monrose. “Achieving efficient conjunctive keyword searches over encrypted data. ” In Proceedings of the Seventh International Conference on Information and Communication Security (ICICS 2005), pages 414-426, 2005. [9] D. Boneh, G. di Crescenzo, R. Ostrovsky, and G. Persiano. “ Public key encryption with keyword search. ” In Proc. EUROCRYPT 04, pages 506-522, 2004. [10] D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. Skeith. “ Public-key encryption that allows PIR queries. ”Unpublished Manuscript, August 2006. [11] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. M. Lee, G. Neven, P. Paillier,and H. Shi. “ Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. ”In CRYPTO 2005, volume 3621 of LNCS, pages 205-222. Springer, 2005. [12] B. H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors,” In Communications of the ACM, pp.422-426, July 1970. [13] Joan Daemen and Vincent Rijmen, AES Proposal: Rijndael, AES algorithm Submission, September 3, 1999 [14] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” In Cryptology ePrint Archive, 2005.
摘要: 
可搜尋對稱式加密(Searchable Symmetric Encryption)為使用者(Client)端把自己的文件加密後上傳到伺服器(Server)端,當使用者需要某些文件時,提供一些關鍵字(Keywords)給伺服器端,由伺服器端來做搜尋,最後回傳結果回使用者端。
近年來有非常多關於搜尋加密的研究及安全定義被提出來,本文提出一種可以達成空間節省並且維持安全性的方法,此方法主要包含索引架構,搜尋時間為O(1)。

When an end user wants to search his own document which is encrypted and stored in the server, he just needs to send some keyword so that the server can return the results to the end user after searching process. We call such procedure as Searchable Symmetric Encryption.
In the recent years, many searchable encryption scheme and security mechanism has been proposed. In this thesis, we proposed an efficient scheme with the search time is O(1) and using an index structure. Base on the idea we can also reduce server's storage and keep the security property.
URI: http://hdl.handle.net/11455/19520
其他識別: U0005-1007200816112800
Appears in Collections:資訊科學與工程學系所

Show full item record
 

Google ScholarTM

Check


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