Abstract
Order preserving encryption techniques are treated as some of the most efficient encryption schemes for securing numeric data in a database. Such schemes are popular because they resolve performance degradation issues, which are significant problems in database encryption. However, in some applications, the order itself is sensitive information, and should be hidden. Conventional order preserving encryption techniques published so far, did not consider this issue. Therefore, in this study, we consider three techniques that protect the order information and also show good performance. The three methods hide the data order such that comparison operators can be handled efficiently and performance degradation can be prevented. Our methods work on the top of an order preserving encryption scheme and enhance the security of data. Experimental results demonstrate the efficiency and effectiveness of the proposed three methods.
