{"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}
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 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.