Please use this identifier to cite or link to this item:
標題: 運用雜湊函數改善Song等人之加密文件搜尋後使用者解密的效率
Using Hash Function to Improve Song''s Searchable Encryption Scheme
作者: 紀銘偉
Chi, Ming-Wei
關鍵字: semantically secure
false positive rate
stream cipher
hash function
encrypted data search
出版社: 資訊科學與工程學系所
引用: [1] D. Song, D. Wagner, and A. perrig, Practical Techniques for Searches on Encrypted Data, in Proc. of the 2000 IEEE symposiumon Security and Privacy(S&P2000). [2] S. Artzi, A. Kiezun, C. Newport, D. Schultz, Encrypted Keyword Search in a Distributed Storage System, in DSpace at MIT, 2006. [3] M. Naor, M. Yung, Universal One-Way Hash Functions and their Cryptographic Applications, in Proc. of the twenty-first annual ACM symposium on Theory of computing, 1989. [4] Bob. Jenkins, Hash Functions, Algorithm Alley, Dr. Dobb's Journal, 1997. [5] Matt J. B. Robshaw, Stream Ciphers Technical Report TR701, version 2.0, RSA Laboratories, 1995. [6] Eu-JinGoh,Secure Indexes,Technical Report2003/216,IACR ePrint Cryptography Archive, 2003. [7] D. Boneh, G. di Crescenzo, R.Ostrovsky, and G. Persiano, Publickey encryption withkeyword search,inProc. Eurocrypt 04, pages 506-522, 2004. [8] Y. C. Chang and M. Mitzenmacher, Privacy preserving keyword searches on remote encrypted data, in Applied Cryptography andNetwork Security Conference (ACNS),2005. [9] B.Bloom, Space/time trade-odds in hash coding with allowable errors, in Communications of the ACM, 1970. [10] IlyaMironov,RandomShuffles ofRC4,CRYPTOpages304-319, 2002. [11] J. Daemen, V. Rijmen, AES Proposal: Rijndael, 1999. [12] R.Curtmola,J.Garay, S.Kamara,andR. Ostrovsky, Searchable symmetric encryption: Improved definitions and efficient constructions, Cryptology ePrint archive, 2006. [13] R. Brinkman, J. Doumen, W. Jonker, Using secret sharing for searching in encrypted data, Secure Data Management VLDB 2004 workshop, 2004. [14] R. Brinkman, L. Feng, S. Etalle, P. Hartel, and W. Jonker, Experimenting with linear searching encrypted data,Centrefor Telematics and Information Technology, 2003.
摘要: 在不信任伺服器的狀況下,為了減少客戶端的空間使用量,且使用者能搜尋文件而不洩漏任何文件資訊 ,我們能利用文件加密與暗門 (trap-door)的技術。當使用者想取回文件時,只要將此暗門給伺服器則可取回想要的文件。如此一來可減少使用者儲存空間的負擔,並可隨時隨地取得重要文件,任何沒有使用者授權的人將無法得到關於文件的任何資訊 ,甚至在使用者搜尋文件時,包含伺服器在內的攻擊者亦無法得到任何有關於文件的資訊 ,伺服器僅得到我們允許被得知的資訊 ,此資訊無關於文件的內容。在這篇文章中提出一個架構在 Song等人的方法上能讓使用者取回文件後使用較少的運算即可解回原本的文件,如此一來則能減輕手持行動裝置使用者的電力負荷,並且能夠保持文件安全 ,我們也證明這個方法擁有針對適應的選擇關鍵字攻擊的安全。
It is desirable to store documents on storage servers such as mail servers or file servers in encrypted form to reduce security and privacy risks. The documents reveal no information about their contents without searchable keywords and searchable keywords can only be generated by a secret key. One approach is to encrypt the documents and create trapdoors for these corresponding documents. When we want to retrieve the documents,we just give the trapdoors to the server. An adversary can not get any information without the authorization of the user, even the server can not know anything from user''s search request. In this thesis, we improve Song''s scheme such that the retrieved documents can be decrypted more effciently. We also prove that the improved scheme is semantically secure against adaptive chosen keyword attacks.
其他識別: U0005-0807200814570100
Appears in Collections:資訊科學與工程學系所



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