ANEW TECHNIQUE BY USING INVERTED TABLES AND 3DBOX FOR EFFICIENT QUERYING OVER AN ENCRYPTED DATABASE

Abstract

Abstract-Th e i n cre ase i n th e am ou n t of data i n e n crypte d database s h as cau se d probl e m s i n data proce ssi n g an d re tri e val ti m e . In tradi ti on al qu e ry proce ssi n g m e th ods, th e re are m an y di ffi cu l ti e s i n e xe cu te qu e ry ove r an e n crypte d database because it is ti m e-con su m i n g. In th i s pape r, proposes technique for qu e ryi n g e n crypte d database s re cords, al l ows au th ori z e d u se rs to e xe cu te qu e ri es without decrypting al l th e re cords of th e e n crypte d database . In th i s te ch n i qu e , i n ve rte d tabl e s i n cl u de th e n u m bers of 3D box cove r l ocati on s th at we re cre ate d to e n h an ce and spe e d u p th e re tri e val tim e of qu e ry an d i m prove an approach of data e m be ddi n g accordi n g to th e random 3D box. Th e propose d m e th od h as be e n e xam i n e d on th e Iraqi vote r e n crypte d Database . Th e re trieval time i n (se con d, m i l l i se con d) h as be e n com pu te d for th e tradi ti on al m e th od of qu e ry proce ssi n g an d proposed te ch n i qu e th at u si n g i n ve rte d tabl e s. The retrieval time of qu e ry e xe cu ti n g of propose d te ch n i qu e s wi th ou t re tri e val of al l th e re cords of th e e n crypted database is 10.870 (se con ds, m i l l i se con d) wh e re th e retrieval time of qu e ry executing of conventional method that’s re tri e val of al l th e re cords of th e e n crypted database is 40.682 (se con ds, m i l l i se con d).