High-Confidence Computing最新文献

Digital twins in healthcare IoT: A systematic review 医疗物联网中的数字孪生：系统回顾

IF 3.2

High-Confidence Computing Pub Date : 2025-07-03 DOI: 10.1016/j.hcc.2025.100340

Md Rafiul Kabir , Fairuz Shadmani Shishir , Sumaiya Shomaji , Sandip Ray

{"title":"Digital twins in healthcare IoT: A systematic review","authors":"Md Rafiul Kabir , Fairuz Shadmani Shishir , Sumaiya Shomaji , Sandip Ray","doi":"10.1016/j.hcc.2025.100340","DOIUrl":"10.1016/j.hcc.2025.100340","url":null,"abstract":"<div><div>Digital twin technology initially marked its presence in production and engineering, subsequently revolutionizing the healthcare sector with its groundbreaking applications. These include the creation of virtual replicas of patients and medical devices, enabling the formulation of personalized treatment plans. The rise of microcomputing, miniaturized hardware, and advanced machine-to-machine communications has laid the foundation for the Internet-of-Medical Things (IoMT), significantly transforming patient care through remote monitoring and timely diagnostics. Amid these technological strides, this paper offers a systematic review of digital twin technology’s integration within healthcare IoT, underlining its crucial role in promoting personalized medicine and tackling the pressing security challenges inherent in healthcare IoT systems. Focusing solely on the growing field of smart healthcare systems powered by IoT infrastructure, we explore the use of digital twins in digital patient modeling, the lifecycle of smart hospitals, surgical planning, medical devices, the pharmaceutical industry, and the IoMT cyber infrastructure, demonstrating their transformative potential in modern healthcare. Building on these findings, we outline key technical implications and emerging trends, highlight current challenges, and propose future research directions to advance healthcare IoT and its digital twin applications.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100340"},"PeriodicalIF":3.2,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144686786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DC-LoRA: Domain correlation low-rank adaptation for domain incremental learning 面向领域增量学习的领域相关低秩自适应

IF 3

High-Confidence Computing Pub Date : 2025-03-18 DOI: 10.1016/j.hcc.2024.100270

Lin Li, Shiye Wang, Changsheng Li, Ye Yuan, Guoren Wang

{"title":"DC-LoRA: Domain correlation low-rank adaptation for domain incremental learning","authors":"Lin Li, Shiye Wang, Changsheng Li, Ye Yuan, Guoren Wang","doi":"10.1016/j.hcc.2024.100270","DOIUrl":"10.1016/j.hcc.2024.100270","url":null,"abstract":"<div><div>Continual learning, characterized by the sequential acquisition of multiple tasks, has emerged as a prominent challenge in deep learning. During the process of continual learning, deep neural networks experience a phenomenon known as catastrophic forgetting, wherein networks lose the acquired knowledge related to previous tasks when training on new tasks. Recently, parameter-efficient fine-tuning (PEFT) methods have gained prominence in tackling the challenge of catastrophic forgetting. However, within the realm of domain incremental learning, a type characteristic of continual learning, there exists an additional overlooked inductive bias, which warrants attention beyond existing approaches. In this paper, we propose a novel PEFT method called Domain Correlation Low-Rank Adaptation for domain incremental learning. Our approach put forward a domain correlated loss, which encourages the weights of the LoRA module for adjacent tasks to become more similar, thereby leveraging the correlation between different task domains. Furthermore, we consolidate the classifiers of different task domains to improve prediction performance by capitalizing on the knowledge acquired from diverse tasks. To validate the effectiveness of our method, we conduct comparative experiments and ablation studies on publicly available domain incremental learning benchmark dataset. The experimental results demonstrate that our method outperforms state-of-the-art approaches.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 4","pages":"Article 100270"},"PeriodicalIF":3.0,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On protecting the data privacy of Large Language Models (LLMs) and LLM agents: A literature review 大型语言模型（LLM）及其代理的数据隐私保护：文献综述

IF 3.2

High-Confidence Computing Pub Date : 2025-02-28 DOI: 10.1016/j.hcc.2025.100300

Biwei Yan , Kun Li , Minghui Xu , Yueyan Dong , Yue Zhang , Zhaochun Ren , Xiuzhen Cheng

