Computer Networks最新文献_第9页

Blockchain-based anonymous and self-tallying voting with time-bounded ballot secrecy 基于区块链的匿名和自我统计投票，具有有时间限制的投票保密

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-18 DOI: 10.1016/j.comnet.2025.111217

Yijie Shi , Kai Fan , Yuhan Bai , Chonglin Zhang , Kuan Zhang , Hui Li , Yintang Yang

引用次数: 0

GenNP: A low-threshold and powerful network performance data generator GenNP：一个低阈值和强大的网络性能数据生成器

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-18 DOI: 10.1016/j.comnet.2025.111209

Fang Yang, Tao Ma, Chunlai Ma, Nina Shu, Chao Chang, Chunsheng Liu, Tao Wu, Xingkui Du

{"title":"GenNP: A low-threshold and powerful network performance data generator","authors":"Fang Yang, Tao Ma, Chunlai Ma, Nina Shu, Chao Chang, Chunsheng Liu, Tao Wu, Xingkui Du","doi":"10.1016/j.comnet.2025.111209","DOIUrl":"10.1016/j.comnet.2025.111209","url":null,"abstract":"<div><div>The existing Discrete Event Simulators (DES) cannot meet the demands of modern networks for efficient, accurate, and flexible simulation. Recent <strong>m</strong>achine <strong>l</strong>earning models have demonstrated exceptional capabilities for <strong>e</strong>stimating <strong>n</strong>etwork <strong>p</strong>erformance (MLENP). However, the quality and quantity of available data greatly limit the accuracy and generalizability of ML models. After analyzing the data requirements of MLENP over the past decade and the shortcomings of existing DES, we propose a low-threshold and powerful <strong>n</strong>etwork <strong>p</strong>erformance data <strong>gen</strong>erator (GenNP), and generate a network performance dataset consisting of 10K samples. GenNP, with OMNeT＋＋ and INET at its simulation core, integrates the configuration generation layer, simulation transformation layer, result extraction layer, and result output layer, achieving massive random generation of simulation configurations (networks, traffic, routing protocols, faults) and multi-granularity extraction of network performance data (throughput, drop, delay, jitter, routing table). We validate the robust capabilities of GenNP through a series of simulation experiments across multi-granularity (spatial, temporal), diversity (traffic models, network load, fault types, routing protocols), and efficiency (parallelism).</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111209"},"PeriodicalIF":4.4,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143679702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lightweight authenticated key agreement scheme for IoMT network using generalized Chinese Remainder Theorem 基于广义中国剩余定理的IoMT网络轻量级认证密钥协议方案

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-18 DOI: 10.1016/j.comnet.2025.111212

Chandan Goswami , Aniket Basak , Rajeet Ghosh , Avishek Adhikari , Pinaki Sarkar

{"title":"Lightweight authenticated key agreement scheme for IoMT network using generalized Chinese Remainder Theorem","authors":"Chandan Goswami , Aniket Basak , Rajeet Ghosh , Avishek Adhikari , Pinaki Sarkar","doi":"10.1016/j.comnet.2025.111212","DOIUrl":"10.1016/j.comnet.2025.111212","url":null,"abstract":"<div><div>Rapid advancement of the Internet of Things (IoT) is revolutionizing various sectors of our daily lives; healthcare being a prime beneficiary. Likelihood of viral infections among medical personnel has drastically decreased with the introduction of wireless monitoring platforms in the Internet of Medical Things (IoMT) network. Recent developments in wireless communications and computer systems have further enhanced the efficiency, security, and privacy of the entire healthcare industry. However, integrating IoT with electronic health (e-health) management systems presents several challenges, including secure communications over insecure channels, authentication, and key agreement among participating devices. This manuscript introduces a secure three-factor (user, medical server, and sensor device) lightweight mutual authenticated key agreement scheme (KAS) based on the Chinese Remainder Theorem (CRT) for an arbitrary number of co-primes in the IoMT network. We present a formal semantic security analysis of our proposed protocol using the Real-Or-Random (ROR) model for computational security. Moreover, simulation results using the Automated Validation of Internet Security Protocols and Applications (AVISPA) show that the proposed scheme is safe against well-known active and passive threats. Our proposed scheme is well-designed to perform efficiently, reducing both computation cost and communication cost. Finally, the proposed scheme has significant security advantages and performance benefits, making the scheme more efficient, secure, and robust compared to its state-of-the-art counterparts.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111212"},"PeriodicalIF":4.4,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687202","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

Quantum-resistant ring signature-based authentication scheme against secret key exposure for VANETs 基于量子抵抗环签名的vanet密钥暴露认证方案

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111213

Xiaoling Yu , Yuntao Wang , Xin Huang

