{"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":"11 1","pages":"0"},"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.