1. 北京交通大学电子信息工程学院,北京 100044
2. 北京交通大学计算机与信息技术学院,北京 100044
[ "袁承昊(1998- ),男,山东东营人,北京交通大学硕士生,主要研究方向为云计算安全" ]
[ "李勇(1973- ),男,山东无棣人,北京交通大学副教授,主要研究方向为数据安全与隐私保护、区块链安全" ]
[ "任爽(1981- ),男,吉林长春人,北京交通大学副教授,主要研究方向为人工智能、区块链、虚拟现实技术" ]
网络首发:2023-04,
纸质出版:2023-04-25
移动端阅览
袁承昊, 李勇, 任爽. 多关键词动态可搜索加密方案[J]. 网络与信息安全学报, 2023,9(2):143-153.
Chenghao YUAN, Yong LI, Shuang REN. Dynamic multi-keyword searchable encryption scheme[J]. Chinese Journal of Network and Information Security, 2023, 9(2): 143-153.
袁承昊, 李勇, 任爽. 多关键词动态可搜索加密方案[J]. 网络与信息安全学报, 2023,9(2):143-153. DOI: 10.11959/j.issn.2096-109x.2023028.
Chenghao YUAN, Yong LI, Shuang REN. Dynamic multi-keyword searchable encryption scheme[J]. Chinese Journal of Network and Information Security, 2023, 9(2): 143-153. DOI: 10.11959/j.issn.2096-109x.2023028.
云存储用户将数据外包存储至云服务器以节省本地存储资源。然而,云存储数据脱离了用户的物理控制范围,可导致云端隐私数据被恶意窃取或泄露。目前动态可搜索加密方案多以对称可搜索加密为主,需要预先建立安全的密钥共享信道,难以直接应用于云存储数据共享场景。针对云存储多方数据的安全共享场景,提出了一种多关键词动态可搜索加密方案。该方案通过引入布谷鸟过滤器构建正向索引,实现数据拥有者对文档及索引的动态添加和删除。同时结合双线性对与拉格朗日插值多项式,可支持多关键词的联合搜索。为降低密文检索阶段的计算开销,采用倒排索引与正向索引结合的构造,以提高云服务器的检索效率。基于判定线性 Diffie-Hellman 问题,在适应性选择关键词攻击下可证明方案的安全性。通过实验分析所提方案在不同数据集中进行关键词搜索及索引更新的执行效率,结果表明所提方案可有效避免检索时间与密文数量的线性相关性,降低了数据量较大情况下更新操作中的计算开销。
Users of cloud storage often outsource their data to cloud servers to save local storage resources.However
cloud storage data is out of the user’s physical control
which may lead to malicious theft or disclosure of private data on cloud.At present
dynamic searchable encryption schemes are mostly based on symmetric searchable encryption
which need to establish a secure key sharing channel in advance
and cannot be directly applied to data sharing in cloud storage scenarios.For the secure sharing scenario of multi-party data in cloud storage
a dynamic multi-keyword searchable encryption scheme was proposed.The forward index was constructed by a cuckoo filter to enable data owners to perform documents and index dynamic updates.The conjunctive multi-keywords search was supported by combining bilinear pairing with Lagrangian interpolation polynomials.To reduce the computational overhead in the ciphertext retrieval phase
a combination of inverted index and forward index was constructed to improve the retrieval efficiency of cloud server.This scheme is provably secure with the indistinguishability in adaptively chosen keyword attack under decision linear Diffie-Hellman problem.Simulation experiments were conducted to analyze the execution efficiency of the scheme for keyword search and index update in different datasets.The results show that the scheme effectively avoids the linear correlation between the retrieval time and the number of ciphertexts
and reduces the computational overhead in the update operation with a large amount of data.
CHAUDHARI S , KUMAR PATHURI S . A comprehensive survey on public auditing for secure cloud storage [J ] . International Journal of Engineering & Technology , 2018 , 7 : 565 - 569 .
SUN P J . Privacy protection and data security in cloud computing:a survey,challenges,and solutions [J ] . IEEE Access , 2019 , 7 : 147420 - 147452 .
SONG D X , WAGNER D , PERRIG A . Practical techniques for searches on encrypted data [C ] // Proceedings of Proceeding 2000 IEEE Symposium on Security and Privacy . 2002 : 44 - 55 .
KAMARA S , PAPAMANTHOU C , ROEDER T . Dynamic searchable symmetric encryption [C ] // Proceedings of the 2012 ACM Conference on Computer and Communications Security . 2012 : 965 - 976 .
STEFANOV E , PAPAMANTHOU C , SHI E , et al . Practical dynamic searchable encryption with small leakage [EB ] . Cryptology ePrint Archive , 2013 .
BOST R , MINAUD B , OHRIMENKO O . Forward and backward private searchable encryption from constrained cryptographic primitives [C ] // Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . 2017 : 1465 - 1482 .
CHAMANI J G , PAPADOPOULOS D , PAPAMANTHOU C , et al . New constructions for forward and backward private symmetric searchable encryption [C ] // Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security . 2018 : 1038 - 1055 .
DEMERTZIS I , CHAMANI J G , PAPADOPOULOS D , et al . Dynamic searchable encryption with small client storage [EB ] . Cryptology ePrint Archive , 2019 .
ZHONG H , LI Z F , CUI J , et al . Efficient dynamic multi-keyword fuzzy search over encrypted cloud data [J ] . Journal of Network and Computer Applications , 2020 ,149:102469.
ZHANG Y , YOU L , LI Y . Tree-based public key encryption with conjunctive keyword search [J ] . Security and Communication Networks , 2021 , 2021 : 1 - 16 .
FAN B , ANDERSEN D G , KAMINSKY M , et al . Cuckoo filter:practically better than bloom [C ] // Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies . 2014 : 75 - 88 .
HE D B , MA M M , ZEADALLY S , et al . Certificateless public key authenticated encryption with keyword search for industrial Internet of Things [J ] . IEEE Transactions on Industrial Informatics , 2018 , 14 ( 8 ): 3618 - 3627 .
ZHANG R , XUE R . Efficient keyword search for public-key setting [C ] // Proceedings of MILCOM 2015-2015 IEEE Military Communications Conference . 2015 : 1236 - 1241 .
YE F H , DONG X L , SHEN J C , et al . A verifiable dynamic multi-user searchable encryption scheme without trusted third parties [C ] // Proceedings of 2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS) . 2020 : 896 - 900 .
GUO C , ZHUANG R H , CHANG C C , et al . Dynamic multi-keyword ranked search based on bloom filter over encrypted cloud data [J ] . IEEE Access , 2019 , 7 : 35826 - 35837 .
SONG C G , LIU X , YAN Y L . Efficient Public key encryption with field-free conjunctive keywords search [C ] // Proceedings of International Conference on Trusted Systems . 2015 : 394 - 406 .
0
浏览量
320
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621