Block verifiable dynamic searchable encryption using redactable blockchain

被引:2
|
作者
Du, Ruizhong [1 ,2 ]
Liu, Na [1 ,2 ,4 ]
Li, Mingyue [3 ]
Tian, Junfeng [1 ]
机构
[1] Hebei Univ, Sch Cyber Secur & Comp, Baoding 071002, Peoples R China
[2] Hebei Univ, Hebei Prov Key Lab High Confidence Informat Syst, Baoding 071002, Peoples R China
[3] Nankai Univ, Coll Cyber Sci, Tianjin 300350, Peoples R China
[4] Hebei Univ, Coll Cyberspace Secur & Comp, East Qiyi Rd 2666, Baoding 071002, Peoples R China
基金
中国国家自然科学基金;
关键词
Searchable encryption; Redactable blockchain; Block index; Result verification; Smart contract; SYMMETRIC-ENCRYPTION; CHAMELEON HASH;
D O I
10.1016/j.jisa.2023.103504
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To solve the problems of low efficiency, inflexible updates and the high storage cost of existing result verifiable searchable encryption schemes, we propose a dynamic searchable encryption scheme with block verification using redactable blockchain. First, the inverted index is divided into blocks, the verification tag corresponding to the block index is uploaded to the redactable blockchain, and smart contracts are used to perform block verification of the query results to improve the query and verification performance. Furthermore, we use the blockchain rewriting technology to update the tags in the result checklist, improving the data update performance and scalability of the blockchain, and ensuring the constant storage overhead of the blockchain. Security analysis confirms that our proposals guarantee the correctness and completeness of the query results. Experimental results show that our proposed approach can improve the query efficiency and result verification efficiency under the premise of the low-speed growth of the blockchain data scale. In particular, the advantages become more significant as the data collection scale grows.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Verifiable Dynamic Searchable Symmetric Encryption Based on Blockchain
    Xu W.-S.
    Zhang J.-B.
    Yuan Y.-L.
    Ruan Jian Xue Bao/Journal of Software, 2023, 34 (11): : 5392 - 5407
  • [2] Verifiable dynamic searchable encryption
    Etemad, Mohammad
    Kupcu, Alptekin
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2019, 27 (04) : 2606 - 2623
  • [3] DSE-RB: A Privacy-Preserving Dynamic Searchable Encryption Framework on Redactable Blockchain
    Li, Mingyue
    Jia, Chunfu
    Du, Ruizhong
    Shao, Wei
    Ha, Guanxiong
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2023, 11 (03) : 2856 - 2872
  • [4] Enhancing Medical Data Sharing with an Attribute-Based Dynamic Verifiable Searchable Encryption Scheme Using Blockchain
    Hao, Shuai
    Dong, Xiaomei
    Wen, Ziqiang
    Nie, Tiezheng
    WEB INFORMATION SYSTEMS AND APPLICATIONS, WISA 2024, 2024, 14883 : 403 - 414
  • [5] Verifiable Blockchain-Based Searchable Encryption with forward and backward privacy
    Du, Ruizhong
    Wang, Yi
    2020 16TH INTERNATIONAL CONFERENCE ON MOBILITY, SENSING AND NETWORKING (MSN 2020), 2020, : 630 - 635
  • [6] Verifiable attribute-based searchable encryption scheme based on blockchain
    Yan X.
    Yuan X.
    Tang Y.
    Chen Y.
    Tongxin Xuebao/Journal on Communications, 2020, 41 (02): : 187 - 198
  • [7] BCVSE: Verifiable Searchable Encryption Scheme With Blockchain Supporting Fuzzy Query
    Fucai Zhou
    Zi Jiao
    Qiang Wang
    Jintong Sun
    Arabian Journal for Science and Engineering, 2024, 49 : 4401 - 4418
  • [8] BCVSE: Verifiable Searchable Encryption Scheme With Blockchain Supporting Fuzzy Query
    Zhou, Fucai
    Jiao, Zi
    Wang, Qiang
    Sun, Jintong
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2024, 49 (03) : 4401 - 4418
  • [9] An Efficient, Verifiable, and Dynamic Searchable Symmetric Encryption with Forward Privacy
    Salmani, Khosro
    2022 19TH ANNUAL INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY & TRUST (PST), 2022,
  • [10] Verifiable memory leakage-resilient dynamic searchable encryption
    Guan, Wenhao
    Wang, Yunling
    Wang, Jianfeng
    Fu, Xiaotong
    JOURNAL OF HIGH SPEED NETWORKS, 2018, 24 (03) : 201 - 217