{"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}
{"title":"Blockchain-based inter-operator settlement system","authors":"Shifu Zhang, Yulin Pan","doi":"10.1016/j.hcc.2025.100324","DOIUrl":"10.1016/j.hcc.2025.100324","url":null,"abstract":"<div><div>Inter-network settlement is a critical mechanism for ensuring quality service and sustainable growth in the telecommunications industry. However, existing practices among operators suffer from inefficient, including manual workflows, untrustworthy data foundations, insecure dispute resolution, and insufficient accountability oversight. These challenges lead to prolonged settlement cycles, operational redundancies, and heightened risks of errors or leaks. To address these issues, we propose a blockchain-powered settlement chain framework that integrates business and technical systems to enable intelligent, trusted, and automated cross-operator settlement management. By synergizing consortium blockchain, privacy-preserving computation, and decentralized governance protocols, the framework establishes an end-to-end digital workflow covering data exchange, verification, auditing, and reconciliation. Key innovations include: (1) a multi-operator co-built consortium chain with cross-cloud networking and peer-to-peer governance; (2) a “data-available-but-invisible” auditing mechanism combining blockchain and privacy-preserving computation to ensure secure, compliant interactions; and (3) a dynamic chaincode architecture supporting real-time rule synchronization and adaptive cryptographic controls. The framework achieves full-process traceability, automated reconciliation, and enhanced financial governance while reducing reliance on manual intervention. This work provides a transformative paradigm for modernizing telecommunications settlement systems through digital trust infrastructure.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100324"},"PeriodicalIF":3.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144147787","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}
{"title":"Task migration with deadlines using machine learning-based dwell time prediction in vehicular micro clouds","authors":"Ziqi Zhou , Agon Memedi , Chunghan Lee , Seyhan Ucar , Onur Altintas , Falko Dressler","doi":"10.1016/j.hcc.2025.100314","DOIUrl":"10.1016/j.hcc.2025.100314","url":null,"abstract":"<div><div>Edge computing is becoming ever more relevant to offload compute-heavy tasks in vehicular networks. In this context, the concept of vehicular micro clouds (VMCs) has been proposed to use compute and storage resources on nearby vehicles to complete computational tasks. As many tasks in this application domain are time critical, offloading to the cloud is prohibitive. Additionally, task deadlines have to be dealt with. This paper addresses two main challenges. First, we present a task migration algorithm supporting deadlines in vehicular edge computing. The algorithm is following the earliest deadline first model but in presence of dynamic processing resources, <em>i.e</em>, vehicles joining and leaving a VMC. This task offloading is very sensitive to the mobility of vehicles in a VMC, <em>i.e</em>, the so-called dwell time a vehicles spends in the VMC. Thus, secondly, we propose a machine learning-based solution for dwell time prediction. Our dwell time prediction model uses a random forest approach to estimate how long a vehicle will stay in a VMC. Our approach is evaluated using mobility traces of an artificial simple intersection scenario as well as of real urban traffic in cities of Luxembourg and Nagoya. Our proposed approach is able to realize low-delay and low-failure task migration in dynamic vehicular conditions, advancing the state of the art in vehicular edge computing.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100314"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143891463","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}
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}
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}
Mahid Atif Hosain , Sriram Chellappan , Jannatun Noor
{"title":"Performance evaluation of file operations using Mutagen","authors":"Mahid Atif Hosain , Sriram Chellappan , Jannatun Noor","doi":"10.1016/j.hcc.2024.100282","DOIUrl":"10.1016/j.hcc.2024.100282","url":null,"abstract":"<div><div>Docker is a vital tool in modern development, enabling the creation, deployment, and execution of applications using containers, thereby ensuring consistency across various environments. However, developers often face challenges, particularly with filesystem complexities and performance bottlenecks when working directly within Docker containers. This is where Mutagen comes into play, significantly enhancing the Docker experience by offering efficient network file synchronization, reducing latency in file operations, and improving overall data transfer rates in containerized environments. By exploring Docker’s architecture, examining Mutagen’s role, and evaluating their combined performance impacts, particularly in terms of file operation speeds and development workflow efficiencies, this research provides a deep understanding of these technologies and their potential to streamline development processes in networked and distributed environments.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100282"},"PeriodicalIF":3.2,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144678977","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}
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}
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}
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}
{"title":"Kubernetes application performance benchmarking on heterogeneous CPU architecture: An experimental review","authors":"Jannatun Noor, MD Badsha Faysal, MD Sheikh Amin, Bushra Tabassum, Tamim Raiyan Khan, Tanvir Rahman","doi":"10.1016/j.hcc.2024.100276","DOIUrl":"10.1016/j.hcc.2024.100276","url":null,"abstract":"<div><div>With the rapid advancement of cloud technologies, cloud services have enormously contributed to the cloud community for application development life-cycle. In this context, Kubernetes has played a pivotal role as a cloud computing tool, enabling developers to adopt efficient and automated deployment strategies. Using Kubernetes as an orchestration tool and a cloud computing system as a manager of the infrastructures, developers can boost the development and deployment process. With cloud providers such as GCP, AWS, Azure, and Oracle offering Kubernetes services, the availability of both x86 and ARM platforms has become evident. However, while x86 currently dominates the market, ARM-based solutions have seen limited adoption, with only a few individuals actively working on ARM deployments. This study explores the efficiency and cost-effectiveness of implementing Kubernetes on different CPU platforms. By comparing the performance of x86 and ARM platforms, this research seeks to ascertain whether transitioning to ARM presents a more advantageous option for Kubernetes deployments. Through a comprehensive evaluation of scalability, cost, and overall performance, this study aims to shed light on the viability of leveraging ARM on different CPUs by providing valuable insights.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100276"},"PeriodicalIF":3.2,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403423","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}