Please use this identifier to cite or link to this item:
標題: 可搜尋加密法之正確性驗證機制
An Efficient Correctness-Verifying Scheme for Searchable Encryption
作者: 顏志龍
Yen, Chih-Lung
關鍵字: Encryption;加密;trust;correctness;keyword searchable encryption;信任;正確性測試;可搜尋的關鍵字加密法
出版社: 資訊科學與工程學系所
引用: [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 Tech.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, pp.1249-1259, 2005. [4] M. Bellare, A. Boldyreva and A. O'Neill, “ Deterministic and Efficiently Searchable Encryption.” 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.” Proceedings of IEEE Symposium on Security and Privacy IEEE, pp.44-45, Apr 2004. [7] D. Boneh, E. Kushilevitz, R. Ostrovsky, and WE Skeith “ Public Key Encryption that Allows PIR Queries.” Lecture Notes in Computer Science, Springer, pp.50-67, 2007. [8] D. Boneh, EJ. Goh, and K Nissim “ Evaluating 2-DNF Formulas on Ciphertexts.” Lecture Notes in Computer Science, Springer, pp.325-341, 2005. [9] R. Brinkman, L. Feng, J. Doumen, P.H. Hartel, and W. Jonke “ Effictient Tree Search in Encrypted data.” Information Systems Security Journal: A Global Perspective, 13:3, pp.14 -21, 2004. [10] R. Brinkman, L. Feng, S. Etalle, P.H. Hartel and W. Jonker, “ Experimenting with linear search in encrypted data. ” The Netherlands, September, 2003. [11] 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, ACM CCS, pp.79-88, 2006. [12] C Cachin, S Micali, M Stadler, “ Computationally Private Information Retrieval with Polylogarithmic Communication.” Lecture Notes in Computer Science, p.402-414, 1999. [13] E-J. Goh, “ Secure Indexes.” The Cryptology ePrint Archive, Report 2003/216, Mar 16, 2004. [14] 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. [15] L.T.A. Joseph, A. Samsudin and B. Belaton, “ Efficient Search on Encrypted Data.” In Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication, pp.6, Nov 2005. [16] E-K Ryu, T. Takagi, “ Efficient Conjunctive Keyword-Searchable Encryption.” Advanced Information Networking and Applications Workshops, pp.409-411, 2007. [17] A J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. “ Handbook of Applied Cryptography.”. CRC Press, 1997. [18] D J Park, J Cha, PJ Lee, “Searchable Keyword-Based Encryption.” IACR ePrint Archaive, Report, 2005. [19] D. Song, D. Wagner and A. Perrig, “ Practical Techniques for Searches on Encrypted Data.” Advances in Cryptology - EUROCRYPT 2004, pp.506-522, May 2000. [20] W. Stallings, “ Cryptography and Network Security: Principles and Practices.” Prentice Hall, Fourth Edition, 2007.

In the open network, servers may be attacked. When a server is under control by the attacker, it cannot be trusted since the attacker may modify or delete some documents. In this paper we propose two schemes to verify the trustfulness of the server.
其他識別: U0005-1507200914545000
Appears in Collections:資訊科學與工程學系所

Show full item record

Google ScholarTM


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