New Construction of Order-Preserving Encryption Based on Order-Revealing Encryption
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Developing methods to search over an encrypted database (EDB) have received a lot of attention in the last fewyears. Among them, order-revealing encryption (OREnc) and order-preserving encryption (OPEnc) are thecore parts in the case of range queries. Recently, some ideally-secure OPEnc schemes whose ciphertexts revealno additional information beyond the order of the underlying plaintexts have been proposed. However, theseschemes either require a large round complexity or a large persistent client-side storage of size O(n) where ndenotes the number of encrypted items stored in EDB. In this work, we propose a new construction of anefficient OPEnc scheme based on an OREnc scheme. Security of our construction inherits the security of theunderlying OREnc scheme. Moreover, we also show that the construction of a non-interactive ideally-secureOPEnc scheme with a constant client-side storage is theoretically possible from our construction.
Abstract
Developing methods to search over an encrypted database (EDB) have received a lot of attention in the last fewyears. Among them, order-revealing encryption (OREnc) and order-preserving encryption (OPEnc) are thecore parts in the case of range queries. Recently, some ideally-secure OPEnc schemes whose ciphertexts revealno additional information beyond the order of the underlying plaintexts have been proposed. However, theseschemes either require a large round complexity or a large persistent client-side storage of size O(n) where ndenotes the number of encrypted items stored in EDB. In this work, we propose a new construction of anefficient OPEnc scheme based on an OREnc scheme. Security of our construction inherits the security of theunderlying OREnc scheme. Moreover, we also show that the construction of a non-interactive ideally-secureOPEnc scheme with a constant client-side storage is theoretically possible from our construction.
참고문헌 (7)
- F. Kerschbaum, "Frequency-hiding order-preserving encryption", Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp.656~667 (2015)
- D. S. Roche, "POPE: partial order preserving encoding", Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp.1131~1142 (2016)
- N. Chenette, "Fast Software Encryption", pp.474~493 (2016), Springer
- K. Lewi, "Order-revealing encryption: New constructions, applications, and lower bounds", Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp.1167~1178 (2016)
- D. Boneh, "Advances in Cryptology –EUROCRYPT 2015", pp.563~594 (2015), Springer
- E. Miles, "Advances in Cryptology – CRYPT 2016", pp.629~658 (2016), Springer
- J. H. Cheon, "Cryptanalysis of the CLT13 multilinear map", Journal of Cryptology, 32(2), pp.547~565 (2019)