Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation

被引:35
|
作者
Xu, Huiqi [1 ]
Guo, Shumin [1 ]
Chen, Keke [1 ]
机构
[1] Wright State Univ, Dept Comp Sci & Engn, Data Intens Anal & Comp Lab, Ohio Ctr Excellence Knowledge Enabled Comp, Dayton, OH 45435 USA
基金
美国国家科学基金会;
关键词
Query services in the cloud; privacy; range query; kNN query;
D O I
10.1109/TKDE.2012.251
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the wide deployment of public cloud computing infrastructures, using clouds to host data query services has become an appealing solution for the advantages on scalability and cost-saving. However, some data might be sensitive that the data owner does not want to move to the cloud unless the data confidentiality and query privacy are guaranteed. On the other hand, a secured query service should still provide efficient query processing and significantly reduce the in-house workload to fully realize the benefits of cloud computing. We propose the random space perturbation (RASP) data perturbation method to provide secure and efficient range query and kNN query services for protected data in the cloud. The RASP data perturbation method combines order preserving encryption, dimensionality expansion, random noise injection, and random projection, to provide strong resilience to attacks on the perturbed data and queries. It also preserves multidimensional ranges, which allows existing indexing techniques to be applied to speedup range query processing. The kNN-R algorithm is designed to work with the RASP range query algorithm to process the kNN queries. We have carefully analyzed the attacks on data and queries under a precisely defined threat model and realistic security assumptions. Extensive experiments have been conducted to show the advantages of this approach on efficiency and security.
引用
收藏
页码:322 / 335
页数:14
相关论文
共 50 条
  • [1] RASP-QS: Efficient and Confidential Query Services in the Cloud
    Alavi, Zohreh
    Zhou, Lu
    Powers, James
    Chen, Keke
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 7 (13): : 1685 - 1688
  • [2] Data Perturbation: An Approach to Protect Confidential Data in Cloud Environment
    Darpe, Dipali
    Nighot, Jyoti
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DATA ENGINEERING AND COMMUNICATION TECHNOLOGY, ICDECT 2016, VOL 2, 2017, 469 : 345 - 352
  • [3] Building an Authentication and Quality of Query Services in the Cloud
    Sunitha, J.
    Sermakani, A. M.
    BIG DATA, CLOUD AND COMPUTING CHALLENGES, 2015, 50 : 122 - 127
  • [4] RASP-Boost: Confidential Boosting-Model Learning with Perturbed Data in the Cloud
    Chen, Keke
    Guo, Shumin
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2018, 6 (02) : 584 - 597
  • [5] Stochastic protection of confidential information in databases: A hybrid of data perturbation and query restriction
    Nunez, Manuel A.
    Garfinkel, Robert S.
    Gopal, Ram D.
    OPERATIONS RESEARCH, 2007, 55 (05) : 890 - 908
  • [6] Reliable and confidential cloud storage with efficient data forwarding functionality
    Liu, Jian
    Wang, Huimei
    Xian, Ming
    Rong, Hong
    Huang, Kun
    IET COMMUNICATIONS, 2016, 10 (06) : 661 - 668
  • [7] VQL: Efficient and Verifiable Cloud Query Services for Blockchain Systems
    Wu, Haotian
    Peng, Zhe
    Guo, Songtao
    Yang, Yuanyuan
    Xiao, Bin
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2022, 33 (06) : 1393 - 1406
  • [8] Efficient distributed query based on dispatching cloud data
    Jiang, Y. (meiyuanjy@gmail.com), 1600, Binary Information Press (10):
  • [9] Nimble: Rollback Protection for Confidential Cloud Services
    Angel, Sebastian
    Basu, Aditya
    Cui, Weidong
    Jaeger, Trent
    Lau, Stella
    Setty, Srinath
    Singanamalla, Sudheesh
    PROCEEDINGS OF THE 17TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, OSDI 2023, 2023, : 193 - 208
  • [10] Range Query Integrity in Cloud Data Streams with Efficient Insertion
    Buccafurri, Francesco
    Lax, Gianluca
    Nicolazzo, Serena
    Nocera, Antonino
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2016, 2016, 10052 : 719 - 724