Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19614
標題: 加密文件伺服器輸出正確性之探討
Verifying the correctness of the output of encryption document server
作者: 許家瑞
Hsu, Chia-Jui
關鍵字: Keyword Search;關鍵字搜尋;Test;Verify;測試法;驗證
出版社: 資訊科學與工程學系所
引用: [1] G. Amanatidis, A. Boldyreva, and A. O'Neill. New security models and provably-secure schemes for basic query support in outsourced databases. In Working Conference on Data and Applications Security (DBSec '07), 2007. [2] S. Artzi, A. Kiezun, C. Newport and D. Schultz. Encrypted Keyword Search in a Distributed Storage System. MIT CSAIL Technical Report, MIT-CSAIL-TR-2006-010, 2006. [3] J. Baek, R. Safavi-N aini, and W. Susilo. Public key encryption with keyword search revisited. Lecture Notes in Computer Science, p.1249-1259, 2005. [4] M. Bellare, A. Boldyreva and A. O'Neill. Deterministic and Efficiently Searchable Encryption. In Advances in Cryptology - CRYPTO 2007, pp.535-552, Aug 2007. [5] B. H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. In Communications of the ACM, pp.422-426, July 1970. [6] D. Boneh, G.D. Crescenzo, R. Ostrovsky and G. Persiano. Public Key Encryption with Keyword Search. In Proceedings of IEEE Symposium on Security and Privacy, pp.44-45, Apr 2004. [7] R. Brinkman, L. Feng, S. Etalle, P.H. Hartel and W. Jonker. Experimenting with linear search in encrypted data. In Center for Telematics and Information Technology Technical Report, CTIT-TR-03-43, The Netherlands, September 2003. [8] R. Brinkman, B. Schoenmakers, J. Doumen, and W. Jonker. Experiments with Queries over Encrypted Data Using Secret Sharing. In Secure Data Management (SDM) , pp.33-46, 2005. [9] R. Curtmola, J. Garay, S. Kamara and R. Ostrovsky. Searchable symmetric encryption: improved definitions and efficient constructions. In ACM conference on Computer and communications security, pp.79-88, ACM CCS 2006. [10] M. J. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT, Interlaken, Switzerland, May 2004. [11] M. J. Freedman, Y. Ishai, B. Pinkas and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. In Proceedings of 2nd Theory of Cryptography Conference (TCC ''05) Cambridge, Feb 2005. [12] E-J. Goh. Secure Indexes. In The Cryptology ePrint Archive, Report 2003/216, Mar 16, 2004. [13] P. Golle, J. Staddon, and B. Waters. Secure Conjunctive Keyword Search over Encrypted Data. Proceedings of Applied Cryptography and Network Security Conference, Lecture Notes in Computer Science, pp.31-45, 2004. [14] L.T.A. Joseph, A. Samsudin and B. Belaton. Efficient Search on Encrypted Data. IEEE 7th Malaysia International Conference on Communication, pp.6, Nov 2005. [15] E-K Ryu, T. Takagi. Efficient Conjunctive Keyword-Searchable Encryption. Advanced Information Networking and Applications Workshops, pp 409-414, 2007 [16] R. Sion, B. Carbunar. Conjunctive Keyword Search on Encrypted Data with Completeness and Computational Privacy. The Cryptology ePrint Archive, Report 2005/172, Jun 10 2005. [17] R. Sion. Towards Secure Data Outsourcing. The Handbook of Database Security: Applications and Trends. M. Gertz and S. Jajodia (editors), Springer, pp.137-163, 2008. [18] D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, pp.44-55, 2000. [19] W. Stallings. Cryptography and Network Security: Principles and Practices. Fourth Edition, Prentice Hall, 2007.
摘要: 
搜尋加密資料在資訊發達的時代中,已經成為非常重要的部分,尤其人們將隱私性的資料,存放於開放式網路環境的伺服器中,使得保護資料隱密性越來越重要。然而,大部分的方法都專注在探討搜尋加密資料內容之正確性與效率,卻忽略了伺服器回傳資料數量是否正確。本文所提出的方法使用一種測試驗證的機制來驗證伺服器回傳資料是否正確。測試法是將我們已知關鍵字的文件加密後,上傳至伺服器,藉由關鍵字搜尋,當伺服器回傳時,驗證是否有此文件,此架構在驗證時之時間、通訊量、記憶體需求皆可符合簡易電子裝置之需求。
本論文主要貢獻在於,對於關鍵字加密搜尋這方面的文章,提出一個新的問題假設,並討論其重要性,在設定三種情況下去分析討論,採用簡單的方法,就可以達到驗證伺服器是否為可信任的伺服器。

Nowadays, protecting personal private information is getting more important than before. We hope that the private information in the open network server could be accessed from anywhere, at anytime. Furthermore, the server may not be trusted since attackers may compromise the server and modify the information stored in it. In this thesis, we propose a scheme to verify whether the server can be trusted or not. The memory and communication cost of the proposed scheme conform to the constraints of the mobile devices.
URI: http://hdl.handle.net/11455/19614
其他識別: U0005-1707200914571600
Appears in Collections:資訊科學與工程學系所

Show full item record
 

Google ScholarTM

Check


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