High-Confidence Computing最新文献_第4页

Joint feature selection and classification of low-resolution satellite images using the SAT-6 dataset 基于SAT-6数据集的低分辨率卫星图像联合特征选择与分类

IF 3 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2024-11-05 DOI: 10.1016/j.hcc.2024.100278

Rajalaxmi Padhy, Sanjit Kumar Dash, Jibitesh Mishra

The modern industries of today demand the classification of satellite images, and to use the information obtained from it for their advantage and growth. The extracted information also plays a crucial role in national security and the mapping of geographical locations. The conventional methods often fail to handle the complexities of this process. So, an effective method is required with high accuracy and stability. In this paper, a new methodology named RankEnsembleFS is proposed that addresses the crucial issues of stability and feature aggregation in the context of the SAT-6 dataset. RankEnsembleFS makes use of a two-step process that consists of ranking the features and then selecting the optimal feature subset from the top-ranked features. RankEnsembleFS achieved comparable accuracy results to state-of-the-art models for the SAT-6 dataset while significantly reducing the feature space. This reduction in feature space is important because it reduces computational complexity and enhances the interpretability of the model. Moreover, the proposed method demonstrated good stability in handling changes in data characteristics, which is critical for reliable performance over time and surpasses existing ML ensemble methods in terms of stability, threshold setting, and feature aggregation. In summary, this paper provides compelling evidence that this RankEnsembleFS methodology presents excellent performance and overcomes key issues in feature selection and image classification for the SAT-6 dataset.

今天的现代工业需要对卫星图像进行分类，并利用从中获得的信息来获得优势和发展。提取的信息在国家安全和地理位置测绘中也起着至关重要的作用。传统方法往往无法处理这一过程的复杂性。因此，需要一种精度高、稳定性好的有效方法。本文提出了一种名为RankEnsembleFS的新方法，该方法解决了SAT-6数据集背景下稳定性和特征聚合的关键问题。RankEnsembleFS使用了一个两步过程，包括对特征进行排序，然后从排名靠前的特征中选择最优的特征子集。RankEnsembleFS取得了与SAT-6数据集的最先进模型相当的精度结果，同时显着减少了特征空间。特征空间的减少很重要，因为它降低了计算复杂度并增强了模型的可解释性。此外，该方法在处理数据特征变化方面表现出良好的稳定性，这对于长期可靠的性能至关重要，并且在稳定性、阈值设置和特征聚合方面优于现有的ML集成方法。总之，本文提供了令人信服的证据，表明这种RankEnsembleFS方法具有出色的性能，并克服了SAT-6数据集的特征选择和图像分类中的关键问题。

{"title":"Joint feature selection and classification of low-resolution satellite images using the SAT-6 dataset","authors":"Rajalaxmi Padhy, Sanjit Kumar Dash, Jibitesh Mishra","doi":"10.1016/j.hcc.2024.100278","DOIUrl":"10.1016/j.hcc.2024.100278","url":null,"abstract":"<div><div>The modern industries of today demand the classification of satellite images, and to use the information obtained from it for their advantage and growth. The extracted information also plays a crucial role in national security and the mapping of geographical locations. The conventional methods often fail to handle the complexities of this process. So, an effective method is required with high accuracy and stability. In this paper, a new methodology named RankEnsembleFS is proposed that addresses the crucial issues of stability and feature aggregation in the context of the SAT-6 dataset. RankEnsembleFS makes use of a two-step process that consists of ranking the features and then selecting the optimal feature subset from the top-ranked features. RankEnsembleFS achieved comparable accuracy results to state-of-the-art models for the SAT-6 dataset while significantly reducing the feature space. This reduction in feature space is important because it reduces computational complexity and enhances the interpretability of the model. Moreover, the proposed method demonstrated good stability in handling changes in data characteristics, which is critical for reliable performance over time and surpasses existing ML ensemble methods in terms of stability, threshold setting, and feature aggregation. In summary, this paper provides compelling evidence that this RankEnsembleFS methodology presents excellent performance and overcomes key issues in feature selection and image classification for the SAT-6 dataset.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100278"},"PeriodicalIF":3.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144827308","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

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

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2025-01-11 DOI: 10.1016/j.hcc.2025.100297

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

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.

