Search

To make up the information leakage of the order preserving encryption (OPE), based on the core concept of searchable encryption, this paper proposed a novel privacy preserving range query algorithm. In the algorithm, it transformed the queried range to a specific keyword which recorded in a bloom filter, and the querying became the searching for a match. The information of the ciphertext was only related to the domain, and therefore it guaranteed the semantic security. Experiments show that the algorithm is linear for the computational overhead. Overall, the algorithm is both secure and efficient. [ABSTRACT FROM AUTHOR]