Semi-order Preserving Encryption Technique for Numeric Data to Enhance Privacy
Saleh Ahmed, Annisa Annisa, Asif Zaman, Zhan Zhang, Kazi Md. Rokibul Alam, Yasuhiko Morimoto · 2017
Order preserving encryption schemes have been considered as one of the most efficient encryption technique for securing numeric data in a database. Such schemes are popular because they resolved performance degradation issues, which have been significant problems in the database encryption. However, in some applications, the order itself is a sensitive information and should be preserved. Conventional order preserving encryption techniques that have published so far did not consider the issue. Therefore, in this paper, we considered two techniques that perform well and also protect the order information. One uses perturbation of original values. The other uses tree based order hiding technique. The two methods hide the order of data in such a way that can efficiently handle comparison operator and prevent performance degradation. Our methods work on the top of order preserving encryption scheme and enhances the security of data. Our experiment results show the efficiency and effectiveness of proposed two methods over baseline method or other encryption.