{"title":"可追溯可撤销的大范围多权威属性访问控制与抗密钥滥用","authors":"Kaiqing Huang","doi":"10.1016/j.comnet.2025.111694","DOIUrl":null,"url":null,"abstract":"<div><div>Attribute-based encryption (ABE) is a novel cryptographic technology that enables fine-grained access control over encrypted data. However, there are some problems in the existing attribute-based access control schemes such as key abuse and the requirements of large-scale cross-domain dynamic cooperation. To solve these problems, the author proposes a traceable and revocable large-universe multi-authority attribute-based access control scheme with resisting key abuse (TRKA-D-ABE) with static security under the q-DPBDHE2 assumption. TRKA-D-ABE realizes the dynamic change of attributes, users, and authorities to suit large-scale cross-domain dynamic collaboration by supporting user-attribute revocation, large universes of attributes, users, and authorities. The revocation mechanism resists collusion attacks from both revoked and unrevoked users. It also fulfills the criteria for both forward and backward security. TRKA-D-ABE also implements robust security measures to prevent key abuse attacks from the CSP, authorities, and users. Neither the CSP nor the authority can create a complete decryption key. They are also unable to access any encrypted data, even if their controlled attributes meet the access structure. Users who expose the key will be identified through traceability and punished by revocation. Additionally, users can outsource decryption without key transfer to conserve resources. Based on performance analysis results, TRKA-D-ABE is highly efficient.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111694"},"PeriodicalIF":4.6000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Traceable and revocable large universe multi-authority attribute-based access control with resisting key abuse\",\"authors\":\"Kaiqing Huang\",\"doi\":\"10.1016/j.comnet.2025.111694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Attribute-based encryption (ABE) is a novel cryptographic technology that enables fine-grained access control over encrypted data. However, there are some problems in the existing attribute-based access control schemes such as key abuse and the requirements of large-scale cross-domain dynamic cooperation. To solve these problems, the author proposes a traceable and revocable large-universe multi-authority attribute-based access control scheme with resisting key abuse (TRKA-D-ABE) with static security under the q-DPBDHE2 assumption. TRKA-D-ABE realizes the dynamic change of attributes, users, and authorities to suit large-scale cross-domain dynamic collaboration by supporting user-attribute revocation, large universes of attributes, users, and authorities. The revocation mechanism resists collusion attacks from both revoked and unrevoked users. It also fulfills the criteria for both forward and backward security. TRKA-D-ABE also implements robust security measures to prevent key abuse attacks from the CSP, authorities, and users. Neither the CSP nor the authority can create a complete decryption key. They are also unable to access any encrypted data, even if their controlled attributes meet the access structure. Users who expose the key will be identified through traceability and punished by revocation. Additionally, users can outsource decryption without key transfer to conserve resources. Based on performance analysis results, TRKA-D-ABE is highly efficient.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"272 \",\"pages\":\"Article 111694\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2025-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625006607\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625006607","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
Traceable and revocable large universe multi-authority attribute-based access control with resisting key abuse
Attribute-based encryption (ABE) is a novel cryptographic technology that enables fine-grained access control over encrypted data. However, there are some problems in the existing attribute-based access control schemes such as key abuse and the requirements of large-scale cross-domain dynamic cooperation. To solve these problems, the author proposes a traceable and revocable large-universe multi-authority attribute-based access control scheme with resisting key abuse (TRKA-D-ABE) with static security under the q-DPBDHE2 assumption. TRKA-D-ABE realizes the dynamic change of attributes, users, and authorities to suit large-scale cross-domain dynamic collaboration by supporting user-attribute revocation, large universes of attributes, users, and authorities. The revocation mechanism resists collusion attacks from both revoked and unrevoked users. It also fulfills the criteria for both forward and backward security. TRKA-D-ABE also implements robust security measures to prevent key abuse attacks from the CSP, authorities, and users. Neither the CSP nor the authority can create a complete decryption key. They are also unable to access any encrypted data, even if their controlled attributes meet the access structure. Users who expose the key will be identified through traceability and punished by revocation. Additionally, users can outsource decryption without key transfer to conserve resources. Based on performance analysis results, TRKA-D-ABE is highly efficient.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.