Multi-server dynamic searchable encryption scheme supporting result verification

被引：0
|
作者：
He Y. [1 ,2 ]
Tian Y. [1 ,2 ,3 ]
Wan L. [1 ,2 ]
Yang L. [4 ]
机构：
[1] College of Computer Science and Technology, Guizhou University, Guiyang
[2] State Key Laboratory of Public Big Data, Guizhou University, Guiyang
[3] Institute of Cryptography and Date Security, Guizhou University, Guiyang
[4] School of Computer Science and Technology, Xidian University, Xi'an
来源：
Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | 2022年 / 49卷 / 05期
关键词：
block matrix; multi-server; searchable encryption; Shamir-secret sharing; smart contract;
D O I：
10.19665/j.issn1001-2400.2022.05.022
中图分类号：
学科分类号：
摘要：
Aiming at the low retrieval efficiency and the single point of failure(SPOF) of the traditional single-server searchable encryption scheme,this paper constructs a multi-cloud server searchable encryption scheme supporting result verification based on Shamir-secret sharing and intelligent contract.First of all,the Shamir-secret sharing technology is used to split data into multiple different data blocks,which are encrypted and stored on each independent server,and a multi-cloud server searchable encryption model is constructed to prevent the problem of massive data loss caused by SPOF and realize safe distributed storage and efficient query of data.Furthermore,using the characteristics of automatic execution of smart contracts to construct a verification method for query results,the verification of query results is realized by signing a contract,which solves the problem that the correctness of the returned results under the semi-trusted cloud server model is difficult to guarantee.In addition,we introduce a block matrix to construct a sub-matrix for the updated data to reduce the computational cost of query after updating documents,and by adding false keyword information,guessing attacks on cloud servers are prevented,and the security of updated data is guaranteed.Finally,the security analysis and experimental analysis show that the scheme can effectively protect data privacy while reducing the index generation time,and achieve a higher retrieval efficiency compared with other schemes. © 2022 Science Press. All rights reserved.
引用
收藏
页码：189 / 200
页数：11
相关论文
共 24 条
  • [1] SONG D X, WAGNER D, PERRIG A., Practical Techniques for Searches on Encrypted Data, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, pp. 44-55, (2000)
  • [2] GOH E J., Secure Indexes[J], IACR Cryptology ePrint Archive, 2003, (2003)
  • [3] CURTMOLA R, GARAY J, KAMARA S, Et al., Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions, The 13th ACM Conference on Computer and Communications Security, pp. 79-88, (2006)
  • [4] CHANG Y C, MITZENMACHER M., Privacy Preserving Keyword Searches on Remote Encrypted Data [C], International Conference on Applied Cryptography and Network Security, pp. 442-455, (2005)
  • [5] FU Z, WU X, GUAN C, Et al., Toward Efficient Multi-Keyword Fuzzy Search over Encrypted Outsourced Data with Accuracy Improvement, IEEE Transactions on Information Forensics and Security, 11, 12, pp. 2706-2716, (2016)
  • [6] CONG W, REN K, YU S, Et al., Achieving Usable and Privacy-Assured Similarity Search over Outsourced Cloud Data [C], IEEE INFOCOM, pp. 451-459, (2012)
  • [7] BALLARD L, KAMARA S, MONROSE F., Achieving Efficient Conjunctive Keyword Searches over Encrypted Data, International Conference on Information and Communications Security, pp. 414-426, (2005)
  • [8] YAN Xixi, ZHAO Qiang, TANG Yongli, Et al., Multi-Keyword Search Encryption Scheme Supporting Flexible Access Control, Journal of Xidian University, 49, 1, pp. 55-66, (2022)
  • [9] GOLLE P, STADDON J, WATERS B., Secure Conjunctive Keyword Search over Encrypted Data [C], International Conference on Applied Cryptography and Network Security, pp. 31-45, (2004)
  • [10] CASH D, GRUBBS P, PERRYE J, Et al., Leakage-Abuse Attacks Against Searchable Encryption, The 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 668-679, (2015)
123