Ruijin Wang , Jinbo Wang , Xiong Li , Jinshan Lai , Fengli Zhang , Xikai Pei , Muhammad Khurram Khan
{"title":"CESA: Communication efficient secure aggregation scheme via sparse graph in federated learning","authors":"Ruijin Wang , Jinbo Wang , Xiong Li , Jinshan Lai , Fengli Zhang , Xikai Pei , Muhammad Khurram Khan","doi":"10.1016/j.jnca.2024.103997","DOIUrl":"10.1016/j.jnca.2024.103997","url":null,"abstract":"<div><p>As a distributed learning paradigm, federated learning can be effectively applied to the decentralized system since it can resolve the “data island” problem. However, it is also vulnerable to serious privacy breaches. Although existing secure aggregation technique can address privacy concerns, they also incur significant additional computation and communication costs. To address these challenges, this paper offers a <u>C</u>ommunication <u>E</u>fficient <u>S</u>ecure <u>A</u>ggregation scheme. Firstly, the central server uses the communication delay between terminals as the weight of the fully terminal-connected graph to transform it into a sparse connected graph based on the minimal spanning tree. Secondly, instead of relying on central server for key advertisement, the terminals advertise keys via a neighboring terminal forwarding approach based on sparsely graph. Thirdly, we propose using the central server for auxiliary advertising to address unexpected terminal dropout. Simultaneously, we theoretically demonstrate our scheme’s security and have lower computation and communication costs. Experiments show that CESA can reduce the running time by 28.2% without sacrificing security and model accuracy compared to conventional secure aggregation when there are 10 terminals in the system.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103997"},"PeriodicalIF":7.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012562","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}
{"title":"A survey on security issues in IoT operating systems","authors":"Panjun Sun, Yi Wan, Zongda Wu, Zhaoxi Fang","doi":"10.1016/j.jnca.2024.103976","DOIUrl":"10.1016/j.jnca.2024.103976","url":null,"abstract":"<div><p>The security issues of the core (operating systems) of the Internet of Things (IoT) are becoming increasingly urgent and prominent, this article conducts a systematic research and summary of the security of the current mainstream IoT operating system. Firstly, based on the architecture and applications functions of IoT devices, this article introduces the concept of operating system security, analyzes and studies the security vulnerabilities, key technologies, and attack and defense security mechanisms of operating systems. Secondly, this article investigates the application scenario used by IoT operating systems, such as smart homes, smart healthcare, smart industries, blockchain, and the Internet of Vehicles. Next, from the perspective of building a complete security system, this article investigates the security mechanisms, security frameworks, security kernels, platform integrity, and security testing of IoT operating systems. Finally, this article points out the security challenges and opportunities faced by IoT operating systems, summarizes the current research status, and puts forward corresponding suggestions.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103976"},"PeriodicalIF":7.7,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904703","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}
Nguyen Thi My Binh , Huynh Thi Thanh Binh , Ho Viet Duc Luong , Nguyen Tien Long , Trinh Van Chien
{"title":"An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks","authors":"Nguyen Thi My Binh , Huynh Thi Thanh Binh , Ho Viet Duc Luong , Nguyen Tien Long , Trinh Van Chien","doi":"10.1016/j.jnca.2024.103985","DOIUrl":"10.1016/j.jnca.2024.103985","url":null,"abstract":"<div><p>Barrier coverage in Wireless Sensor Networks (WSNs) plays a pivotal role in surveillance and security applications. It serves as a fundamental mechanism for identifying and detecting potential intruders who endeavor to infiltrate a sensor barrier. Achieving <span><math><mi>k</mi></math></span>-strong barrier coverage is a vital indicator of a WSN’s capability to detect unauthorized intrusions. This paper establishes efficient <span><math><mi>k</mi></math></span>-strong barrier coverage in hybrid wireless multimedia sensor networks, referred to as MMS-KSB. The primary goal is to identify a minimal number of mobile sensors to obtain <span><math><mi>k</mi></math></span>-barrier coverage. Exhibiting the combinatorial structure, previous research on building <span><math><mi>k</mi></math></span>-strong barrier has failed to provide a polynomial time solution for the considered problem and resorted to approximation algorithms. We, therefore, introduce a precise algorithm, named ExA-KSB, and provide theoretical analysis to substantiate that our proposed method achieves an exact solution with polynomial time complexity. Furthermore, we conduct comprehensive experiments to evaluate the efficacy of our algorithm by comparing it with existing approaches. Numerical results demonstrate that ExA-KSB surpasses previous algorithms, and offers superior solution quality with competitive computational efficiency.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103985"},"PeriodicalIF":7.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142006823","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}
Zu-Sheng Tan , Eric W.K. See-To , Kwan-Yeung Lee , Hong-Ning Dai , Man-Leung Wong
{"title":"Privacy-preserving federated learning for proactive maintenance of IoT-empowered multi-location smart city facilities","authors":"Zu-Sheng Tan , Eric W.K. See-To , Kwan-Yeung Lee , Hong-Ning Dai , Man-Leung Wong","doi":"10.1016/j.jnca.2024.103996","DOIUrl":"10.1016/j.jnca.2024.103996","url":null,"abstract":"<div><p>The widespread adoption of the Internet of Things (IoT) and deep learning (DL) have facilitated a social paradigm shift towards smart cities, accelerating the rapid construction of smart facilities. However, newly constructed facilities often lack the necessary data to learn any predictive models, preventing them from being truly smart. Additionally, data collected from different facilities is heterogeneous or may even be privacy-sensitive, making it harder to train proactive maintenance management (PMM) models that are robust to provide services across them. These properties impose challenges that have not been adequately addressed, especially at the city level. In this paper, we present a privacy-preserving, federated learning (FL) framework that can assist management personnel to proactively manage the maintenance schedule of IoT-empowered facilities in different organizations through analyzing heterogeneous IoT data. Our framework consists of (1) an FL platform implemented with fully homomorphic encryption (FHE) for training DL models with time-series heterogeneous IoT data and (2) an FL-based long short-term memory autoencoder model, namely FedLSTMA, for facility-level PMM. To evaluate our framework, we did extensive simulations with real-world data harvested from IoT-empowered public toilets, demonstrating that the DL-based FedLSTMA outperformed other traditional machine learning (ML) algorithms and had a high level of generalizability and capabilities of transferring knowledge from existing facilities to newly constructed facilities under the situation of huge data heterogeneity. We believe that our framework can be a potential solution for overcoming the challenges inherent in managing and maintaining other smart facilities, ultimately contributing to the effective realization of smart cities.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103996"},"PeriodicalIF":7.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012561","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}
{"title":"Privacy preservation in Artificial Intelligence and Extended Reality (AI-XR) metaverses: A survey","authors":"Mahdi Alkaeed , Adnan Qayyum , Junaid Qadir","doi":"10.1016/j.jnca.2024.103989","DOIUrl":"10.1016/j.jnca.2024.103989","url":null,"abstract":"<div><p>The metaverse is a nascent concept that envisions a virtual universe, a collaborative space where individuals can interact, create, and participate in a wide range of activities. Privacy in the metaverse is a critical concern as the concept evolves and immersive virtual experiences become more prevalent. The metaverse privacy problem refers to the challenges and concerns surrounding the privacy of personal information and data within Virtual Reality (VR) environments as the concept of a shared VR space becomes more accessible. Metaverse will harness advancements from various technologies such as Artificial Intelligence (AI), Extended Reality (XR) and Mixed Reality (MR) to provide personalized and immersive services to its users. Moreover, to enable more personalized experiences, the metaverse relies on the collection of fine-grained user data that leads to various privacy issues. Therefore, before the potential of the metaverse can be fully realized, privacy concerns related to personal information and data within VR environments must be addressed. This includes safeguarding users’ control over their data, ensuring the security of their personal information, and protecting in-world actions and interactions from unauthorized sharing. In this paper, we explore various privacy challenges that future metaverses are expected to face, given their reliance on AI for tracking users, creating XR and MR experiences, and facilitating interactions. Moreover, we thoroughly analyze technical solutions such as differential privacy, Homomorphic Encryption, and Federated Learning and discuss related sociotechnical issues regarding privacy.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103989"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1084804524001668/pdfft?md5=1b10971c5af604f8b43a86d1554a73bc&pid=1-s2.0-S1084804524001668-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141963237","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}
Mohamad Wazzeh , Mohamad Arafeh , Hani Sami , Hakima Ould-Slimane , Chamseddine Talhi , Azzam Mourad , Hadi Otrok
{"title":"CRSFL: Cluster-based Resource-aware Split Federated Learning for Continuous Authentication","authors":"Mohamad Wazzeh , Mohamad Arafeh , Hani Sami , Hakima Ould-Slimane , Chamseddine Talhi , Azzam Mourad , Hadi Otrok","doi":"10.1016/j.jnca.2024.103987","DOIUrl":"10.1016/j.jnca.2024.103987","url":null,"abstract":"<div><p>In the ever-changing world of technology, continuous authentication and comprehensive access management are essential during user interactions with a device. Split Learning (SL) and Federated Learning (FL) have recently emerged as promising technologies for training a decentralized Machine Learning (ML) model. With the increasing use of smartphones and Internet of Things (IoT) devices, these distributed technologies enable users with limited resources to complete neural network model training with server assistance and collaboratively combine knowledge between different nodes. In this study, we propose combining these technologies to address the continuous authentication challenge while protecting user privacy and limiting device resource usage. However, the model’s training is slowed due to SL sequential training and resource differences between IoT devices with different specifications. Therefore, we use a cluster-based approach to group devices with similar capabilities to mitigate the impact of slow devices while filtering out the devices incapable of training the model. In addition, we address the efficiency and robustness of training ML models by using SL and FL techniques to train the clients simultaneously while analyzing the overhead burden of the process. Following clustering, we select the best set of clients to participate in training through a Genetic Algorithm (GA) optimized on a carefully designed list of objectives. The performance of our proposed framework is compared to baseline methods, and the advantages are demonstrated using a real-life UMDAA-02-FD face detection dataset. The results show that CRSFL, our proposed approach, maintains high accuracy and reduces the overhead burden in continuous authentication scenarios while preserving user privacy.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103987"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993639","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}
{"title":"Designing transport scheme of 3D naked-eye system","authors":"Rong Zheng, Xiaoqin Feng, Fengyuan Ren","doi":"10.1016/j.jnca.2024.103988","DOIUrl":"10.1016/j.jnca.2024.103988","url":null,"abstract":"<div><p>3D naked-eye is constructed from multi-stream as a typical representation of stereoscopic video. Its enormous data volume and stringent low-delay transport requirements pose significant challenges for high-quality real-time transport. Through analysis and experimental verification that current streaming media transport frameworks using the server–client or peer-to-peer scheme face difficulties when transmitting 3D naked-eye in a one-to-one format. Besides, the existing bandwidth estimation algorithms cannot achieve the expected performance when dealing with delay-sensitive traffic. This results in low bandwidth utilization and slow bandwidth estimation, rendering it unfeasible to deliver multi-stream on time. We propose an effective transport framework with different modules for real-time multi-stream and introduce an Agent-to-Agent transport scheme that provides many-to-one connection as the main implementation way of 3D naked-eye transport framework. Additionally, we propose a direct bandwidth estimation algorithm to quickly match network bandwidth for low-delay transport. The Agent terminal centrally processes consolidates transports, and provides macro-level management of multiple video streams. The algorithm directly detects the available bandwidth using packet interval and packet rate models. Finally, using rate decision algorithm arbitrates the results to directly measure the maximum available bandwidth of the link. The Agent-to-Agent achieves 99% bandwidth utilization, addressing the limitations of existing streaming schemes in handling concurrent data streams. Our algorithm provides precise bandwidth estimates with minimal time overhead, meeting the requirements of a delay-sensitive 3D naked-eye system across diverse environments.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103988"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904708","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}
Zeli Wang , Weiqi Dai , Ming Li , Kim-Kwang Raymond Choo , Deqing Zou
{"title":"DFier: A directed vulnerability verifier for Ethereum smart contracts","authors":"Zeli Wang , Weiqi Dai , Ming Li , Kim-Kwang Raymond Choo , Deqing Zou","doi":"10.1016/j.jnca.2024.103984","DOIUrl":"10.1016/j.jnca.2024.103984","url":null,"abstract":"<div><p>Smart contracts are self-executing digital agreements that automatically enforce the terms between parties, playing a crucial role in blockchain systems. However, due to the potential losses of digital assets caused by vulnerabilities, the security issues of Ethereum smart contracts have garnered widespread attention. To address this, researchers have developed various techniques to detect vulnerabilities in smart contracts, with fuzzing techniques achieving promising results. Nonetheless, current fuzzers are unable to effectively exercise suspicious targets because they overlook two key factors: comprehensively exploring all paths to the targets and providing high-quality directed seed inputs. This paper presents a <u>D</u>irected vulnerability veri<u>Fier</u> (DFier), which elaborates effective transaction sequences with directed inputs for the fuzzer. This focuses on exploring target paths and automatically validating whether the specified locations are vulnerable. Specifically, DFier employs static analysis to help locate target paths, facilitating their comprehensive exploration. Additionally, we devise three heuristic strategies to enable our fuzzing technique to generate directed inputs that effectively validate the targets. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius), while the performance losses are in an acceptable range.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103984"},"PeriodicalIF":7.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904701","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}
Yingya Guo , Mingjie Ding , Weihong Zhou , Bin Lin , Cen Chen , Huan Luo
{"title":"MATE: A multi-agent reinforcement learning approach for Traffic Engineering in Hybrid Software Defined Networks","authors":"Yingya Guo , Mingjie Ding , Weihong Zhou , Bin Lin , Cen Chen , Huan Luo","doi":"10.1016/j.jnca.2024.103981","DOIUrl":"10.1016/j.jnca.2024.103981","url":null,"abstract":"<div><p>Hybrid Software Defined Networks (Hybrid SDNs), which combines the robustness of distributed network and the flexibility of centralized network, is now a prevailing network architecture. Previous hybrid SDN Traffic Engineering (TE) solutions search an optimal link weight setting or compute the splitting ratios of traffic leveraging heuristic algorithms. However, these methods cannot react timely to the fluctuating traffic demands in dynamic environments and suffer a hefty performance degradation when traffic demands change or network failures happen, especially when network scale is large. To cope with this, we propose a Multi-Agent reinforcement learning based TE method MATE that timely determines the route selection for network flows in dynamic hybrid SDNs. Through dividing the large-scale routing optimization problem into small-scale problem, MATE can better learn the mapping between the traffic demands and routing policy, and efficiently make online routing inference with dynamic traffic demands. To collaborate multiple agents and speed up the convergence in the training process, we innovatively design the actor network and introduce previous actions of all agents in the training of each agent. Extensive experiments conducted on different network topologies demonstrate our proposed method MATE has superior TE performance with dynamic traffic demands and is robust to network failures.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103981"},"PeriodicalIF":7.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904706","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}
Taejune Park , Myoungsung You , Jinwoo Kim , Seungsoo Lee
{"title":"Fatriot: Fault-tolerant MEC architecture for mission-critical systems using a SmartNIC","authors":"Taejune Park , Myoungsung You , Jinwoo Kim , Seungsoo Lee","doi":"10.1016/j.jnca.2024.103978","DOIUrl":"10.1016/j.jnca.2024.103978","url":null,"abstract":"<div><p>Multi-access edge computing (MEC), deploying cloud infrastructures proximate to end-devices and reducing latency, takes pivotal roles for mission-critical services such as smart grids, self-driving cars, and healthcare. Ensuring fault-tolerance is paramount for mission-critical services, as failures in these services can lead to fatal accidents and blackouts. However, the distributed nature of MEC architectures makes them more susceptible to failures than traditional cloud systems. Existing research in this field has focused on enhancing <em>robustness</em> to prevent failures in MEC systems rather than restoring them from failure conditions. To bridge this gap, we introduce <em>Fatriot</em>, a SmartNIC-based architecture designed to ensure fault-tolerance in MEC systems. <em>Fatriot</em> actively monitors for anomalies on MEC hosts and seamlessly redirects incoming service traffic to backup hosts upon detecting failures. Operating as a stand-alone solution on a SmartNIC, <em>Fatriot</em> guarantees the continuous operation of its fault-tolerance mechanism, even during severe errors (e.g., kernel failure) on the MEC host, maintaining uninterrupted service in mission-critical services. Our prototype of <em>Fatriot</em>, implemented on the NetFPGA-SUME, demonstrates effective mitigation of various failure scenarios, achieving this with minimal overhead to services (less than 1%).</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103978"},"PeriodicalIF":7.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141963236","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}