An Almost Non-interactive Order Preserving Encryption Scheme

Abstract

Order preserving encryption (OPE) is an encryption scheme that the ciphertexts retain the order of their underlying plaintexts. It could be used to perform the order comparison or the efficient range query over encrypted data. Recently, plenty of work has been proposed on the construction of OPE scheme. Nevertheless, many existing OPE schemes require multiple rounds \((O(\log n))\) of interaction. As a result, real-time online, network delay and communication transmission failure are the efficiency challenges for the order comparison or range query. In this paper, we propose an almost non-interactive OPE scheme called BF-OPE. The BF-OPE scheme works by integrating Bloom filter and prefix encoding. They enable the encrypted data items to be compared when a token is provided by the client. Furthermore, the padding technique has been used to hide the frequency information both in data items and query ranges on the ciphertexts. Finally, we prove that the proposed scheme is secure with respect to the leakage function \(\mathcal {L}_I\).