Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query

被引:6
作者
Hahn, Changhee [1 ]
Yoon, Hyundo [2 ]
Hur, Junbeom [2 ]
机构
[1] Seoul Natl Univ Sci & Technol, Dept Elect & Informat Engn, Seoul 01811, South Korea
[2] Korea Univ, Dept Comp Sci & Engn, Seoul 02841, South Korea
基金
新加坡国家研究基金会;
关键词
Indexes; Cryptography; Encryption; Authorization; Security; Cloud computing; Servers; Encrypted data search; cloud computing; data sharing; privacy; security;
D O I
10.1109/TIFS.2023.3236178
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many commercial cloud service providers (CSPs) adopt pay-per-query pricing models, in which data owners are charged based on the amount of data scanned by each query. In such a data sharing model, not only the privacy preservation for the data and queries but also the trustworthiness of the underlying billing system is of the utmost importance. In this paper, we revisit multi-key searchable encryption (MKSE), an efficient and secure data search algorithm allowing a data owner to grant users the ability to retrieve data of interest over the outsourced, encrypted datasets. We first investigate which factor in existing MKSE schemes renders authorized users over-privileged such that, without risking their credits (e.g., leaking the private keys and/or the passwords for their accounts associated with a project where the shared data resides), they can allow unauthorized users to make valid queries. Unfortunately, this concern may be devastating because the queries made by unauthorized users would incur unexpected financial damage to the owner in practical pay-per-query models. We then propose a novel multi-key data search scheme that is resilient to unauthorized queries. The proposed scheme features a novel user authorization mechanism that carefully limits user privilege such that even an authorized user cannot illegally invite unauthorized users to query unless he entirely leaks his credit. We demonstrate the proposed scheme is comparable to prior work in terms of performance while achieving a higher level of security.
引用
收藏
页码:1169 / 1181
页数:13
相关论文
共 41 条
  • [1] Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
  • [2] A Survey of Provably Secure Searchable Encryption
    Bosch, Christoph
    Hartel, Pieter
    Jonker, Willem
    Peter, Andreas
    [J]. ACM COMPUTING SURVEYS, 2015, 47 (02)
  • [3] Σοφοζ - Forward Secure Searchable Encryption
    Bost, Raphael
    [J]. CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, : 1143 - 1154
  • [4] A Precise Model for Google Cloud Platform
    Challita, Stephanie
    Zalila, Faiez
    Gourdin, Christophe
    Merle, Philippe
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING (IC2E 2018), 2018, : 177 - 183
  • [5] Multi-User Dynamic Searchable Symmetric Encryption With Corrupted Participants
    Chamani, Javad Ghareh
    Wang, Yun
    Papadopoulos, Dimitrios
    Zhang, Mingyang
    Jalili, Rasool
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (01) : 114 - 130
  • [6] Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage
    Cui, Baojiang
    Liu, Zheli
    Wang, Lingyu
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (08) : 2374 - 2385
  • [7] Cui H., 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, P1
  • [8] Indoor Top-k Keyword-aware Routing Query
    Feng, Zijin
    Liu, Tiantian
    Li, Huan
    Lu, Hua
    Shou, Lidan
    Xu, Jianliang
    [J]. 2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 1213 - 1224
  • [9] Gionis A, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P518
  • [10] Goldwasser S, 2013, STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, P555