| Hao Renzhi (郝任之)*,Li Jun** ***,Wu Guangjun***.[J].高技术通讯(英文),2020,26(4):448~454 |
|
| A privacy-preserved indexing schema in DaaS model for range queries |
| |
| DOI：10.3772/j.issn.1006-6748.2020.04.013 |
| 中文关键词: |
| 英文关键词: database-as-a-service (DaaS) model, data privacy and security, data verification, range query |
| 基金项目: |
| Author Name | Affiliation | | Hao Renzhi (郝任之)* | (*College of Control Science and Engineering, Zhejiang University, Hangzhou 310058, P.R.China) | | Li Jun** *** | (**School of Cyber Security, University of Chinese Academy of Sciences, Beijing 100093, P.R.China)
(***Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, P.R.China) | | Wu Guangjun*** | (***Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, P.R.China) |
|
| Hits: 1445 |
| Download times: 1355 |
| 中文摘要: |
| |
| 英文摘要: |
| In a database-as-a-service (DaaS) model, a data owner stores data in a database server of a service provider, and the DaaS adopts the encryption for data privacy and indexing for data query. However, an attacker can obtain original data’s statistical information and distribution via the indexing distribution from the database of the service provider. In this work, a novel indexing schema is proposed to satisfy privacy-preserved data management requirements, in which an attacker cannot obtain data source distribution or statistic information from the index. The approach includes 2 parts: the Hash-based indexing for encrypted data and correctness verification for range queries. The evaluation results demonstrate that the approach can hide statistical information of encrypted data distribution while can also obtain correct answers for range queries. Meanwhile, the approach can achieve nearly 10 times and 35 times improvement on encrypted data publishing and indexing respectively, compared with the start-of-the-art method order-preserving Hash-based function (OPHF). |
|
View Full Text
View/Add Comment Download reader |
| Close |
|
|
|
