Abstract
Data outsource in the cloud has become inevitable trend nowadays, which significantly motivates the development of range search. Order-preserving encryption (OPE) as the most efficient scheme for range search has received increasing interest in both the industries and the cryptographic communities. However, the state of arts show that current OPE schemes either lack efficiency or suffer from severe data leakage. Further, none of them implement OPE in the parallel system. Thus, our work aims to address these issues. In this paper, we propose a non-interactive OPE scheme for encrypted parallel database system, which consists of six functions to satisfy the basic operations for data retrieval. In order to enhance the security of non-interactive protocols, one-to-two mapping technique is utilized to hide data distribution as well as data frequency. It can not only protect data from ciphertext-only attack (COA) but also accomplish the higher security level: indistinguishability under a partial ordered ciphertext-only attack (IND-POCA).
| Original language | English |
|---|---|
| Title of host publication | 2016 IEEE Trustcom/BigDataSE/ISPA |
| Subtitle of host publication | Tianjin, China, 23-26 August, 2016, [Proceedings] |
| Editors | Yang Xiang, Kui Ren, Dengguo Feng |
| Place of Publication | Piscataway, NJ |
| Publisher | IEEE, Institute of Electrical and Electronics Engineers |
| Pages | 66-73 |
| Number of pages | 8 |
| ISBN (Electronic) | 9781509032051 |
| ISBN (Print) | 9781509032068 |
| DOIs | |
| Publication status | Published - 7 Feb 2017 |
| Event | IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) 2016 - Tianjin, China Duration: 23 Aug 2016 → 26 Aug 2016 Conference number: 15th http://wikicfp.com/cfp/servlet/event.showcfp?eventid=51525©ownerid=85083 |
Conference
| Conference | IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) 2016 |
|---|---|
| Abbreviated title | Trustcom 2016 |
| Country | China |
| City | Tianjin |
| Period | 23/08/16 → 26/08/16 |
| Other | This was a Joint conference: The 15th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 10th IEEE International Conference on Big Data Science and Engineering and 14th IEEE International Symposium on Parallel and Distributed Processing with Applications, IEEE TrustCom/BigDataSE/ISPA 2016 |
| Internet address |
Keywords
- Non-interactive
- Order-preserving encryption
- Privacy
- Range search
- Security
Cite this
}
Trust enhancement over range search for encrypted data. / Yang, Xu; Lee, Ting Ting; Liu, Joseph K.; Huang, Xinyi.
2016 IEEE Trustcom/BigDataSE/ISPA: Tianjin, China, 23-26 August, 2016, [Proceedings]. ed. / Yang Xiang; Kui Ren; Dengguo Feng. Piscataway, NJ : IEEE, Institute of Electrical and Electronics Engineers, 2017. p. 66-73 7846930.Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research
TY - GEN
T1 - Trust enhancement over range search for encrypted data
AU - Yang, Xu
AU - Lee, Ting Ting
AU - Liu, Joseph K.
AU - Huang, Xinyi
PY - 2017/2/7
Y1 - 2017/2/7
N2 - Data outsource in the cloud has become inevitable trend nowadays, which significantly motivates the development of range search. Order-preserving encryption (OPE) as the most efficient scheme for range search has received increasing interest in both the industries and the cryptographic communities. However, the state of arts show that current OPE schemes either lack efficiency or suffer from severe data leakage. Further, none of them implement OPE in the parallel system. Thus, our work aims to address these issues. In this paper, we propose a non-interactive OPE scheme for encrypted parallel database system, which consists of six functions to satisfy the basic operations for data retrieval. In order to enhance the security of non-interactive protocols, one-to-two mapping technique is utilized to hide data distribution as well as data frequency. It can not only protect data from ciphertext-only attack (COA) but also accomplish the higher security level: indistinguishability under a partial ordered ciphertext-only attack (IND-POCA).
AB - Data outsource in the cloud has become inevitable trend nowadays, which significantly motivates the development of range search. Order-preserving encryption (OPE) as the most efficient scheme for range search has received increasing interest in both the industries and the cryptographic communities. However, the state of arts show that current OPE schemes either lack efficiency or suffer from severe data leakage. Further, none of them implement OPE in the parallel system. Thus, our work aims to address these issues. In this paper, we propose a non-interactive OPE scheme for encrypted parallel database system, which consists of six functions to satisfy the basic operations for data retrieval. In order to enhance the security of non-interactive protocols, one-to-two mapping technique is utilized to hide data distribution as well as data frequency. It can not only protect data from ciphertext-only attack (COA) but also accomplish the higher security level: indistinguishability under a partial ordered ciphertext-only attack (IND-POCA).
KW - Non-interactive
KW - Order-preserving encryption
KW - Privacy
KW - Range search
KW - Security
UR - http://www.scopus.com/inward/record.url?scp=85015150275&partnerID=8YFLogxK
U2 - 10.1109/TrustCom.2016.0047
DO - 10.1109/TrustCom.2016.0047
M3 - Conference Paper
SN - 9781509032068
SP - 66
EP - 73
BT - 2016 IEEE Trustcom/BigDataSE/ISPA
A2 - Xiang, Yang
A2 - Ren, Kui
A2 - Feng, Dengguo
PB - IEEE, Institute of Electrical and Electronics Engineers
CY - Piscataway, NJ
ER -