Open AccessResearch on order-preserving encryption scheme based on CryptDB
Author(s) -
Xiaoning Jiang,
Xiangfeng Kong,
Zhenchi Xu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1550/3/032106
Subject(s) - encryption , proxy re encryption , computer science , scalability , cloud computing , client side encryption , computer security , 56 bit encryption , scheme (mathematics) , 40 bit encryption , database , on the fly encryption , distributed computing , public key cryptography , operating system , mathematics , mathematical analysis
With the rapid development of cloud computing technology, cloud database, as an important part of cloud computing services, has gradually become necessary for daily work of enterprises or individuals. However, entrusting data to third-party managing can lead to security issues such as data leakage, and users cannot guarantee data security. To this end, this paper is based on the CryptDB, an open source database encryption proxy system designed by MIT, in this thesis we propose an improvement scheme for the shortcomings of the original CryptDB system. Specific contents including: By studying the CryptDB system, we find that the system is lack of scalability for different databases and does not involve the management of system keys. For the inefficiency of the mutable Order-Preserving Encryption (mOPE) in CryptDB system, we propose an improved additive Order-Revealing Encryption (aORE) scheme by combining the Practical Order-Revealing Encryption (P-ORE) and mOPE. The scheme is based on pseudorandom function and double encryption. Compared with mOPE, it can improve the execution efficiency of the Order-Preserving scheme at the expense of security.