Paper
1 June 2023 Mutable order-preserving encryption scheme based on boundary search tree
Yujie Zhang, Min Li, Mingze Du, Siyuan Gao, Tao Zhang, Liwen Zhang
Author Affiliations +
Proceedings Volume 12718, International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2023); 127180D (2023) https://doi.org/10.1117/12.2681651
Event: International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2023), 2023, Nanjing, China
Abstract
The main task of a ciphertext database is to store ciphertext data and perform simple operations on ciphertext data while ensuring data security. In this paper, the problem that mutable order-preserving encryption(mOPE) scheme in the ciphertext database system requires frequent interaction between client and server to locate the ciphertext data location during ciphertext insertion and ciphertext retrieval is addressed, which leads to performance loss. B-mOPE scheme is proposed as an optimized mOPE scheme for ciphertext databases by designing a new data structure, a boundary search tree. Experimental results show that B-mOPE scheme has a significant improvement in execution performance compared with original mOPE scheme and satisfies the security criteria of the order-preserving encryption (OPE) scheme.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yujie Zhang, Min Li, Mingze Du, Siyuan Gao, Tao Zhang, and Liwen Zhang "Mutable order-preserving encryption scheme based on boundary search tree", Proc. SPIE 12718, International Conference on Cyber Security, Artificial Intelligence, and Digital Economy (CSAIDE 2023), 127180D (1 June 2023); https://doi.org/10.1117/12.2681651
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Computer security

Data storage

Binary data

Information security

Back to Top