Efficient Construction of Order-Preserving Encryption Using Pseudo Random Function

Nam-Su JHO  Ku-Young CHANG  Do-Won HONG  

IEICE TRANSACTIONS on Communications   Vol.E98-B   No.7   pp.1276-1283
Publication Date: 2015/07/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E98.B.1276
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
order-preserving encryption,  OPE,  range query,  database encryption,  

Full Text: PDF>>
Buy this Article

Order-Preserving Encryption (OPE) is an encryption system that preserves the numerical (or alphabetical) order of plaintexts. Since many operations of communications and databases are based on order relations of data (plaintexts), OPE is regarded as a core technique for various applications. However, the intrinsic property of OPE makes constructing an efficient and secure OPE system hard to achieve. In particular, OPE can guarantee only limited security compared to general encryption systems. Only a few results on OPE systems were presented, and no theoretical research based on provable security has been presented until recently. Lately, some approaches have been suggested. However, every known result is unsatisfactory for formalizing the provable security of OPE systems. In this paper, we propose a new OPE system that employs only a simple pseudorandom number function, and therefore has an advantage for practical usage.