BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System
Recently, researchers are being more interested in performing operations directly on the encrypted database with the help of the <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rder-<inline-formula> <tex-math notation="LaTeX...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9350588/ |
| _version_ | 1798002009771606016 |
|---|---|
| author | Si Chen Lin Li Wenyu Zhang Xiaolin Chang Zhen Han |
| author_facet | Si Chen Lin Li Wenyu Zhang Xiaolin Chang Zhen Han |
| author_sort | Si Chen |
| collection | DOAJ |
| description | Recently, researchers are being more interested in performing operations directly on the encrypted database with the help of the <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rder-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>reserving <inline-formula> <tex-math notation="LaTeX">$E$ </tex-math></inline-formula>ncryption (OPE) scheme. This mechanism enables executing many types of queries efficiently, such as range query and comparison, since it can preserve the relative order of underlying plaintext on ciphertexts. However, traditional OPE schemes cannot achieve ideal security against IND-OCPA (<italic>IND</italic> istinguishability under <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rdered <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula>hosen-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>laintext <inline-formula> <tex-math notation="LaTeX">$A$ </tex-math></inline-formula>ttack) in a linear length of static encoding. Popa’s mutable scheme (namely, mOPE) is an effective solution to perform the range query in the database environment. In this paper, we propose a novel scheme, <inline-formula> <tex-math notation="LaTeX">$B$ </tex-math></inline-formula>oundary <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rder-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>reserving <inline-formula> <tex-math notation="LaTeX">$E$ </tex-math></inline-formula>ncryption (BOPE), to achieve high performance under ideal security. BOPE comprises two algorithms. One is a searching algorithm in which we propose a data structure, the boundary tree, to optimize the algorithm by cutting the scope of each iteration and reducing the rounds of interaction. The second algorithm is an updating algorithm for stale encoding, which determines whether to update the lookup table according to the type of each query, in order to avoid the time cost of redundant updates. We implemented and evaluated BOPE on a practical environment where we have achieved a performance increase of more than 10% from mOPE. |
| first_indexed | 2024-04-11T11:45:22Z |
| format | Article |
| id | doaj.art-55288c6dc09a40f382013f41f7df93e0 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-11T11:45:22Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-55288c6dc09a40f382013f41f7df93e02022-12-22T04:25:37ZengIEEEIEEE Access2169-35362021-01-019301243013410.1109/ACCESS.2021.30581869350588BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database SystemSi Chen0https://orcid.org/0000-0003-1559-2136Lin Li1https://orcid.org/0000-0001-5232-6502Wenyu Zhang2https://orcid.org/0000-0002-2587-3321Xiaolin Chang3https://orcid.org/0000-0002-2975-8857Zhen Han4https://orcid.org/0000-0002-3688-873XSchool of Computer and Information Technology, Beijing Jiaotong University, Beijing, ChinaSchool of Computer and Information Technology, Beijing Jiaotong University, Beijing, ChinaSchool of Computer Science and Technology, Shandong University of Finance and Economics, Jinan, ChinaSchool of Computer and Information Technology, Beijing Jiaotong University, Beijing, ChinaSchool of Computer and Information Technology, Beijing Jiaotong University, Beijing, ChinaRecently, researchers are being more interested in performing operations directly on the encrypted database with the help of the <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rder-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>reserving <inline-formula> <tex-math notation="LaTeX">$E$ </tex-math></inline-formula>ncryption (OPE) scheme. This mechanism enables executing many types of queries efficiently, such as range query and comparison, since it can preserve the relative order of underlying plaintext on ciphertexts. However, traditional OPE schemes cannot achieve ideal security against IND-OCPA (<italic>IND</italic> istinguishability under <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rdered <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula>hosen-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>laintext <inline-formula> <tex-math notation="LaTeX">$A$ </tex-math></inline-formula>ttack) in a linear length of static encoding. Popa’s mutable scheme (namely, mOPE) is an effective solution to perform the range query in the database environment. In this paper, we propose a novel scheme, <inline-formula> <tex-math notation="LaTeX">$B$ </tex-math></inline-formula>oundary <inline-formula> <tex-math notation="LaTeX">$O$ </tex-math></inline-formula>rder-<inline-formula> <tex-math notation="LaTeX">$P$ </tex-math></inline-formula>reserving <inline-formula> <tex-math notation="LaTeX">$E$ </tex-math></inline-formula>ncryption (BOPE), to achieve high performance under ideal security. BOPE comprises two algorithms. One is a searching algorithm in which we propose a data structure, the boundary tree, to optimize the algorithm by cutting the scope of each iteration and reducing the rounds of interaction. The second algorithm is an updating algorithm for stale encoding, which determines whether to update the lookup table according to the type of each query, in order to avoid the time cost of redundant updates. We implemented and evaluated BOPE on a practical environment where we have achieved a performance increase of more than 10% from mOPE.https://ieeexplore.ieee.org/document/9350588/Order-preserving encryption/encodingIND-OCPA securityencrypted database systemefficiency |
| spellingShingle | Si Chen Lin Li Wenyu Zhang Xiaolin Chang Zhen Han BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System IEEE Access Order-preserving encryption/encoding IND-OCPA security encrypted database system efficiency |
| title | BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System |
| title_full | BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System |
| title_fullStr | BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System |
| title_full_unstemmed | BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System |
| title_short | BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System |
| title_sort | bope boundary order preserving encryption scheme in relational database system |
| topic | Order-preserving encryption/encoding IND-OCPA security encrypted database system efficiency |
| url | https://ieeexplore.ieee.org/document/9350588/ |
| work_keys_str_mv | AT sichen bopeboundaryorderpreservingencryptionschemeinrelationaldatabasesystem AT linli bopeboundaryorderpreservingencryptionschemeinrelationaldatabasesystem AT wenyuzhang bopeboundaryorderpreservingencryptionschemeinrelationaldatabasesystem AT xiaolinchang bopeboundaryorderpreservingencryptionschemeinrelationaldatabasesystem AT zhenhan bopeboundaryorderpreservingencryptionschemeinrelationaldatabasesystem |