Combining bucketization and information hidden vector techniques in building an efficient range query scheme on encrypted numerical data

Abstract

Abstract This research intends to propose a new method for executing queries with an efficient range of encrypted data. The efficiency of the method is represented through several aspects, such as the ability to support high-speed range queries, removing false-positive records in the returned result set after making queries, and preventing leakage of plaintext data on the outsourced databases. The approach to solving here is based on three steps. In the first step, we improve the technique of partitioning data to create buckets with more security and fewer false positives while still supporting indexing when searching in database management systems. Second, the research proposes a new structure called the information hiding vector (IHV) to encode bucket values in a form that allows comparison without revealing the order. In the last step, we build a special IHV_B+ Tree at the outsourced database based on the plain values and bucket values and then encode the values in the node of the tree with the IHV. The entire process is described in an SSE schema that we propose a so-called efficient search index tree - searchable symmetric encryption (ESIT-SSE).