International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 91 - Number 4 |
Year of Publication: 2014 |
Authors: N. S. Jeya Karthikka, S. Bhaggiaraj, V. Sumathy |
10.5120/15873-4885 |
N. S. Jeya Karthikka, S. Bhaggiaraj, V. Sumathy . Secure and Efficient Data Retrieval Process based on Hilbert Space Filling Curve. International Journal of Computer Applications. 91, 4 ( April 2014), 36-40. DOI=10.5120/15873-4885
Cloud computing economically enables the paradigm of data service outsourcing. However, to protect the secret data, sensitive information in cloud first the data has to be encrypted before outsourced to the commercial public cloud. It is a very challenging task. Although traditional attribute based encryption technique allow users to securely search the data by using keywords, they support only Boolean search and are not yet sufficient to meet the effective data utilization need that is inherently demanded by large number of users and huge amount of data files in cloud. In this paper, the above mentioned problem can be solved by using Octree partition and the Hilbert space-filling curve. In this technique searching the keyword in search index is very simple. This scheme is suited for cloud storage systems with massive amount of data. This system improves the query results and privacy for search the data in cloud.