BROWSE
Detail
Journal Article
Efficient Construction of Order-Preserving Encryption Using Pseudo Random Function
Cited 1 time in 
Share 
Share
- Authors
- Nam-Su JHO, Ku-Young CHANG, Do-Won HONG
- Issue Date
- 2015-07
- Citation
- IEICE Transactions on Communications, v.E98.B, no.7, pp.1276-1283
- ISSN
- 1745-1345
- Publisher
- 일본, 전자정보통신학회 (IEICE)
- Language
- English
- Type
- Journal Article
- Abstract
- 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.
- KSP Keywords
- Encryption system, Intrinsic property, Order preserving encryption, Order relations, Provable Security, Pseudo-random number, Random function, practical usage