Browse by author
Lookup NU author(s): Dr Changyu Dong
This is the authors' accepted manuscript of an article that has been published in its final definitive form by IEEE, 2020.
For re-use rights please refer to the publisher's terms and conditions.
Order-preserving encryption (OPE) is a cryptographic primitive that preserves the order of plaintexts. In the past few years, many OPE schemes have been studied to solve the problem of executing range queries in encrypted databases. However, OPE allows certain information to be leaked (for example, the order of ciphertext), so it is vulnerable to many attacks. Subsequently, order-revealing encryption (ORE), as a generalization of order-preserving encryption, breaks through the limitation of the numeric order of OPE plaintext. It implements ciphertext comparison for any specific form of plaintext through a publicly computable comparison function. In this work, we aim to design the new ORE scheme which reduces the leakage and preserves the practicality in terms of ciphertext length and encryption time. We first propose the hybrid model named HybridORE. Then, we propose an improved scheme named EncodeORE which achieves acceptable security and appropriate ciphertext length. They both explore the encode strategy of encoding plaintext into different parts and apply suitable ORE algorithms to each part according to its security characteristics to reduce leakage. Compared with the typical schemes in large domain, they have less leakage. The experiment shows that the proposed EncodeORE is very practical.
Author(s): Liu Z, Lv S, Li J, Huang Y, Guo L, Yuan Y, Dong C
Publication type: Article
Publication status: Published
Journal: IEEE Transactions on Dependable and Secure Computing
Pages: epub ahead of print
Online publication date: 09/10/2020
Acceptance date: 02/04/2016
Date deposited: 10/11/2020
ISSN (print): 1545-5971
ISSN (electronic): 1941-0018
Altmetrics provided by Altmetric