Order-Revealing Encryption Scheme with Comparison Token for Cloud Computing

Abstract EN

Order-preserving encryption (OPE) is a basic paradigm for the outsourced database where the order of plaintexts is kept in ciphertexts.

OPE enables efficient order comparison execution while providing privacy protection.

Unfortunately, almost all the previous OPE schemes either require numerous rounds of interactions or reveal more information about the encrypted database (e.g., the most significant bit).

Order-revealing encryption (ORE) as a generalization is an encryption scheme where the order of plaintexts can be evaluated by running a comparison algorithm.

Therefore, it is desirable to design an efficient ORE scheme which addresses above efficiency and security issues.

In this paper, we propose a noninteractive ORE scheme from prefix encoding and Bloom filter techniques.

The proposed scheme is an encryption scheme where a cloud service provider cannot evaluate the order of plaintexts until a comparison token is provided.

The security analysis illustrates that our scheme achieves ideal security with frequency hiding.

Furthermore, we illustrate a secure range query scheme through designing an encrypted tree structure named PORE tree from the above ORE scheme.

The PORE tree reveals the order between different nodes and leaves encrypted data items in the same node incomparable even after query execution.

Finally, the experimental evaluation shows the high efficiency of the proposed ORE scheme and range query scheme.