ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Efficient Construction of Order-Preserving Encryption Using Pseudo Random Function
Cited 1 time in scopus Download 2 time Share share facebook twitter linkedin kakaostory
저자
조남수, 장구영, 홍도원
발행일
201507
출처
IEICE Transactions on Communications, v.E98.B no.7, pp.1276-1283
ISSN
1745-1345
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transcom.E98.B.1276
협약과제
15ZS1500, 암호화된 데이터베이스에서의 데이터 저장 및 검색을 위한 암호 원천 기술 개발, 장구영
초록
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.
키워드
Database encryption, OPE, Order-preserving encryption, Range query
KSP 제안 키워드
Database encryption, Encryption system, Intrinsic property, Order preserving encryption, Order relations, Provable Security, Pseudo-random number, Random function, Range queries, practical usage