MDOPE: Efficient multi-dimensional data order preserving encryption scheme

被引:17
|
作者
Zhan, Yu [1 ,2 ]
Shen, Danfeng [1 ,2 ]
Duan, Pu [3 ]
Zhang, Benyu [3 ]
Hong, Zhiyong [4 ,5 ]
Wang, Baocang [1 ,2 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[2] Xidian Univ, Cryptog Res Ctr, Xian 710071, Peoples R China
[3] Ant Grp, Secure Collaborat Intelligence Lab, Hangzhou 310007, Peoples R China
[4] Wuyi Univ, Facil Intelligence Manufacture, Jiangmen 529020, Peoples R China
[5] Wuyi Univ, Yue Gang Ao Ind Big Data Collaborat Innovat Ctr, Jiangmen 529020, Peoples R China
基金
中国国家自然科学基金;
关键词
Order preserving encryption; Range query; Multi-dimensional data; QUERIES; SECURE;
D O I
10.1016/j.ins.2022.03.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, tremendous information technology industries resort to cloud servers to store data with an outsourcing approach to extend their storage and computation power. This, however, also leads to privacy and security issues of unprotected data against curious cloud servers. The most common solution currently is to encrypt the data before uploading it. The problem is that encrypted data is out of control and users also cannot transfer the searching job to cloud serves anymore. Specifically, the order preserving encryption (OPE) provides an efficient solution to the order of plaintexts. Existing OPE schemes focus on single-dimensional data, and fail to effectively process multi-dimensional data. In this paper, we propose a multi-dimensional data order preserving encryption scheme MDOPE allowing fine-grained multi-dimensional range queries. Our scheme constructs query indexes for each dimension of the data based on the order preserving encryption network. In particular, the proposed scheme ensures that no external entity, including the cloud server, can obtain additional information other than the order of ciphertexts during the whole query process.(C) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:334 / 343
页数:10
相关论文
共 50 条
  • [41] Multi-dimensional model order selection
    Carvalho Lustosa da Costa, Joao Paulo
    Roemer, Florian
    Haardt, Martin
    de Sousa, Rafael Timoteo, Jr.
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2011,
  • [42] Visualizing multi-dimensional data
    Eick, Stephen G.
    Computer Graphics (ACM), 2000, 34 (01): : 61 - 67
  • [43] Multi-dimensional model order selection
    João Paulo Carvalho Lustosa da Costa
    Florian Roemer
    Martin Haardt
    Rafael Timóteo de Sousa
    EURASIP Journal on Advances in Signal Processing, 2011
  • [44] Paillier-Based Fuzzy Multi-Keyword Searchable Encryption Scheme with Order-Preserving
    Li, Xiehua
    Li, Fang
    Jiang, Jie
    Mei, Xiaoyu
    CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 65 (02): : 1707 - 1721
  • [45] Efficient and lightweight indexing approach for multi-dimensional historical data in blockchain
    Singh, Bikash Chandra
    Ye, Qingqing
    Hu, Haibo
    Xiao, Bin
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2023, 139 : 210 - 223
  • [46] Efficient searching for multi-dimensional data made simple (extended abstract)
    Nardelli, E
    Talamo, M
    Vocca, P
    ALGORITHMS - ESA'99, 1999, 1643 : 339 - 353
  • [47] Efficient updating rough approximations with multi-dimensional variation of ordered data
    Wang, Shu
    Li, Tianrui
    Luo, Chuan
    Fujita, Hamido
    INFORMATION SCIENCES, 2016, 372 : 690 - 708
  • [48] Efficient processing of narrow range queries in multi-dimensional data structures
    Kratky, Michal
    Snasel, Vaclav
    Pokorny, Jaroslav
    Zezula, Pavel
    10TH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2006, : 69 - 79
  • [49] Efficient data compression methods for multi-dimensional sparse array operations
    Lin, CY
    Chung, YC
    Liu, JS
    FIRST INTERNATIONAL SYMPOSIUM ON CYBER WORLDS, PROCEEDINGS, 2002, : 62 - 69
  • [50] Efficient Materialized View Selection for Multi-Dimensional Data Cube Models
    Dahiya, Naveen
    Bhatnagar, Vishal
    Singh, Manjeet
    INTERNATIONAL JOURNAL OF INFORMATION RETRIEVAL RESEARCH, 2016, 6 (03) : 52 - 74