CFP last date
20 May 2024
Reseach Article

Secure and Efficient Data Retrieval Process based on Hilbert Space Filling Curve

by N. S. Jeya Karthikka, S. Bhaggiaraj, V. Sumathy
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

@article{ 10.5120/15873-4885,
author = { N. S. Jeya Karthikka, S. Bhaggiaraj, V. Sumathy },
title = { Secure and Efficient Data Retrieval Process based on Hilbert Space Filling Curve },
journal = { International Journal of Computer Applications },
issue_date = { April 2014 },
volume = { 91 },
number = { 4 },
month = { April },
year = { 2014 },
issn = { 0975-8887 },
pages = { 36-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume91/number4/15873-4885/ },
doi = { 10.5120/15873-4885 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:11:56.074299+05:30
%A N. S. Jeya Karthikka
%A S. Bhaggiaraj
%A V. Sumathy
%T Secure and Efficient Data Retrieval Process based on Hilbert Space Filling Curve
%J International Journal of Computer Applications
%@ 0975-8887
%V 91
%N 4
%P 36-40
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Philippe Golle, Jessica Staddon, Brent Waters. " Secure Conjunctive Keyword Search Over Encrypted Data" . Applied Cryptography and Network, Springer- 2004.
  2. Boneh. D and B. Waters, "Conjunctive, subset, and range queries on encrypted data," in Proc. of TCC, 2007, pp. 535554.
  3. Sahai A, Waters B. Fuzzy identity-based encryption. In: Cramer R, editor. Advances in cryptology, EUROCRYPT 2005, vol. 3494. Berlin/ Heidelberg: Springer; 2005. p. 557–57.
  4. Jin, G. and J. Mellor-Crummey (2005). SFCGen: An Framework for Efficient Generation of Multi-dimensional Space-filling Curves. ACM Transactions on Mathematical Software 31(1): 120-148.
  5. Bethencourt J, Sahai A, Waters B. Ciphertext- policy attribute-based encryption. In: IEEE symposium on security and privacy; 2007. p. 321–34.
  6. Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G. Public key encryption with keyword search. In: Cachin C, Camenisch J, editors. Advances in Cryptology, EUROCRYPT 2004, vol. 3027. Berlin/Heidelberg: Springer; 2004. p. 506–22.
  7. Frikken K, Atallah M, Li J. Attribute-based access control with hidden policies and hidden credentials. IEEE Trans Comput 2006;55:1259–70.
  8. Nishide T, Yoneyama K, Ohta K. Attribute-based encryption with partially hidden encryptor-specified access structures. In: Bellovin S, Gennaro R, Keromytis A, Yung M, editors. Applied cryptography and network security, vol. 5037. Berlin/Heidelberg: Springer; 2008. p. 111–29.
Index Terms

Computer Science
Information Sciences

Keywords

cloud storage octree partition Hilbert space filling curve search index