Browse > Article
http://dx.doi.org/10.6109/jkiice.2015.19.4.848

The performance analysis of the selective element encryption method  

Yang, Xue (Department of Information and Communication, Semyung University)
Kim, Ji-Hong (Department of Information and Communication, Semyung University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.19, no.4, 2015 , pp. 848-854 More about this Journal
Abstract
There are a lot of encryption methods to secure database proposed recently. Those encryption methods can protect the sensitive data of users effectively, but it deteriorates the search performance of database query. In this paper, we proposed the selective element encryption method in order to complement those drawbacks. In addition, we compared the performance of the proposed method with that of tuple level encryption method using the various queries. As a result, we found that the proposed method, which use the selective element encryption with bloom filter as a index, has better performance than the other encryption method.
Keywords
Database Encryption; Encrypted data search; Element encryption; Bloom filter;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 B. LEE, "Comparison and Performance Evaluation of the Database Encryption Schemes", M.S. dissertation, Seoul National University, 2013.
2 H. Hacigv.mv.s, B. Iyer, Chen Li, and Shrad Mehrotra, "Executing SQL over encrypted data in the database service provider model", In Proc. of the ACM SIGMOD, pp.45-49, 2002.
3 J. Kim, T. Sahama, S. Kim, "A Performance test of Query Operation on Encrypted Database", LNCS 235, pp 801-810, 2013.
4 A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4): 485-509, 2004.   DOI
5 B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, "The bloomier filter : an efficient data structure for static support lookup tables", in SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (Philadelphia, PA, USA), pp.30-39, Society for Industrial and Applied Mathematics, 2004.
6 S. Lee, H. Ahn, "An Efficient Group Key Management Scheme using Counting Bloom Filter in VANET", Journal of Convergence Security, vol. 13, no. 4, pp. 47-52, 2013.