IEICE TRANSACTIONS on Information
Chaotic Order Preserving Encryption for Efficient and Secure Queries on Databases
Summary :
The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.11 pp.2207-2217
- Publication Date
- 2009/11/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.2207
- Type of Manuscript
- PAPER
- Category
- Database
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seungmin LEE, Tae-Jun PARK, Donghyeok LEE, Taekyong NAM, Sehun KIM, "Chaotic Order Preserving Encryption for Efficient and Secure Queries on Databases" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 11, pp. 2207-2217, November 2009, doi: 10.1587/transinf.E92.D.2207.
Abstract: The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.2207/_p
Copy
@ARTICLE{e92-d_11_2207,
author={Seungmin LEE, Tae-Jun PARK, Donghyeok LEE, Taekyong NAM, Sehun KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Chaotic Order Preserving Encryption for Efficient and Secure Queries on Databases},
year={2009},
volume={E92-D},
number={11},
pages={2207-2217},
abstract={The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.},
keywords={},
doi={10.1587/transinf.E92.D.2207},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Chaotic Order Preserving Encryption for Efficient and Secure Queries on Databases
T2 - IEICE TRANSACTIONS on Information
SP - 2207
EP - 2217
AU - Seungmin LEE
AU - Tae-Jun PARK
AU - Donghyeok LEE
AU - Taekyong NAM
AU - Sehun KIM
PY - 2009
DO - 10.1587/transinf.E92.D.2207
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2009
AB - The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.
ER -
English
