Trust Enhancement over Range Search for Encrypted Data
Xu Yang, Ting‐Ting Lee, Joseph K. Liu, Xinyi Huang · 2016
Data outsource in the cloud has become inevitable trend nowadays, which significantly motivates the development of range search. Order-preserving encryption (OPE) as the most efficient scheme for range search has received increasing interest in both the industries and the cryptographic communities. However, the state of arts show that current OPE schemes either lack efficiency or suffer from severe data leakage. Further, none of them implement OPE in the parallel system. Thus, our work aims to address these issues. In this paper, we propose a non-interactive OPE scheme for encrypted parallel database system, which consists of six functions to satisfy the basic operations for data retrieval. In order to enhance the security of non-interactive protocols, one-to-two mapping technique is utilized to hide data distribution as well as data frequency. It can not only protect data from ciphertext-only attack (COA) but also accomplish the higher security level: indistinguishability under a partial ordered ciphertext-only attack (IND-POCA).