{"title":"On protecting the data privacy of Large Language Models (LLMs) and LLM agents: A literature review","authors":"Biwei Yan , Kun Li , Minghui Xu , Yueyan Dong , Yue Zhang , Zhaochun Ren , Xiuzhen Cheng","doi":"10.1016/j.hcc.2025.100300","DOIUrl":"10.1016/j.hcc.2025.100300","url":null,"abstract":"<div><div>Large Language Models (LLMs) are complex artificial intelligence systems, which can understand, generate, and translate human languages. By analyzing large amounts of textual data, these models learn language patterns to perform tasks such as writing, conversation, and summarization. Agents built on LLMs (LLM agents) further extend these capabilities, allowing them to process user interactions and perform complex operations in diverse task environments. However, during the processing and generation of massive data, LLMs and LLM agents pose a risk of sensitive information leakage, potentially threatening data privacy. This paper aims to demonstrate data privacy issues associated with LLMs and LLM agents to facilitate a comprehensive understanding. Specifically, we conduct an in-depth survey about privacy threats, encompassing passive privacy leakage and active privacy attacks. Subsequently, we introduce the privacy protection mechanisms employed by LLMs and LLM agents and provide a detailed analysis of their effectiveness. Finally, we explore the privacy protection challenges for LLMs and LLM agents as well as outline potential directions for future developments in this domain.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100300"},"PeriodicalIF":3.2,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143859303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An improved secure designated server certificateless authenticated searchable encryption scheme for IIoT 一种改进的工业物联网安全指定服务器无证书认证可搜索加密方案

IF 3

High-Confidence Computing Pub Date : 2025-02-12 DOI: 10.1016/j.hcc.2025.100301

Le Zhang , Feng Zhou , Qijia Zhang , Wei Xiong , Youliang Tian

{"title":"An improved secure designated server certificateless authenticated searchable encryption scheme for IIoT","authors":"Le Zhang , Feng Zhou , Qijia Zhang , Wei Xiong , Youliang Tian","doi":"10.1016/j.hcc.2025.100301","DOIUrl":"10.1016/j.hcc.2025.100301","url":null,"abstract":"<div><div>The Industrial Internet of Things (IIoT) achieves the automation, monitoring, and optimization of industrial processes by interconnecting various sensors, smart devices, and the Internet, which dramatically increases productivity and product quality. Nevertheless, the IIoT comprises a substantial amount of sensitive data, which requires encryption to ensure data privacy and security. Recently, Sun et al. proposed a certificateless searchable encryption scheme for IIoT to enable the retrieval of ciphertext data while protecting data privacy. However, we found that their scheme not only fails to satisfy trapdoor indistinguishability but also lacks defense against keyword guessing attacks. In addition, some schemes use deterministic algorithms in the encryption process, resulting in the same ciphertexts after encryption for the same keyword, thereby leaking the potential frequency distribution of the keyword in the ciphertext space, thereby leaking the potential frequency distribution of the keyword in the ciphertext space, allowing attackers to infer the plaintext information corresponding to the ciphertext through statistical analysis. To better protect data privacy, we propose an improved certificateless searchable encryption scheme with a designated server. With security analysis, we prove that our scheme provides multi-ciphertext indistinguishability and multi-trapdoor indistinguishability security under the random oracle. Experimental results show that the proposed scheme has good overall performance in terms of computational overhead, communication overhead, and security features.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100301"},"PeriodicalIF":3.0,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reinforcement learning for an efficient and effective malware investigation during cyber incident response 强化学习在网络事件响应过程中高效和有效的恶意软件调查

IF 3

High-Confidence Computing Pub Date : 2025-01-17 DOI: 10.1016/j.hcc.2025.100299

Dipo Dunsin , Mohamed Chahine Ghanem , Karim Ouazzane , Vassil Vassilev

