Computer Networks最新文献_第10页

Traceable and revocable large universe multi-authority attribute-based access control with resisting key abuse 可追溯可撤销的大范围多权威属性访问控制与抗密钥滥用

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-10 DOI: 10.1016/j.comnet.2025.111694

Kaiqing Huang

{"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":"10.1016/j.comnet.2025.111694","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.6,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145106435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ASR: Average secrecy rate of UAV-assisted MEC networks with random eavesdroppers ASR：带有随机窃听器的无人机辅助MEC网络的平均保密率

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111695

Yan Li , Caoshuai Zhu , Lailong Luo , Bangbang Ren , Deke Guo

{"title":"ASR: Average secrecy rate of UAV-assisted MEC networks with random eavesdroppers","authors":"Yan Li , Caoshuai Zhu , Lailong Luo , Bangbang Ren , Deke Guo","doi":"10.1016/j.comnet.2025.111695","DOIUrl":"10.1016/j.comnet.2025.111695","url":null,"abstract":"<div><div>The rapid development of unmanned aerial vehicle (UAV) technology and mobile edge computing (MEC) has created new opportunities for efficient data processing and transmission. UAV-assisted MEC enables data transmission from UAVs to a base station (BS) equipped with MEC capabilities. However, ensuring the security of these transmissions is a concern, especially when UAVs operate in open airspace. In this paper, we introduce a coordinated multi-point (CoMP) offloading model aimed at enhancing the secure transmission performance of the network. The airspace is divided into several equal-sized hexagonal cells, with multiple UAVs collaborating to offload data to a BS with MEC. During this process, the locations of potential eavesdroppers are randomized as they attempt to intercept the data transmitted by the UAVs. Based on this model, we first derive the success communication probability (SCP) for a typical BS and an eavesdropper using stochastic geometry. We then introduce the concept of secure transmission rate, precisely the average secrecy rate (ASR). Further, we characterize the ASR in the presence of random eavesdroppers. Finally, we analyze the effects of various parameters on transmission performance. The results of our simulations closely align with our numerical findings, confirming the accuracy of our analysis. Notably, the ASR of the proposed system is nearly four times higher than that of an offloading model without cooperation. Moreover, compared to a user-centric offloading model with CoMP, the ASR increases by 5.37 %, enhancing system performance and reducing search overheads.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111695"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145106433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Truthful mechanisms for partial and full allocation in a multi-mapping multi-tasking allocation system in mobile edge computing 移动边缘计算中多映射多任务分配系统中部分和全部分配的真实机制

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111677

Xi Liu , Jun Liu , Wenguo Chen , Changqing Du , Xiuhua Zeng

{"title":"Truthful mechanisms for partial and full allocation in a multi-mapping multi-tasking allocation system in mobile edge computing","authors":"Xi Liu , Jun Liu , Wenguo Chen , Changqing Du , Xiuhua Zeng","doi":"10.1016/j.comnet.2025.111677","DOIUrl":"10.1016/j.comnet.2025.111677","url":null,"abstract":"<div><div>In this paper, we address the multi-mapping multi-task allocation and pricing problem in mobile edge computing (MEC). Based on different allocation scenarios, we propose partial and full allocation models. The partial model enables an MD’s tasks to be partially offloaded with the MD bidding for a single task to be performed on the server (one bid per task). The full model offloads all or none of the MD’s tasks with the MD bidding for all of them together. We consider a multi-mapping multi-tasking model with platform constraints to enable mobile devices to offload tasks to multiple servers that meet the platform and version requirements. This paper aims to solve the social welfare maximization problem which is the sum of MDs’ valuations. We propose the greedy mechanisms for the partial and full allocation models, respectively. Selfish MDs have an incentive to manipulate the bidding system by making untrue bids to obtain a greater allocation. Therefore, we demonstrate that our proposed mechanisms achieve truthfulness, which drives the system into an equilibrium in which no MD has incentives to maximize utility by untruthfully declaring valuations. Moreover, we show the proposed two mechanisms achieve the desired properties, including computation efficiency and individual rationality. Experiment results show that the proposed mechanisms obtain near-optimal solutions in a reasonable amount of time.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111677"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Attention map-driven compressive sensing for stable and high-accuracy distributed data storage in mobile crowdsensing systems 关注地图驱动的压缩感知用于移动众测系统中稳定高精度的分布式数据存储

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111670

Xingting Liu , Siwang Zhou , Ting Dong , Deyan Tang , Jianping Yu , Yu Peng

{"title":"Attention map-driven compressive sensing for stable and high-accuracy distributed data storage in mobile crowdsensing systems","authors":"Xingting Liu , Siwang Zhou , Ting Dong , Deyan Tang , Jianping Yu , Yu Peng","doi":"10.1016/j.comnet.2025.111670","DOIUrl":"10.1016/j.comnet.2025.111670","url":null,"abstract":"<div><div>In Mobile Crowdsensing (MCS) systems, distributed data storage (DDS) faces challenges of unstable reconstruction accuracy due to uneven environmental data distribution and reliance on randomized measurement collection. Existing approaches often fail to adapt to regional data heterogeneity, leading to suboptimal performance. To address this, we propose an intelligent compressive sensing strategy that integrates an attention map-guided measurement selection mechanism. Initially, a small subset of measurements is utilized to generate an attention map, which dynamically identifies data-dense regions. The central server then prioritizes additional measurements based on this map, enhancing both reconstruction accuracy and stability. Theoretical analysis demonstrates that the proposed method achieves a significant reduction in reconstruction error compared to conventional random sampling strategies. Extensive simulations under real-world urban sensing scenarios further validate its superiority, showing marked improvements in both reconstruction quality and stability. This approach establishes a robust framework for adaptive data collection in large-scale MCS applications, effectively addressing the challenges of uneven data distribution while maintaining resource efficiency.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111670"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

From one-one to one-many: ORCA enables scalable and revocable group covert communication on blockchain 从一对一到一对一多：ORCA在区块链上实现可扩展和可撤销的组隐蔽通信

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111671

Zhujun Wang , Lejun Zhang , Xueqing Li , Shen Su , Jing Qiu , Tie Qiu , Ran Guo

{"title":"From one-one to one-many: ORCA enables scalable and revocable group covert communication on blockchain","authors":"Zhujun Wang , Lejun Zhang , Xueqing Li , Shen Su , Jing Qiu , Tie Qiu , Ran Guo","doi":"10.1016/j.comnet.2025.111671","DOIUrl":"10.1016/j.comnet.2025.111671","url":null,"abstract":"<div><div>The decentralized and immutable nature of blockchainprovides a resilient foundation for covert communication in adversarial and untrusted environments, specifically in scenarios requiring unobservable multi-recipient messaging. Most existing schemes, however, are limited to one-to-one transmission and lack mechanisms to handle untrusted receivers, which constrains their scalability and security. To address these challenges, we propose ORCA (Orthogonal Covert Architecture), a group covert communication framework based on strictly orthogonal, integer-valued codewords. ORCA selects codewords from a Hadamard matrix and applies secret column permutations to ensure decoding isolation and resistance against inference attacks. Each receiver recovers only its assigned message through projection, without coordination or leakage. This encoding structure supports scalable embedding, seamless receiver revocation, and clean integration with standard transaction fields. In contrast to prior work, we analyze the impact of imperfect orthogonality and provide theoretical bounds on decoding interference. Extensive experiments on real-world Bitcoin blockchain data and comparative evaluation against representative covert communication schemes confirm ORCA’s robustness, high embedding capacity, and statistical indistinguishability from normal blockchain activity. These results establish ORCA as a scalable and secure solution for multi-recipient covert communication in adversarial environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111671"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145106012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Together may be better: A novel framework and high-consistency feature for proxy traffic analysis 合在一起可能会更好：为代理流量分析提供一个新颖的框架和高一致性特性

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111672

Yuantu Luo , Jun Tao , Linxiao Yu , Yuehao Zhu

{"title":"Together may be better: A novel framework and high-consistency feature for proxy traffic analysis","authors":"Yuantu Luo , Jun Tao , Linxiao Yu , Yuehao Zhu","doi":"10.1016/j.comnet.2025.111672","DOIUrl":"10.1016/j.comnet.2025.111672","url":null,"abstract":"<div><div>Encrypted and proxy-based traffic has been critical in ensuring communication security but also pose significant challenges for traffic analysis, such as obscured traffic patterns, the inability to correlate pre- and post-proxy flows, and the increased complexity of analyzing encapsulated data. To address these challenges and enable comprehensive proxy traffic analysis, this paper proposes <em>TrafficTracer</em>, a novel proxy traffic capturing framework designed to overcome limitations in existing methods, such as port-missing issues and the inability to correlate pre- and post-proxy traffic. By modifying the open-source proxy application Clash, <em>TrafficTracer</em> extracts inner connection information, enabling complete traffic flow tracing. Furthermore, building on the whole-procedure proxy traffic captured by <em>TrafficTracer</em>, we design Flow Reversals (FR), a robust feature capturing the consistency of traffic flow characteristics before and after proxy encapsulation. Experimental evaluations demonstrate that <em>TrafficTracer</em> significantly enhances raw packet capture efficiency and alleviates port-missing issues. Moreover, FR exhibits strong proxy feature invariability and temporal consistency, outperforming traditional features in maintaining pre- and post-proxy traffic correlations. These results indicate that leveraging <em>TrafficTracer</em> and FR can effectively facilitate the analysis of the entire proxy traffic procedure and hold promise for traffic analysis performance improvement.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111672"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ESSL: Enhanced Sliding Skip List index with adaptive dynamic weights for blockchain data ESSL：对区块链数据具有自适应动态权重的增强滑动跳跃表索引

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111651

Yuxin Hong , Zhijun Xie , Chuhe Lin , Wei Zhang , Xiang Wang , Yuanmin Hu

{"title":"ESSL: Enhanced Sliding Skip List index with adaptive dynamic weights for blockchain data","authors":"Yuxin Hong , Zhijun Xie , Chuhe Lin , Wei Zhang , Xiang Wang , Yuanmin Hu","doi":"10.1016/j.comnet.2025.111651","DOIUrl":"10.1016/j.comnet.2025.111651","url":null,"abstract":"<div><div>Blockchain provides trustworthy storage for the Industrial Internet of Things (IIoT), yet its inefficient data retrieval remains a critical bottleneck for real-world IIoT applications. Addressing the time-sensitive, uneven, and cyclical nature of IIoT data queries, this paper proposes an Enhanced Sliding Skip List (ESSL) index with adaptive dynamic weights for on-chain data retrieval. ESSL integrates time, frequency, and long-term trend weights into a unified dynamic framework and introduces a weight-driven reconstruction mechanism that replaces static randomness with normalized probabilistic promotion. This design achieves a balance between real-time responsiveness and long-term stability, making ESSL particularly well-suited for dynamic IIoT environments. Compared to the original Sliding Skip List (SSL), ESSL improves retrieval efficiency by 28%, enhances index stability by 30%, and reduces redundant layer adjustments by 55%. Extensive experiments across diverse query patterns — including random, range, hotspot, sequential, and hybrid queries — demonstrate that ESSL consistently outperforms SSL and other baseline methods. The proposed dynamic weight model effectively adapts to varying access patterns and ensures robust performance under fluctuating workloads, offering a promising solution for efficient and resilient data retrieval in blockchain-based IIoT systems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111651"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Navigating the 6G landscape: A systematic review of technology integration, implementation challenges, and strategic solutions 导航6G格局：对技术集成、实施挑战和战略解决方案的系统回顾

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111663

Pooja Singh , Akash Agarwal , Preetam Kumar

{"title":"Navigating the 6G landscape: A systematic review of technology integration, implementation challenges, and strategic solutions","authors":"Pooja Singh , Akash Agarwal , Preetam Kumar","doi":"10.1016/j.comnet.2025.111663","DOIUrl":"10.1016/j.comnet.2025.111663","url":null,"abstract":"<div><div>The rapid evolution of digital technologies necessitates a transformative leap in wireless communication, making Sixth-Generation (6G) a significant goal for future connectivity. This paper stands as the first review to uniquely address the integration of multiple technologies, and network monetization strategies within the 6G landscape. An exhaustive analysis of the latest advances in 6G research is presented, emphasizing on innovative monetization approaches that would enhance the adoption and deployment of 6G networks. Additionally, the current state-of-the-art in both academia and industrial research within the 6G domain has been explored. This investigation focuses on key performance indicators, target parameters, and enabling technologies that would shape the future of wireless communication. The review highlights the advantages and disadvantages of various 6G technologies, including their potential to enhance performance metrics and create new revenue streams. Furthermore, the impact of 6G on existing communication networks is analyzed through a comparative analysis of performance metrics from 1G to 6G. Moreover, to bridge the gap between academia and industry, this paper provides a distinctive perspective on the network monetization opportunities and challenges in the 6G domain. Finally, based on the updated and exhaustive review, the paper concludes with pragmatic suggestions to pursue future research directions. These insights aim to develop sustainable and profitable 6G ecosystems that could enable innovations such as immersive virtual experiences, widespread Internet of Things (IoT) applications, and enhanced global connectivity.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111663"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Computation offloading and resource allocation in satellite edge computing networks: A multi-agent reinforcement learning approach 卫星边缘计算网络中的计算卸载与资源分配：一种多智能体强化学习方法

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-09 DOI: 10.1016/j.comnet.2025.111680

Qingxiao Xiu , Jun Liu , Xiangjun Liu , Jintao Wang

{"title":"Computation offloading and resource allocation in satellite edge computing networks: A multi-agent reinforcement learning approach","authors":"Qingxiao Xiu , Jun Liu , Xiangjun Liu , Jintao Wang","doi":"10.1016/j.comnet.2025.111680","DOIUrl":"10.1016/j.comnet.2025.111680","url":null,"abstract":"<div><div>The development of Low Earth Orbit (LEO) satellite networks and Mobile Edge Computing (MEC) technologies supports the placement of MEC servers on LEO satellites, facilitating computation offloading in remote areas where computing resources are limited. However, the on-board computing and communication resources of LEO satellite networks are similarly constrained, while the system environment remains highly dynamic and complex. Moreover, diverse task requirements often require offloading across multiple time slots, which increases the complexity of offloading decisions and resource allocation for terrestrial tasks. In this study, we model this problem within satellite edge computing networks as a partially observable Markov decision process (POMDP). To achieve effective joint optimization, we introduce a multi-agent recurrent attentional double delayed deep deterministic policy gradient (MARATD3) algorithm. First, we utilize the recurrent neural network (RNN) to summarize historical observations of users, which improves adaptability to dynamic system environments and enables accurate predictions of system states. Then, a multi-head attention mechanism is introduced to strengthen the ability of user agents to capture critical information within the joint state space, reduce interference from irrelevant information, and improve training efficiency. According to the experimental results, MARATD3 achieves a considerable reduction in energy consumption and delay relative to the baseline algorithms while maintaining task delay and resource constraints.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111680"},"PeriodicalIF":4.6,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Blockchain-cloud-based secure data sharing scheme with privacy preservation for Internet of vehicles 基于区块链云的车联网隐私保护安全数据共享方案

IF 4.6 2区计算机科学

Computer Networks Pub Date : 2025-09-08 DOI: 10.1016/j.comnet.2025.111674

Tao Li , Kaizhong Zuo , Peng Hu , LaiShui Lv , Tianjiao Ni , Zhangyi Shen , Dong Xie , Fulong Chen

{"title":"Blockchain-cloud-based secure data sharing scheme with privacy preservation for Internet of vehicles","authors":"Tao Li , Kaizhong Zuo , Peng Hu , LaiShui Lv , Tianjiao Ni , Zhangyi Shen , Dong Xie , Fulong Chen","doi":"10.1016/j.comnet.2025.111674","DOIUrl":"10.1016/j.comnet.2025.111674","url":null,"abstract":"<div><div>Massive road environment data sharing can assist vehicle owners in planning optimal routes, thereby enhancing driving comfort and safety. However, existing vehicular network data-sharing services face privacy and security risks, such as the exposure of vehicle location information. To address these issues, this paper proposes a blockchain-cloud-based secure data sharing scheme with privacy preservation for Internet of vehicles, called BSDS. The scheme first utilizes blockchain and hybrid encryption to design a secure data storage model. The encrypted data is stored on the cloud server, while data credentials are stored on the blockchain, thus preventing malicious tampering with the data on the cloud server and ensuring the integrity of vehicular network data stored in the cloud. Furthermore, conditional privacy-preserving authentication technology is employed to ensure the integrity of vehicular network data during communication and achieve the privacy of identities. Comprehensive security proofs and analysis demonstrate that the proposed scheme meets essential security requirements, including confidentiality, data integrity, non-repudiation, conditional privacy protection. Extensive experimental results show that the scheme performs excellently in terms of computational overhead, communication overhead, network latency, and packet loss rate.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111674"},"PeriodicalIF":4.6,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0