Technique for querying over an encrypted database

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    The increase in the amount of data in encrypted databases has caused problems in data processing and retrieval. In conventional method, difficulties in querying an encrypted database are experienced because it is time consuming and requires large computations when designing encryption algorithms or creating indexing tables that expose non-authorized disclosure. In this study, we proposed a new technique for querying encrypted databases. This technique allows legitimate users to immediately query without decrypting all the encryption records. In this method, index fields were created by using the hash function, and new approaches of encoding and hiding data information were used. Thus, the query can be used without encryptions. Hence, the index values will not be exposed to speculation by outside attackers when the index table has been detected. The proposed technique could provide high data security and consume lesser time when retrieving records compared with traditional methods.

     


  • Keywords


    Encryption Database; Encoding Data; Indexing Techniques; Index Field Generation; Query Processing.

  • References


      [1] M. Sharma, A. Chaudhary, S. Kumar. "Query Processing Performance and Searching over Encrypted Data by using an Efficient Algorithm" International Journal of Computer Applications (0975 – 8887) Volume 62– No.10, January 2013. https://doi.org/10.5120/10114-4781.

      [2] Kaur, Gurleen. "A Review on Database Security." International Journal of Engineering and Management Research (IJEMR) 7.3 (2017): 269-272.

      [3] Morkel,Tayana, Jan HP Eloff, and Martin S. Olivier. "An overview of image steganography." Information Security South Africa Conference ISSA. 2005.

      [4] Sharma, Manish, Atul Chaudhary, and Santosh Kumar. "Query processing performance and searching over encrypted data by using an efficient algorithm." arXiv preprint arXiv:1308.4687 (2013).‏ https://doi.org/10.5120/10114-4781.

      [5] J. H. Cheon, M. Kim, and M. Kim. Optimized search-and-compute circuits and their application to query evaluation on encrypted data. IEEE Trans. Information Forensics and Security, 11(1):188–199, 2016. https://doi.org/10.1109/TIFS.2015.2483486.

      [6] J. Li and E.R. Omiecinski, “Efficiency and Security Trade-Off in Supporting Range Queries on Encrypted Databases,” Technical Report, pp. 69-83, 2005. https://doi.org/10.1007/11535706_6.

      [7] P. Sudharaka. "Homomorphic encryption and database query privacy" Diss. Memorial University of Newfoundland, 2016.

      [8] H. Hacigümüs, B.R.I., C. Li and S. Mehrotra, “Executing SQL over encrypted data in Database-Service-Provider Model” ACM SIGMOD Madison, Wisconsin, USA, pp. 216-227, June 2002. https://doi.org/10.1145/564691.564717.

      [9] E. Damiani, S. De Capitani Vimercati, Sushil Ja jodia, S.Paraboschi, and P.Samarati, "Balancing confidentiality and efficiency in untrusted relational dbmss", In Proceedings of CCS'03, pages 93{102, 2003.]. https://doi.org/10.1145/948109.948124.

      [10] Wikipedia, the free encyclopedia that anyone can edit http://en.wikipedia.org/wiki/Hash_table , an article on Hash table

      [11] Alhanjouri, Mohammed A., A. L. Derawi, and M. Ayman. "A New Method of Query over Encrypted Data in Database using Hash Map." A New Method of Query over Encrypted Data in Database using Hash Map 41.4 (2012).‏ https://doi.org/10.5120/5533-7580.


 

View

Download

Article ID: 29679
 
DOI: 10.14419/ijet.v7i4.29679




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.