{"title":"Reinforcement learning for an efficient and effective malware investigation during cyber incident response","authors":"Dipo Dunsin , Mohamed Chahine Ghanem , Karim Ouazzane , Vassil Vassilev","doi":"10.1016/j.hcc.2025.100299","DOIUrl":"10.1016/j.hcc.2025.100299","url":null,"abstract":"<div><div>The ever-escalating prevalence of malware is a serious cybersecurity threat, often requiring advanced post-incident forensic investigation techniques. This paper proposes a framework to enhance malware forensics by leveraging reinforcement learning (RL). The approach combines heuristic and signature-based methods, supported by RL through a unified MDP model, which breaks down malware analysis into distinct states and actions. This optimisation enhances the identification and classification of malware variants. The framework employs Q-learning and other techniques to boost the speed and accuracy of detecting new and unknown malware, outperforming traditional methods. We tested the experimental framework across multiple virtual environments infected with various malware types. The RL agent collected forensic evidence and improved its performance through Q-tables and temporal difference learning. The epsilon-greedy exploration strategy, in conjunction with Q-learning updates, effectively facilitated transitions. The learning rate depended on the complexity of the MDP environment: higher in simpler ones for quicker convergence and lower in more complex ones for stability. This RL-enhanced model significantly reduced the time required for post-incident malware investigations, achieving a high accuracy rate of 94<span><math><mtext>%</mtext></math></span> in identifying malware. These results indicate RL’s potential to revolutionise post-incident forensics investigations in cybersecurity. Future work will incorporate more advanced RL algorithms and large language models (LLMs) to further enhance the effectiveness of malware forensic analysis.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100299"},"PeriodicalIF":3.0,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144827309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced Meta-IDS: Adaptive multi-stage IDS with sequential model adjustments 增强元IDS：自适应多阶段IDS与顺序模型调整

IF 3.2

High-Confidence Computing Pub Date : 2025-01-15 DOI: 10.1016/j.hcc.2025.100298

Nadia Niknami , Vahid Mahzoon , Slobadan Vucetic , Jie Wu

{"title":"Enhanced Meta-IDS: Adaptive multi-stage IDS with sequential model adjustments","authors":"Nadia Niknami , Vahid Mahzoon , Slobadan Vucetic , Jie Wu","doi":"10.1016/j.hcc.2025.100298","DOIUrl":"10.1016/j.hcc.2025.100298","url":null,"abstract":"<div><div>Traditional single-machine Network Intrusion Detection Systems (NIDS) are increasingly challenged by rapid network traffic growth and the complexities of advanced neural network methodologies. To address these issues, we propose an <em>Enhanced Meta-IDS</em> framework inspired by meta-computing principles, enabling dynamic resource allocation for optimized NIDS performance. Our hierarchical architecture employs a three-stage approach with iterative feedback mechanisms. We leverage these intervals in real-world scenarios with intermittent data batches to enhance our models. Outputs from the third stage provide labeled samples back to the first and second stages, allowing retraining and fine-tuning based on the most recent results without incurring additional latency. By dynamically adjusting model parameters and decision boundaries, our system optimizes responses to real-time data, effectively balancing computational efficiency and detection accuracy. By ensuring that only the most suspicious data points undergo intensive analysis, our multi-stage framework optimizes computational resource usage. Experiments on benchmark datasets demonstrate that our <em>Enhanced Meta-IDS</em> improves detection accuracy and reduces computational load or CPU time, ensuring robust performance in high-traffic environments. This adaptable approach offers an effective solution to modern network security challenges.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100298"},"PeriodicalIF":3.2,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144713063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance evaluation of file operations using Mutagen 使用Mutagen进行文件操作的性能评估

IF 3.2

High-Confidence Computing Pub Date : 2025-01-15 DOI: 10.1016/j.hcc.2024.100282

Mahid Atif Hosain , Sriram Chellappan , Jannatun Noor

引用次数: 0

An insider threat detection method based on improved Test-Time Training model 一种基于改进Test-Time Training模型的内部威胁检测方法

IF 3.2

High-Confidence Computing Pub Date : 2025-01-14 DOI: 10.1016/j.hcc.2024.100283

Xiaoling Tao , Jianxiang Liu , Yuelin Yu , Haijing Zhang , Ying Huang