{"title":"Quantum-resistant ring signature-based authentication scheme against secret key exposure for VANETs","authors":"Xiaoling Yu , Yuntao Wang , Xin Huang","doi":"10.1016/j.comnet.2025.111213","DOIUrl":"10.1016/j.comnet.2025.111213","url":null,"abstract":"<div><div>Vehicular ad-hoc networks (VANETs) can improve traffic management efficiency and driving safety to support the construction of Intelligent Transportation System. Privacy protection in VANETs is one of the challenges that cannot be ignored. To this end, the ring signature is a promising cryptographic primitive for providing privacy protection and authentication. However, in practical ring signature-based VANETs, secret keys of vehicle users used for signing are often exposed because of network attacks or careless use. So far, most predecessors do not guarantee security from secret key exposure. Moreover, many existing ring signature-based systems for VANETs are fragile under quantum computer attacks. In this paper, we construct the first forward secure ring signature scheme from lattices. Based on this scheme, we then design a ring signature-based authentication system for VANETs to guarantee privacy-preserving authentication, message integrity, forward security, and post-quantum security. Our scheme combines the binary tree and lattice basis delegation technique to realize a one-way key update mechanism, where secret keys are ephemeral and updated with generating nodes in the binary tree. Thus, the adversary cannot forge the past signature even if the users’ present secret keys are revealed, which can reduce the damage from key exposure. Furthermore, we give rigorous security proof under the hardness assumption of the underlying Small Integer Solution (SIS) problem in lattice-based cryptography to realize post-quantum security. Finally, we show simulation experiments and comparative analysis to evaluate its performance.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111213"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143642189","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

Machine learning approaches for active queue management: A survey, taxonomy, and future directions 主动队列管理的机器学习方法：调查、分类和未来方向

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111174

Mohammad Parsa Toopchinezhad, Mahmood Ahmadi

{"title":"Machine learning approaches for active queue management: A survey, taxonomy, and future directions","authors":"Mohammad Parsa Toopchinezhad, Mahmood Ahmadi","doi":"10.1016/j.comnet.2025.111174","DOIUrl":"10.1016/j.comnet.2025.111174","url":null,"abstract":"<div><div>Active Queue Management (AQM), a network-layer congestion control technique endorsed by the Internet Engineering Task Force (IETF), encourages routers to discard packets before the occurrence of buffer overflow. Traditional AQM techniques often employ heuristic approaches that require meticulous parameter adjustments, limiting their real-world applicability. In contrast, Machine Learning (ML) approaches offer highly adaptive, data-driven solutions custom to dynamic network conditions. Consequently, many researchers have adapted ML for AQM throughout the years, resulting in a wide variety of algorithms ranging from predicting congestion via supervised learning to discovering optimal packet-dropping policies with reinforcement learning. Despite these remarkable advancements, no previous work has compiled these methods in the form of a survey article. This paper presents the first thorough documentation and analysis of ML-based algorithms for AQM, in which the strengths and limitations of each proposed method are evaluated and compared. In addition, a novel taxonomy of ML approaches based on methodology is also established. The review is concluded by discussing unexplored research gaps and potential new directions for more robust ML-AQM methods.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111174"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143643851","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

Simulators for quantum network modeling: A comprehensive review 量子网络建模模拟器：全面回顾

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111204

Oceane Bel , Mariam Kiran

引用次数: 0

Collision avoidance by mitigating uncertain packet loss in multi-hop wireless IoT networks 通过减轻多跳无线物联网网络中的不确定丢包来避免碰撞

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111205

Woo-Hyeok Jang, Seung-Jae Han

{"title":"Collision avoidance by mitigating uncertain packet loss in multi-hop wireless IoT networks","authors":"Woo-Hyeok Jang, Seung-Jae Han","doi":"10.1016/j.comnet.2025.111205","DOIUrl":"10.1016/j.comnet.2025.111205","url":null,"abstract":"<div><div>Multi-hop wireless relaying is an effective solution to provide connectivity to IoT devices in places that are difficult to reach. Spatial reuse for higher spectral efficiency by allowing simultaneous transmissions, however, causes self-interference unless transmissions are carefully coordinated. To solve this issue, recently, ML(Machine Learning)-based transmission scheduling has been explored in many literatures. Existing ML-based schemes, however, have limitation in that they do not account for the control overhead associated with schedule deployment and network state collection. In this paper, we propose a DRL (Deep Reinforcement Learning)-based TDMA scheduling scheme that aims to optimize network throughput and minimize energy consumption while avoiding collisions. More specifically, we use a Sequence-to-Sequence (S2S) neural network to compose the DRL policy. One of the key novelties of our scheme is that the schedule deployment is conducted sparsely to reduce the control overhead. This causes uncertainties due to the random packet losses, and we mitigate the uncertainties via a technique called redundant scheduling. Simulation results demonstrate that the proposed scheme is scalable and converges quickly, and it outperforms existing schemes under various network conditions.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111205"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143642190","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

Defeating CSI obfuscation mechanisms: A study on unauthorized Wi-Fi Sensing in wireless sensor network 击败CSI混淆机制：无线传感器网络中未经授权的Wi-Fi传感研究

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111208

Zhiming Chu , Guyue Li , Qingchun Meng , Haobo Li , Yuwei Zeng

{"title":"Defeating CSI obfuscation mechanisms: A study on unauthorized Wi-Fi Sensing in wireless sensor network","authors":"Zhiming Chu , Guyue Li , Qingchun Meng , Haobo Li , Yuwei Zeng","doi":"10.1016/j.comnet.2025.111208","DOIUrl":"10.1016/j.comnet.2025.111208","url":null,"abstract":"<div><div>The proliferation of Wi-Fi sensing technology has raised significant privacy concerns due to potential unauthorized environmental monitoring. As a typical countermeasure, the Channel State Information (CSI) fuzzer uses a time-varying filter at the transmitter to obfuscate CSI, allowing only legitimate receiver who has the pre-shared filter parameters as keys to restore the original CSI. In this work, we present SnoopFi, a framework enabling unauthorized reconstruction of environment-matching sensing signals from obfuscated CSI, even with limited training samples. SnoopFi acquires accurate raw CSI when attackers exploit security vulnerabilities to obtain keys. It can also generate a new base signal that reflect the physical environment for sensing when the attackers’ capabilities are limited. SnoopFi employs two strategies to negate the filter’s effects: (1) The attacker first attempts to guess the keys, and then it inverts the filter by modeling the nonlinear relationship between the filter’s response and the keys; (2) With multiple receiving antennas, the attacker utilizes the ratio of CSIs between different antennas to wipe off the filter effect. Once the obfuscation is removed, SnoopFi uses a few-shot learning technique for precise sensing of user localization with constrained training samples. The experimental results show that SnoopFi achieves localization accuracies of 91.79% and 92.05% under the two strategies, respectively, with an average of only 18 samples per class.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111208"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687299","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

SAGTM: A secure authentication scheme with traceability for avatars in the Metaverse SAGTM：具有可追溯性的安全身份验证方案，用于虚拟世界中的角色

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111206

Xingyu Liang , Sen Wang , Ling Xiong , Zhicai Liu , Neal N. Xiong

{"title":"SAGTM: A secure authentication scheme with traceability for avatars in the Metaverse","authors":"Xingyu Liang , Sen Wang , Ling Xiong , Zhicai Liu , Neal N. Xiong","doi":"10.1016/j.comnet.2025.111206","DOIUrl":"10.1016/j.comnet.2025.111206","url":null,"abstract":"<div><div>The Metaverse, by integrating virtual and physical worlds, offers a digital platform that transcends the limitations of time and space, enabling users to engage in entertainment, work, and social interactions. However, these applications also introduce privacy risks, making robust identity authentication systems crucial. Traditional security measures are inefficient and inadequate for the unique requirements of Metaverse environments. The anonymous credential scheme, as a method of anonymous authentication, can effectively prevent attackers from accessing avatar information while ensuring that the accessing server cannot identify the avatar, thereby protecting avatar privacy. Moreover, it facilitates the tracking and management of malicious avatar behavior. Towards this advanced goal, this work proposes a blockchain-based supervised authentication scheme using anonymous credentials. Firstly, non-interactive zero-knowledge proofs are integrated into anonymous credentials technology to achieve avatar anonmity and unlinkability. Secondly, the distributed ElGamal encryption algorithm is used to enable traceability for locating malicious users. Finally, to verify the avatar’s access permission, the proposed scheme combines an accumulator into blockchain technology, enabling the access server to verify the level of access while maintaining anonymity and unlinkability. Security analysis demonstrates that our scheme possesses advantages such as traceability, unlinkability, anonymity, and forgery resistance. Experimental results indicate that the proposed scheme outperforms other anonymous authentication schemes in terms of performance overhead. Therefore, our scheme is more efficient and practical compared to other anonymous schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111206"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687313","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

Discrete dimensional coordinate scheme for distributed aggressive forwarding in mobile ad-hoc networks: An effective approach 移动自组网中分布式主动转发的离散维坐标方案：一种有效方法

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-03-17 DOI: 10.1016/j.comnet.2025.111172

Saurabh Singh

{"title":"Discrete dimensional coordinate scheme for distributed aggressive forwarding in mobile ad-hoc networks: An effective approach","authors":"Saurabh Singh","doi":"10.1016/j.comnet.2025.111172","DOIUrl":"10.1016/j.comnet.2025.111172","url":null,"abstract":"<div><div>The simplistic approach of greedy forwarding (GF) makes it much more popular on resource-crunched wireless mobile networks. The GF also has some major drawbacks in dealing with local minimums and cross-link connections (Lee et al., 2010) <span><span>[1]</span></span>. We researched the reason behind it and found out that the Cartesian coordinate system and method of distance calculation (Euclidean distance) are the reasons behind it. We propose a discrete-dimensional coordinate system (DDCS) and greedy forwarding designed over it, i.e., DDCS-GF (Discrete Dimensional Coordinate System-based Greedy Forwarding). DDCS-GF outperforms the classic GF in dealing with cross-link and local minimum problems. DDCS-GF is better compatible with MANET as it has a decentralized approach for the localization of mobile nodes. Simulation results show that the packet delivery ratio of DDCS-GF is at least 2%–3% higher than that of classic greedy forwarding approaches over the mobile ad hoc network. By extending the number of viable routes and decreasing energy waste from local minimums and collisions, it also extends the network lifetime by 2%–4%.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111172"},"PeriodicalIF":4.4,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687206","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