Sijin Chen
School of Information and Communication Engineering, Beijing Information Science and Technology University, Beijing, 100101, China
Shao Bo Wu
School of Information and Communication Engineering, Beijing Information Science and Technology University, Beijing, 100101, China
Xue Ying Gao
School of Information and Communication Engineering, Beijing Information Science and Technology University, Beijing, 100101, China
ABSTRACT
Due to the massive data storage of big data, an efficient way of data retrieval which can improve the retrieval efficiency without compromising the security is necessary. Homomorphic Encryption allows the retrieval operated on encrypted data without decrypting them so that it can improve retrieval efficiency to a certain degree. But it still cannot satisfy the requirement for big data. In this study, we propose a distributed and hierarchical data retrieval model based on homomorphic encryption. This model can retrieve data according to the retrieval similarity level submitted by users which can improve the retrieval efficiency and in the last part of this study, we propose a way to enhance the retrieval security without compromising retrieval accuracy by adding obscure factor into the query information.
PDF References Citation
How to cite this article
Sijin Chen, Shao Bo Wu and Xue Ying Gao, 2013. Hierarchical Data Retrieval Model For Big Data. Information Technology Journal, 12: 8176-8180.
DOI: 10.3923/itj.2013.8176.8180
URL: https://scialert.net/abstract/?doi=itj.2013.8176.8180
DOI: 10.3923/itj.2013.8176.8180
URL: https://scialert.net/abstract/?doi=itj.2013.8176.8180
REFERENCES
- Feng, D.G., M. Zhang, Y. Zhang and Z. Xu, 2011. Study on cloud computing security. J. Software, 22: 71-83.
CrossRefDirect Link - Qu, W., K. Li and M. Kitsuregawa, 2008. Enhance retrieval efficiency on the internet. Proceedings of the IEEE 7th International Conference on Networking, April 13-18, 2008, Cancun, Mexico, pp: 279-284.
CrossRef - Song, D., D. Wagner and A. Perrig, 2000. Practical techniques for searches on encrypted data. Proceeding of the IEEE Symposium on Security and Privacy, May 14-17, 2000, Berkeley, CA., USA., pp: 44-55.
CrossRef - Orencik, C. and E. Savaa, 2012. An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking. Distrib. Parallel Databases.
CrossRef