通配符可搜索加密允许服务器在保持数据隐私的同时有效地对加密数据执行基于通配符的关键字搜索。实现通配符SSE的一种很有前途的解决方案是提取查询关键字的特征，并基于成员关系测试结构检查是否存在。但是，现有的方案存在字符顺序误报，即服务器无法识别第一个和最后一个通配符之间的顺序。此外，由于一对一的隶属度测试，该方案还存在特征匹配模式泄漏的问题。在本文中，我们提出了第一个有效的通配符SSE方案来消除字符顺序的误报和特征匹配模式泄漏。为此，我们设计了一种新颖的特征提取技术，使客户端能够准确地查询关键字的特征，并保持第一个和最后一个通配符之间的顺序。然后，我们利用对称子集谓词加密的原语，它支持一次检查一个集合是否为另一个集合的子集，以减少特征匹配模式的泄漏。最后，通过执行正式的安全性分析并在真实数据库上实现该方案，我们证明了期望的安全属性以高性能实现。

{"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-09-01","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

Redactable Blockchain from Accountable Weight Threshold Chameleon Hash 可读的区块链从可问责权重阈值变色龙哈希

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2024-11-08 DOI: 10.1016/j.hcc.2024.100281

Qiang Ma , Yanqi Zhao , Xiangyu Liu , Xiaoyi Yang , Min Xie , Yong Yu

The redactable blockchain provides the editability of blocks, which guarantees the data immutability of blocks while removing illegal content on the blockchain. However, the existing redactable blockchain relies on trusted assumptions regarding a single editing authority. Ateniese et al. (EuroS&P 2017) and Li et al. (TIFS 2023) proposed solutions by using threshold chameleon hash functions, but these lack accountability for malicious editing. This paper delves into this problem and proposes an accountability weight threshold blockchain editing scheme. Specifically, we first formalize the model of a redactable blockchain with accountability. Then, we introduce the novel concept of the Accountable Weight Threshold Chameleon Hash Function (AWTCH). This function collaboratively generates a chameleon hash trapdoor through a weight committee protocol, where only sets of committees meeting the weight threshold can edit data. Additionally, it incorporates a tracer to identify and hold accountable any disputing editors, thus enabling supervision of editing rights. We propose a generic construction for AWTCH. Then, we introduce an efficient construction of AWTCH and develop a redactable blockchain scheme by leveraging AWTCH. Finally, we demonstrate our scheme’s practicality. The editing efficiency of our scheme is twice that of Tian et al. (TIFS 2023) with the same number of editing blocks.

可读区块链提供了块的可编辑性，这保证了块的数据不变性，同时删除了区块链上的非法内容。但是，现有的可读区块链依赖于关于单个编辑权限的可信假设。Ateniese等人（EuroS&P 2017）和Li等人（TIFS 2023）通过使用阈值变色龙哈希函数提出了解决方案，但这些方法缺乏对恶意编辑的问责制。本文对这一问题进行了深入研究，提出了一种问责权值区块链编辑方案。具体地说，我们首先形式化了具有问责性的可读区块链模型。然后，我们引入了可问责权值变色龙哈希函数（AWTCH）的新概念。该函数通过权重委员会协议协作生成一个变色龙散列陷阱门，只有满足权重阈值的委员会集才能编辑数据。此外，它还包含一个追踪器来识别和追究任何有争议的编辑的责任，从而实现对编辑权利的监督。我们提出了一个通用的awwatch结构。然后，我们介绍了一种有效的AWTCH结构，并利用AWTCH开发了一个可读区块链方案。最后，验证了方案的实用性。我们方案的编辑效率是Tian等人（TIFS 2023）在相同数量的编辑块情况下的两倍。

{"title":"Redactable Blockchain from Accountable Weight Threshold Chameleon Hash","authors":"Qiang Ma , Yanqi Zhao , Xiangyu Liu , Xiaoyi Yang , Min Xie , Yong Yu","doi":"10.1016/j.hcc.2024.100281","DOIUrl":"10.1016/j.hcc.2024.100281","url":null,"abstract":"<div><div>The redactable blockchain provides the editability of blocks, which guarantees the data immutability of blocks while removing illegal content on the blockchain. However, the existing redactable blockchain relies on trusted assumptions regarding a single editing authority. Ateniese et al. (EuroS&P 2017) and Li et al. (TIFS 2023) proposed solutions by using threshold chameleon hash functions, but these lack accountability for malicious editing. This paper delves into this problem and proposes an accountability weight threshold blockchain editing scheme. Specifically, we first formalize the model of a redactable blockchain with accountability. Then, we introduce the novel concept of the Accountable Weight Threshold Chameleon Hash Function (AWTCH). This function collaboratively generates a chameleon hash trapdoor through a weight committee protocol, where only sets of committees meeting the weight threshold can edit data. Additionally, it incorporates a tracer to identify and hold accountable any disputing editors, thus enabling supervision of editing rights. We propose a generic construction for AWTCH. Then, we introduce an efficient construction of AWTCH and develop a redactable blockchain scheme by leveraging AWTCH. Finally, we demonstrate our scheme’s practicality. The editing efficiency of our scheme is twice that of Tian et al. (TIFS 2023) with the same number of editing blocks.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100281"},"PeriodicalIF":3.2,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144713671","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

Connectivity maintenance against link uncertainty and heterogeneity in adversarial networks 对抗网络中链路不确定性和异质性的连通性维护

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2024-11-28 DOI: 10.1016/j.hcc.2024.100293

Jianzhi Tang , Luoyi Fu , Lei Zhou , Xinbing Wang , Chenghu Zhou

This paper delves into the challenge of maintaining connectivity in adversarial networks, focusing on the preservation of essential links to prevent the disintegration of network components under attack. Unlike previous approaches that assume a stable and homogeneous network topology, this study introduces a more realistic model that incorporates both link uncertainty and heterogeneity. Link uncertainty necessitates additional probing to confirm link existence, while heterogeneity reflects the varying resilience of links against attacks. We model the network as a random graph where each link is defined by its existence probability, probing cost, and resilience. The primary objective is to devise a defensive strategy that maximizes the expected size of the largest connected component at the end of an adversarial process while minimizing the probing cost, irrespective of the attack patterns employed. We begin by establishing the NP-hardness of the problem and then introduce an optimal defensive strategy based on dynamic programming. Due to the high computational cost of achieving optimality, we also develop two approximate strategies that offer efficient solutions within polynomial time. The first is a heuristic method that assesses link importance across three heterogeneous subnetworks, and the second is an adaptive minimax policy designed to minimize the defender’s potential worst-case loss, with guaranteed performance. Through extensive testing on both synthetic and real-world datasets across various attack scenarios, our strategies demonstrate significant advantages over existing methods.

本文深入研究了在对抗网络中保持连通性的挑战，重点是保存必要的链接，以防止网络组件在攻击下解体。与以往假设稳定且同质网络拓扑的方法不同，本研究引入了一个更现实的模型，该模型结合了链路不确定性和异质性。链路不确定性需要额外的探测来确认链路的存在，而异质性反映了链路对攻击的不同弹性。我们将网络建模为随机图，其中每个链路由其存在概率，探测成本和弹性定义。主要目标是设计一种防御策略，在对抗过程结束时最大化最大连接组件的预期大小，同时最小化探测成本，而不考虑所采用的攻击模式。我们首先建立了问题的np -硬度，然后引入了基于动态规划的最优防御策略。由于实现最优性的计算成本很高，我们还开发了两种近似策略，在多项式时间内提供有效的解决方案。第一种是一种启发式方法，用于评估跨三个异构子网的链路重要性，第二种是一种自适应极大极小策略，旨在最小化防御者潜在的最坏情况损失，并保证性能。通过对各种攻击场景的合成和真实数据集的广泛测试，我们的策略比现有方法具有显着优势。

{"title":"Connectivity maintenance against link uncertainty and heterogeneity in adversarial networks","authors":"Jianzhi Tang , Luoyi Fu , Lei Zhou , Xinbing Wang , Chenghu Zhou","doi":"10.1016/j.hcc.2024.100293","DOIUrl":"10.1016/j.hcc.2024.100293","url":null,"abstract":"<div><div>This paper delves into the challenge of maintaining connectivity in adversarial networks, focusing on the preservation of essential links to prevent the disintegration of network components under attack. Unlike previous approaches that assume a stable and homogeneous network topology, this study introduces a more realistic model that incorporates both link uncertainty and heterogeneity. Link uncertainty necessitates additional probing to confirm link existence, while heterogeneity reflects the varying resilience of links against attacks. We model the network as a random graph where each link is defined by its existence probability, probing cost, and resilience. The primary objective is to devise a defensive strategy that maximizes the expected size of the largest connected component at the end of an adversarial process while minimizing the probing cost, irrespective of the attack patterns employed. We begin by establishing the NP-hardness of the problem and then introduce an optimal defensive strategy based on dynamic programming. Due to the high computational cost of achieving optimality, we also develop two approximate strategies that offer efficient solutions within polynomial time. The first is a heuristic method that assesses link importance across three heterogeneous subnetworks, and the second is an adaptive minimax policy designed to minimize the defender’s potential worst-case loss, with guaranteed performance. Through extensive testing on both synthetic and real-world datasets across various attack scenarios, our strategies demonstrate significant advantages over existing methods.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100293"},"PeriodicalIF":3.2,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144678975","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 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2025-01-15 DOI: 10.1016/j.hcc.2024.100282

Mahid Atif Hosain , Sriram Chellappan , Jannatun Noor

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.

Docker是现代开发中的一个重要工具，它支持使用容器创建、部署和执行应用程序，从而确保不同环境之间的一致性。然而，开发人员经常面临挑战，特别是在直接在Docker容器中工作时，文件系统的复杂性和性能瓶颈。这就是Mutagen发挥作用的地方，通过提供有效的网络文件同步，减少文件操作的延迟，并提高容器化环境中的整体数据传输速率，显著增强了Docker体验。通过探索Docker的架构，检查Mutagen的作用，并评估它们的综合性能影响，特别是在文件操作速度和开发工作流程效率方面，本研究提供了对这些技术及其在网络和分布式环境中简化开发过程的潜力的深刻理解。

引用次数: 0

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

IF 3 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2025-02-12 DOI: 10.1016/j.hcc.2025.100301

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

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.

工业物联网（IIoT）通过连接各种传感器、智能设备和互联网，实现工业流程的自动化、监控和优化，极大地提高了生产率和产品质量。然而，工业物联网包含大量敏感数据，需要加密以确保数据隐私和安全。最近，Sun等人提出了一种用于工业物联网的无证书可搜索加密方案，可以在保护数据隐私的同时检索密文数据。然而，我们发现他们的方案不仅不能满足陷门不可区分性，而且缺乏对关键字猜测攻击的防御。此外，有些方案在加密过程中使用确定性算法，导致同一关键字加密后得到相同的密文，从而泄露了该关键字在密文空间中的潜在频率分布，从而泄露了该关键字在密文空间中的潜在频率分布，使攻击者能够通过统计分析推断出该密文对应的明文信息。为了更好地保护数据隐私，我们提出了一种改进的无证书可搜索加密方案，该方案使用指定服务器。通过安全性分析，证明了该方案在随机oracle下具有多密文不可分辨性和多活板门不可分辨性的安全性。实验结果表明，该方案在计算开销、通信开销和安全特性方面具有良好的综合性能。

{"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-09-01","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

FedViTBloc: Secure and privacy-enhanced medical image analysis with federated vision transformer and blockchain FedViTBloc：使用联合视觉变压器和区块链的安全和隐私增强的医学图像分析

IF 3 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-09-01 Epub Date: 2025-02-15 DOI: 10.1016/j.hcc.2025.100302

Gabriel Chukwunonso Amaizu , Akshita Maradapu Vera Venkata Sai , Sanjay Bhardwaj , Dong-Seong Kim , Madhuri Siddula , Yingshu Li

The increasing prevalence of cancer necessitates advanced methodologies for early detection and diagnosis. Early intervention is crucial for improving patient outcomes and reducing the overall burden on healthcare systems. Traditional centralized methods of medical image analysis pose significant risks to patient privacy and data security, as they require the aggregation of sensitive information in a single location. Furthermore, these methods often suffer from limitations related to data diversity and scalability, hindering the development of universally robust diagnostic models. Recent advancements in machine learning, particularly deep learning, have shown promise in enhancing medical image analysis. However, the need to access large and diverse datasets for training these models introduces challenges in maintaining patient confidentiality and adhering to strict data protection regulations. This paper introduces FedViTBloc, a secure and privacy-enhanced framework for medical image analysis utilizing Federated Learning (FL) combined with Vision Transformers (ViT) and blockchain technology. The proposed system ensures patient data privacy and security through fully homomorphic encryption and differential privacy techniques. By employing a decentralized FL approach, multiple medical institutions can collaboratively train a robust deep-learning model without sharing raw data. Blockchain integration further enhances the security and trustworthiness of the FL process by managing client registration and ensuring secure onboarding of participants. Experimental results demonstrate the effectiveness of FedViTBloc in medical image analysis while maintaining stringent privacy standards, achieving 67% accuracy and reducing loss below 2 across 10 clients, ensuring scalability and robustness.

癌症的日益流行需要先进的方法进行早期发现和诊断。早期干预对于改善患者预后和减轻卫生保健系统的总体负担至关重要。传统的集中式医学图像分析方法需要将敏感信息聚集在一个位置，这对患者隐私和数据安全构成了重大风险。此外，这些方法经常受到与数据多样性和可扩展性相关的限制，阻碍了普遍健壮的诊断模型的发展。机器学习的最新进展，特别是深度学习，在增强医学图像分析方面显示出了希望。然而，需要访问大型和多样化的数据集来训练这些模型，这在维护患者机密性和遵守严格的数据保护法规方面带来了挑战。本文介绍了FedViTBloc，这是一个利用联邦学习（FL）结合视觉变形器（ViT）和区块链技术的安全且增强隐私的医学图像分析框架。该系统通过全同态加密和差分隐私技术确保患者数据的隐私和安全。通过采用分散的FL方法，多个医疗机构可以在不共享原始数据的情况下协作训练强大的深度学习模型。区块链集成通过管理客户端注册和确保参与者的安全入职，进一步增强了FL过程的安全性和可信度。实验结果证明了FedViTBloc在医学图像分析中的有效性，同时保持严格的隐私标准，达到67%的准确率，并将10个客户端的损失降低到2以下，确保了可扩展性和鲁棒性。

{"title":"FedViTBloc: Secure and privacy-enhanced medical image analysis with federated vision transformer and blockchain","authors":"Gabriel Chukwunonso Amaizu , Akshita Maradapu Vera Venkata Sai , Sanjay Bhardwaj , Dong-Seong Kim , Madhuri Siddula , Yingshu Li","doi":"10.1016/j.hcc.2025.100302","DOIUrl":"10.1016/j.hcc.2025.100302","url":null,"abstract":"<div><div>The increasing prevalence of cancer necessitates advanced methodologies for early detection and diagnosis. Early intervention is crucial for improving patient outcomes and reducing the overall burden on healthcare systems. Traditional centralized methods of medical image analysis pose significant risks to patient privacy and data security, as they require the aggregation of sensitive information in a single location. Furthermore, these methods often suffer from limitations related to data diversity and scalability, hindering the development of universally robust diagnostic models. Recent advancements in machine learning, particularly deep learning, have shown promise in enhancing medical image analysis. However, the need to access large and diverse datasets for training these models introduces challenges in maintaining patient confidentiality and adhering to strict data protection regulations. This paper introduces FedViTBloc, a secure and privacy-enhanced framework for medical image analysis utilizing Federated Learning (FL) combined with Vision Transformers (ViT) and blockchain technology. The proposed system ensures patient data privacy and security through fully homomorphic encryption and differential privacy techniques. By employing a decentralized FL approach, multiple medical institutions can collaboratively train a robust deep-learning model without sharing raw data. Blockchain integration further enhances the security and trustworthiness of the FL process by managing client registration and ensuring secure onboarding of participants. Experimental results demonstrate the effectiveness of FedViTBloc in medical image analysis while maintaining stringent privacy standards, achieving 67% accuracy and reducing loss below 2 across 10 clients, ensuring scalability and robustness.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100302"},"PeriodicalIF":3.0,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144860301","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

Learning-based cooperative content caching and sharing for multi-layer vehicular networks 基于学习的多层车辆网络协同内容缓存与共享

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-06-01 Epub Date: 2024-11-05 DOI: 10.1016/j.hcc.2024.100277

Jun Shi , Yuanzhi Ni , Lin Cai , Zhuocheng Du

Caching and sharing the content files are critical and fundamental for various future vehicular applications. However, how to satisfy the content demands in a timely manner with limited storage is an open issue owing to the high mobility of vehicles and the unpredictable distribution of dynamic requests. To better serve the requests from the vehicles, a cache-enabled multi-layer architecture, consisting of a Micro Base Station (MBS) and several Small Base Stations (SBSs), is proposed in this paper. Considering that vehicles usually travel through the coverage of multiple SBSs in a short time period, the cooperative caching and sharing strategy is introduced, which can provide comprehensive and stable cache services to vehicles. In addition, since the content popularity profile is unknown, we model the content caching problems in a Multi-Armed Bandit (MAB) perspective to minimize the total delay while gradually estimating the popularity of content files. The reinforcement learning-based algorithms with a novel Q-value updating module are employed to update the caching files in different timescales for MBS and SBSs, respectively. Simulation results show the proposed algorithm outperforms benchmark algorithms with static or varying content popularity. In the high-speed environment, the cooperation between SBSs effectively improves the cache hit rate and further improves service performance.

缓存和共享内容文件对于各种未来的车辆应用程序来说是至关重要和基础的。然而，由于车辆的高移动性和动态请求的不可预测分布，如何在有限的存储空间下及时满足内容需求是一个悬而未决的问题。为了更好地服务于车辆的请求，本文提出了一种由一个微基站（MBS）和多个小基站（SBSs）组成的支持缓存的多层体系结构。针对车辆在短时间内通常会经过多个SBSs覆盖的情况，提出了协同缓存共享策略，为车辆提供全面、稳定的缓存服务。此外，由于内容流行概况是未知的，我们从多臂强盗（MAB）的角度对内容缓存问题进行建模，以最小化总延迟，同时逐渐估计内容文件的流行程度。采用基于强化学习的算法和新颖的q值更新模块，分别对MBS和SBSs在不同时间尺度下的缓存文件进行更新。仿真结果表明，该算法在静态或可变内容流行度下优于基准算法。在高速环境下，SBSs之间的协同有效地提高了缓存命中率，进而提升了业务性能。

{"title":"Learning-based cooperative content caching and sharing for multi-layer vehicular networks","authors":"Jun Shi , Yuanzhi Ni , Lin Cai , Zhuocheng Du","doi":"10.1016/j.hcc.2024.100277","DOIUrl":"10.1016/j.hcc.2024.100277","url":null,"abstract":"<div><div>Caching and sharing the content files are critical and fundamental for various future vehicular applications. However, how to satisfy the content demands in a timely manner with limited storage is an open issue owing to the high mobility of vehicles and the unpredictable distribution of dynamic requests. To better serve the requests from the vehicles, a cache-enabled multi-layer architecture, consisting of a Micro Base Station (MBS) and several Small Base Stations (SBSs), is proposed in this paper. Considering that vehicles usually travel through the coverage of multiple SBSs in a short time period, the cooperative caching and sharing strategy is introduced, which can provide comprehensive and stable cache services to vehicles. In addition, since the content popularity profile is unknown, we model the content caching problems in a Multi-Armed Bandit (MAB) perspective to minimize the total delay while gradually estimating the popularity of content files. The reinforcement learning-based algorithms with a novel Q-value updating module are employed to update the caching files in different timescales for MBS and SBSs, respectively. Simulation results show the proposed algorithm outperforms benchmark algorithms with static or varying content popularity. In the high-speed environment, the cooperation between SBSs effectively improves the cache hit rate and further improves service performance.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100277"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143917787","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

Minimizing charging task time of WRSN assisted with multiple MUVs and laser-charged UAVs 最小化WRSN在多muv和激光充电无人机辅助下的充电任务时间

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-06-01 Epub Date: 2024-10-05 DOI: 10.1016/j.hcc.2024.100272

Jian Zhang , Chuanwen Luo , Ning Liu , Yi Hong , Zhibo Chen

This paper investigates the framework of wireless rechargeable sensor network (WRSN) assisted by multiple mobile unmanned vehicles (MUVs) and laser-charged unmanned aerial vehicles (UAVs). On the basis of framework, we cooperatively investigate the trajectory optimization of multi-UAVs and multi-MUVs for charging WRSN (TOUM) problem, whose goal aims at designing the optimal travel plan of UAVs and MUVs cooperatively to charge WRSN such that the remaining energy of each sensor in WRSN is greater than or equal to the threshold and the time consumption of UAV that takes the most time of all UAVs is minimized. The TOUM problem is proved NP-hard. To solve the TOUM problem, we first investigate the multiple UAVs-based TSP (MUTSP) problem to balance the charging tasks assigned to every UAV. Then, based on the MUTSP problem, we propose the TOUM algorithm (TOUMA) to design the detailed travel plan of UAVs and MUVs. We also present an algorithm named TOUM-DQN to make intelligent decisions about the travel plan of UAVs and MUVs by extracting valuable information from the network. The effectiveness of proposed algorithms is verified through extensive simulation experiments. The results demonstrate that the TOUMA algorithm outperforms the solar charging method, the base station charging method, and the TOUM-DQN algorithm in terms of time efficiency. Simultaneously, the experimental results show that the execution time of TOUM-DQN algorithm is significantly lower than TOUMA algorithm.

研究了由多辆移动无人车（muv）和激光充电无人机（uav）辅助的无线可充电传感器网络（WRSN）的框架。在此框架的基础上，我们合作研究了多无人机多muv为WRSN充电的轨迹优化（图）问题，其目标是设计出无人机和muv协同充电WRSN的最优行程方案，使WRSN中每个传感器的剩余能量大于等于阈值，同时使耗时最多的无人机的时间消耗最小。图姆问题被证明是np困难的。为了解决图姆问题，我们首先研究了基于多无人机的TSP （MUTSP）问题，以平衡分配给每架无人机的收费任务。然后，在MUTSP问题的基础上，提出了图马算法（TOUMA）来设计无人机和多用途机动车辆的详细出行计划。本文还提出了一种名为TOUM-DQN的算法，通过从网络中提取有价值的信息，对无人机和机动车辆的旅行计划进行智能决策。通过大量的仿真实验验证了所提算法的有效性。结果表明，在时间效率方面，TOUMA算法优于太阳能充电法、基站充电法和TOUM-DQN算法。同时，实验结果表明，TOUMA - dqn算法的执行时间明显低于TOUMA算法。

{"title":"Minimizing charging task time of WRSN assisted with multiple MUVs and laser-charged UAVs","authors":"Jian Zhang , Chuanwen Luo , Ning Liu , Yi Hong , Zhibo Chen","doi":"10.1016/j.hcc.2024.100272","DOIUrl":"10.1016/j.hcc.2024.100272","url":null,"abstract":"<div><div>This paper investigates the framework of wireless rechargeable sensor network (WRSN) assisted by multiple mobile unmanned vehicles (MUVs) and laser-charged unmanned aerial vehicles (UAVs). On the basis of framework, we cooperatively investigate the trajectory optimization of multi-UAVs and multi-MUVs for charging WRSN (TOUM) problem, whose goal aims at designing the optimal travel plan of UAVs and MUVs cooperatively to charge WRSN such that the remaining energy of each sensor in WRSN is greater than or equal to the threshold and the time consumption of UAV that takes the most time of all UAVs is minimized. The TOUM problem is proved NP-hard. To solve the TOUM problem, we first investigate the multiple UAVs-based TSP (MUTSP) problem to balance the charging tasks assigned to every UAV. Then, based on the MUTSP problem, we propose the TOUM algorithm (TOUMA) to design the detailed travel plan of UAVs and MUVs. We also present an algorithm named TOUM-DQN to make intelligent decisions about the travel plan of UAVs and MUVs by extracting valuable information from the network. The effectiveness of proposed algorithms is verified through extensive simulation experiments. The results demonstrate that the TOUMA algorithm outperforms the solar charging method, the base station charging method, and the TOUM-DQN algorithm in terms of time efficiency. Simultaneously, the experimental results show that the execution time of TOUM-DQN algorithm is significantly lower than TOUMA algorithm.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100272"},"PeriodicalIF":3.2,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817179","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

Blockchain-based inter-operator settlement system 基于区块链的运营商间结算系统

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

High-Confidence Computing

Pub Date : 2025-06-01 Epub Date: 2025-04-30 DOI: 10.1016/j.hcc.2025.100324

Shifu Zhang, Yulin Pan

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.

网络间结算是确保电信行业优质服务和可持续增长的关键机制。然而，运营商的现有做法存在效率低下的问题，包括手工工作流程、不可信的数据基础、不安全的争议解决以及不充分的问责监督。这些挑战导致结算周期延长、操作冗余以及错误或泄漏风险增加。为了解决这些问题，我们提出了一个区块链驱动的结算链框架，该框架集成了业务和技术系统，以实现智能，可信和自动化的跨运营商结算管理。通过协同财团区块链、隐私保护计算和去中心化治理协议，该框架建立了一个涵盖数据交换、验证、审计和协调的端到端数字工作流。关键创新包括：(1)具有跨云网络和点对点治理的多运营商共建联盟链；(2)结合区块链和隐私保护计算的“数据可用但不可见”审计机制，以确保安全、合规的交互；(3)支持实时规则同步和自适应密码控制的动态链码体系结构。该框架实现了全流程可追溯性、自动对账和增强的财务治理，同时减少了对人工干预的依赖。这项工作为通过数字信任基础设施实现电信结算系统的现代化提供了一个变革性范例。

{"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-06-01","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}

引用次数: 0