Efficient and secure cross-domain data sharing scheme with traceability for Industrial Internet

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-04-01 Epub Date: 2025-02-13 DOI:10.1016/j.comnet.2025.111117
Wei Luo, Ziyi Lv, Chengzhe Lai, Tengfei Yang
{"title":"Efficient and secure cross-domain data sharing scheme with traceability for Industrial Internet","authors":"Wei Luo,&nbsp;Ziyi Lv,&nbsp;Chengzhe Lai,&nbsp;Tengfei Yang","doi":"10.1016/j.comnet.2025.111117","DOIUrl":null,"url":null,"abstract":"<div><div>As the Industrial Internet undergoes swift growth, secure data sharing has become a crucial issue. However, currently most schemes are mainly applied to single-domain environments, and with the increasing demand for data sharing among various parties, the need for cross-domain data interaction becomes increasingly urgent. To solve the problem, we propose an efficient and secure industrial data cross-domain sharing scheme based on traceable CP-ABE in this paper. Firstly, a traceable and efficient CP-ABE is proposed, called TE-CP-ABE, which utilizes key conversion and key sanity check to reduce the computational complexity of the client and enable the tracking of malicious users, respectively. Secondly, based on TE-CP-ABE and proxy re-encryption technology, we design a traceable and secure cross-domain data sharing scheme for Industrial Internet. This scheme introduces domain proxies for cross-domain authentication and employs proxy re-encryption technology to facilitate policy transformation, breaking down attribute differences between different domains. TE-CP-ABE has been proven to achieve IND-CPA security under the decisional q-BDHE problem, and it efficiently prevents malicious users from abusing their keys. Finally, the proposed scheme is compared with the existing schemes in terms of theoretical analysis and experimental simulation. The results show that the proposed scheme has certain advantages in terms of computing and storage overhead.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111117"},"PeriodicalIF":4.6000,"publicationDate":"2025-04-01","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/S1389128625000854","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

As the Industrial Internet undergoes swift growth, secure data sharing has become a crucial issue. However, currently most schemes are mainly applied to single-domain environments, and with the increasing demand for data sharing among various parties, the need for cross-domain data interaction becomes increasingly urgent. To solve the problem, we propose an efficient and secure industrial data cross-domain sharing scheme based on traceable CP-ABE in this paper. Firstly, a traceable and efficient CP-ABE is proposed, called TE-CP-ABE, which utilizes key conversion and key sanity check to reduce the computational complexity of the client and enable the tracking of malicious users, respectively. Secondly, based on TE-CP-ABE and proxy re-encryption technology, we design a traceable and secure cross-domain data sharing scheme for Industrial Internet. This scheme introduces domain proxies for cross-domain authentication and employs proxy re-encryption technology to facilitate policy transformation, breaking down attribute differences between different domains. TE-CP-ABE has been proven to achieve IND-CPA security under the decisional q-BDHE problem, and it efficiently prevents malicious users from abusing their keys. Finally, the proposed scheme is compared with the existing schemes in terms of theoretical analysis and experimental simulation. The results show that the proposed scheme has certain advantages in terms of computing and storage overhead.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高效、安全、可追溯的工业互联网跨域数据共享方案
随着工业互联网的快速发展,安全的数据共享已成为一个至关重要的问题。然而,目前大多数方案主要应用于单域环境,随着各方对数据共享需求的增加,对跨域数据交互的需求日益迫切。为了解决这一问题,本文提出了一种高效、安全的基于可追溯CP-ABE的工业数据跨域共享方案。首先,提出了一种可跟踪的高效CP-ABE,称为TE-CP-ABE,它利用密钥转换和密钥完整性检查分别降低客户端的计算复杂度和实现对恶意用户的跟踪。其次,基于TE-CP-ABE和代理重加密技术,设计了一种可追溯的、安全的工业互联网跨域数据共享方案。该方案引入域代理进行跨域认证,并采用代理重加密技术方便策略转换,打破了不同域之间的属性差异。在决策q-BDHE问题下,TE-CP-ABE已被证明可以实现IND-CPA安全性,并有效防止恶意用户滥用密钥。最后,将所提方案与现有方案进行了理论分析和实验仿真比较。结果表明,该方案在计算和存储开销方面具有一定的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: 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.
期刊最新文献
Privacy-preserving and secure spectrum sharing for database-driven cognitive radio networks vObliChain: Securing satellite networks with verifiable oblivious search over blockchain databases TraCP: Traffic concentration prior-guided gMLP for APT Detection in extremely imbalanced IIoT traffic Efficient and interpretable IoT botnet detection via feature selection and hyperparameter-optimized XGB SCL-RFM: supervised contrastive learning-based intrusion detection with correlation-driven feature arrangement and regional feature masking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1