KA2SE:用于无线传感器网络数据共享的密钥聚合授权可搜索加密方案

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-11-04 DOI:10.1109/TSC.2024.3491378
Haijiang Wang;Jianting Ning;Wei Wu;Chao Lin;Kai Zhang
{"title":"KA2SE:用于无线传感器网络数据共享的密钥聚合授权可搜索加密方案","authors":"Haijiang Wang;Jianting Ning;Wei Wu;Chao Lin;Kai Zhang","doi":"10.1109/TSC.2024.3491378","DOIUrl":null,"url":null,"abstract":"As a promising technology, key-aggregation searchable encryption with constant computation overhead is especially suitable for sensor nodes with limited computation resources in wireless sensor networks. However, in most of the existing key-aggregation searchable encryption schemes, the authorized aggregation key is generated in a deterministic way. As a result, these schemes suffer from “<i>Key Forge Attack</i>” and “<i>Trapdoor Forge Attack</i>” that we proposed and hence fail to support the security property as they claimed (which is an important goal to be achieved in key-aggregation searchable encryption schemes). To fix these flaws, in this paper, we identify the security challenges related to key-aggregation searchable encryption and propose a lightweight key-aggregation authorized searchable encryption scheme based on attribute-based encryption, called KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>SE. It enables a data owner to share encrypted data with an authorized query user by issuing only a single authorized aggregation key, and the authorized query user only needs to submit a single trapdoor to the cloud server to perform keyword search. We formulate the security definitions for KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>SE and prove its security. Finally, empirical evaluations demonstrate that KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula> SE is computationally efficient in comparison with existing schemes.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"226-238"},"PeriodicalIF":5.5000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"KA$^{2}$2SE: Key-Aggregation Authorized Searchable Encryption Scheme for Data Sharing in Wireless Sensor Networks\",\"authors\":\"Haijiang Wang;Jianting Ning;Wei Wu;Chao Lin;Kai Zhang\",\"doi\":\"10.1109/TSC.2024.3491378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a promising technology, key-aggregation searchable encryption with constant computation overhead is especially suitable for sensor nodes with limited computation resources in wireless sensor networks. However, in most of the existing key-aggregation searchable encryption schemes, the authorized aggregation key is generated in a deterministic way. As a result, these schemes suffer from “<i>Key Forge Attack</i>” and “<i>Trapdoor Forge Attack</i>” that we proposed and hence fail to support the security property as they claimed (which is an important goal to be achieved in key-aggregation searchable encryption schemes). To fix these flaws, in this paper, we identify the security challenges related to key-aggregation searchable encryption and propose a lightweight key-aggregation authorized searchable encryption scheme based on attribute-based encryption, called KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>SE. It enables a data owner to share encrypted data with an authorized query user by issuing only a single authorized aggregation key, and the authorized query user only needs to submit a single trapdoor to the cloud server to perform keyword search. We formulate the security definitions for KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>SE and prove its security. Finally, empirical evaluations demonstrate that KA<inline-formula><tex-math>$^{2}$</tex-math></inline-formula> SE is computationally efficient in comparison with existing schemes.\",\"PeriodicalId\":13255,\"journal\":{\"name\":\"IEEE Transactions on Services Computing\",\"volume\":\"18 1\",\"pages\":\"226-238\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2024-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Services Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10742408/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10742408/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
KA$^{2}$2SE: Key-Aggregation Authorized Searchable Encryption Scheme for Data Sharing in Wireless Sensor Networks
As a promising technology, key-aggregation searchable encryption with constant computation overhead is especially suitable for sensor nodes with limited computation resources in wireless sensor networks. However, in most of the existing key-aggregation searchable encryption schemes, the authorized aggregation key is generated in a deterministic way. As a result, these schemes suffer from “Key Forge Attack” and “Trapdoor Forge Attack” that we proposed and hence fail to support the security property as they claimed (which is an important goal to be achieved in key-aggregation searchable encryption schemes). To fix these flaws, in this paper, we identify the security challenges related to key-aggregation searchable encryption and propose a lightweight key-aggregation authorized searchable encryption scheme based on attribute-based encryption, called KA$^{2}$SE. It enables a data owner to share encrypted data with an authorized query user by issuing only a single authorized aggregation key, and the authorized query user only needs to submit a single trapdoor to the cloud server to perform keyword search. We formulate the security definitions for KA$^{2}$SE and prove its security. Finally, empirical evaluations demonstrate that KA$^{2}$ SE is computationally efficient in comparison with existing schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
AdaFlow: Learning and Utilizing Workflows for Enhanced Service Recommendation in Dynamic Environments Efficient Online Computation of Business Process State From Trace Prefixes via N-Gram Indexing BlockEmulator: An Emulator Enabling to Test Blockchain Sharding Protocols Service Migration for Delay-Sensitive IoT Applications in Edge Networks Li-MSA: Power Consumption Prediction of Servers Based on Few-Shot Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1