An Efficient Key-Aggregate Keyword Searchable Encryption for Data Sharing in Cloud Storage

Xuqi Wang, Yu Xie, Xiangguo Cheng, Zhengtao Jiang
{"title":"An Efficient Key-Aggregate Keyword Searchable Encryption for Data Sharing in Cloud Storage","authors":"Xuqi Wang, Yu Xie, Xiangguo Cheng, Zhengtao Jiang","doi":"10.1109/GCWkshps45667.2019.9024540","DOIUrl":null,"url":null,"abstract":"One key focus of cloud storage is keyword search on encrypted data. In a cloud-based secure data sharing system, users need to search keywords on encrypted data in order to data confidentiality and query privacy. Moreover, a large number of trapdoors should be generated by users with his/her keys and submitted to the cloud. Some researches on searchable encryption with key-aggregate have been conducted in recent years, which shortened the number of keys and trapdoors to a constant. However, the computational overhead and communication costs are largely neglected in the literature. In this paper, we propose an efficient key-aggregate keyword searchable encryption (eKAKSE) scheme. Generally, this scheme does not need to generate substantial parameters when the system is established. It dramatically reduces the computational overhead in the case of resisting the eavesdropping problem. We formulate the security definitions for eKAKSE and prove its security. The simulation results show that the computational overhead of the proposed scheme is more efficient than that of other schemes.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCWkshps45667.2019.9024540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

One key focus of cloud storage is keyword search on encrypted data. In a cloud-based secure data sharing system, users need to search keywords on encrypted data in order to data confidentiality and query privacy. Moreover, a large number of trapdoors should be generated by users with his/her keys and submitted to the cloud. Some researches on searchable encryption with key-aggregate have been conducted in recent years, which shortened the number of keys and trapdoors to a constant. However, the computational overhead and communication costs are largely neglected in the literature. In this paper, we propose an efficient key-aggregate keyword searchable encryption (eKAKSE) scheme. Generally, this scheme does not need to generate substantial parameters when the system is established. It dramatically reduces the computational overhead in the case of resisting the eavesdropping problem. We formulate the security definitions for eKAKSE and prove its security. The simulation results show that the computational overhead of the proposed scheme is more efficient than that of other schemes.
面向云存储数据共享的高效Key-Aggregate关键字可搜索加密
云存储的一个重点是对加密数据的关键字搜索。在基于云的安全数据共享系统中,用户需要对加密后的数据进行关键字搜索,以保证数据的保密性和查询隐私性。此外,用户需要使用自己的密钥生成大量的活板门,并提交给云。近年来进行了一些基于密钥聚合的可搜索加密研究,将密钥和活门的数量缩短到一个常数。然而,在文献中,计算开销和通信成本在很大程度上被忽视。本文提出了一种高效的密钥聚合关键字可搜索加密(eKAKSE)方案。一般情况下,该方案在系统建立时不需要产生实质性的参数。它极大地减少了在抵抗窃听问题的情况下的计算开销。给出了eKAKSE的安全定义,并证明了其安全性。仿真结果表明,该方案的计算量比其他方案更高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信