Kee Sung Kim, Journal of Information Processing Systems Vol. 15, No. 5, pp. 1211-1217, Oct. 2019  

https://doi.org/10.3745/JIPS.03.0128
Keywords: Database Encryption, Order-Preserving Encryption, Order-Revealing Encryption
Fulltext: PDF Full Text PubReader

Abstract

Developing methods to search over an encrypted database (EDB) have received a lot of attention in the last few years. Among them, order-revealing encryption (OREnc) and order-preserving encryption (OPEnc) are the core parts in the case of range queries. Recently, some ideally-secure OPEnc schemes whose ciphertexts reveal no additional information beyond the order of the underlying plaintexts have been proposed. However, these schemes either require a large round complexity or a large persistent client-side storage of size O(n) where n denotes the number of encrypted items stored in EDB. In this work, we propose a new construction of an efficient OPEnc scheme based on an OREnc scheme. Security of our construction inherits the security of the underlying OREnc scheme. Moreover, we also show that the construction of a non-interactive ideally-secure OPEnc scheme with a constant client-side storage is theoretically possible from our construction.

Statistics
Cite this article