{"title":"An insider threat detection method based on improved Test-Time Training model","authors":"Xiaoling Tao , Jianxiang Liu , Yuelin Yu , Haijing Zhang , Ying Huang","doi":"10.1016/j.hcc.2024.100283","DOIUrl":"10.1016/j.hcc.2024.100283","url":null,"abstract":"<div><div>As network and information systems become widely adopted across industries, cybersecurity concerns have grown more prominent. Among these concerns, insider threats are considered particularly covert and destructive. Insider threats refer to malicious insiders exploiting privileged access to networks, systems, and data to intentionally compromise organizational security. Detecting these threats is challenging due to the complexity and variability of user behavior data, combined with the subtle and covert nature of insider actions. Traditional detection methods often fail to capture both long-term dependencies and short-term fluctuations in time-series data, which are crucial for identifying anomalous behaviors. To address these issues, this paper introduces the Test-Time Training (TTT) model for the first time in the field of insider threat detection, and proposes a detection method based on the TTT-ECA-ResNet model. First, the dataset is preprocessed. TTT is applied to extract long-term dependencies in features, effectively capturing dynamic sequence changes. The Residual Network, incorporating the Efficient Channel Attention mechanism, is used to extract local feature patterns, capturing relationships between different positions in time-series data. Finally, a Linear layer is employed for more precise detection of insider threats. The proposed approaches were evaluated using the CMU CERT Insider Threat Dataset, achieving an AUC of 98.75% and an F1-score of 96.81%. The experimental results demonstrate the effectiveness of the proposed methods, outperforming other state-of-the-art approaches.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100283"},"PeriodicalIF":3.2,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Less leakage and more precise: Efficient wildcard keyword search over encrypted data 更少的泄漏和更精确：有效的通配符关键字搜索加密数据

IF 3.2

High-Confidence Computing Pub Date : 2025-01-11 DOI: 10.1016/j.hcc.2025.100297

Yunling Wang , Chenyang Gao , Yifei Huang , Lei Fu , Yong Yu

{"title":"Less leakage and more precise: Efficient wildcard keyword search over encrypted data","authors":"Yunling Wang , Chenyang Gao , Yifei Huang , Lei Fu , Yong Yu","doi":"10.1016/j.hcc.2025.100297","DOIUrl":"10.1016/j.hcc.2025.100297","url":null,"abstract":"<div><div>Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy. A promising solution to achieve wildcard SSE is to extract the characteristics of the queried keyword and check the existence based on a membership test structure. However, existing schemes have false positives of character order, that is, the server cannot identify the order between the first and the last wildcard character. Besides, the schemes also suffer from characteristic matching pattern leakage due to the one-by-one membership testing. In this paper, we present the first efficient wildcard SSE scheme to eliminate the false positives of character order and characteristic matching pattern leakage. To this end, we design a novel characteristic extraction technique that enables the client to exact the characteristics of the queried keyword maintaining the order between the first and the last wildcard character. Then, we utilize the primitive of Symmetric Subset Predicate Encryption, which supports checking if one set is a subset of another in one shot to reduce the characteristic matching pattern leakage. Finally, by performing a formal security analysis and implementing the scheme on a real-world database, we demonstrate that the desired security properties are achieved with high performance.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100297"},"PeriodicalIF":3.2,"publicationDate":"2025-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144678976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Secure and trusted sharing mechanism of private data for Internet of Things 安全可信的物联网私有数据共享机制

IF 3.2

High-Confidence Computing Pub Date : 2024-12-24 DOI: 10.1016/j.hcc.2024.100273

Mengyuan Li , Shaoyong Guo , Wenjing Li , Ao Xiong , Xiaoming Zhou , Jun Qi , Feng Qi , Dong Wang , Da Li

{"title":"Secure and trusted sharing mechanism of private data for Internet of Things","authors":"Mengyuan Li , Shaoyong Guo , Wenjing Li , Ao Xiong , Xiaoming Zhou , Jun Qi , Feng Qi , Dong Wang , Da Li","doi":"10.1016/j.hcc.2024.100273","DOIUrl":"10.1016/j.hcc.2024.100273","url":null,"abstract":"<div><div>In recent years, the rapid development of Internet of Things (IoT) technology has led to a significant increase in the amount of data stored in the cloud. However, traditional IoT systems rely primarily on cloud data centers for information storage and user access control services. This practice creates the risk of privacy breaches on IoT data sharing platforms, including issues such as data tampering and data breaches. To address these concerns, blockchain technology, with its inherent properties such as tamper-proof and decentralization, has emerged as a promising solution that enables trusted sharing of IoT data. Still, there are challenges to implementing encrypted data search in this context. This paper proposes a novel searchable attribute cryptographic access control mechanism that facilitates trusted cloud data sharing. Users can use keywords To efficiently search for specific data and decrypt content keys when their properties are consistent with access policies. In this way, cloud service providers will not be able to access any data privacy-related information, ensuring the security and trustworthiness of data sharing, as well as the protection of user data privacy. Our simulation results show that our approach outperforms existing studies in terms of time overhead. Compared to traditional access control schemes,our approach reduces data encryption time by 33%, decryption time by 5%, and search time by 75%.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100273"},"PeriodicalIF":3.2,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143902136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0