Computer Standards & Interfaces最新文献

{"title":"SM9-based device-friendly distributed decryption scheme for IoHT","authors":"Longjiao Li ,&nbsp;Jianchang Lai ,&nbsp;Liquan Chen ,&nbsp;Zhen Zhao ,&nbsp;Ge Wu ,&nbsp;Xinyan Yang","doi":"10.1016/j.csi.2025.104069","DOIUrl":"10.1016/j.csi.2025.104069","url":null,"abstract":"<div><div>IoHT is a specific application of IoT technology in the healthcare field, which enhances medical efficiency and quality. Ensuring secure data sharing among multiple parties is crucial in the IoHT, particularly for resource-constrained devices. As a Chinese national standard and an ISO/IEC standard, SM9 algorithm has been widely applied in IoT, finance, e-government and so on. Although existing SM9-based schemes can ensure data security during multi-party sharing, their high computational overhead makes them unsuitable for lightweight devices. To address this issue, this paper proposes an efficient distributed decryption scheme based on SM9. The proposed scheme achieves secure and efficient multi-party data sharing. And the proposed scheme is very friendly to lightweight devices, as it avoids computationally expensive operations such as bilinear pairing. Based on the <span><math><mi>q</mi></math></span>-BDHI assumption, the proposed scheme is proven to be CCA-secure. Finally, we implement our scheme through experiments and the results show that when the number of users reaches 100, the decryption time on resource-constrained devices is about 6 ms, demonstrating that the proposed scheme is suitable for deployment in IoHT.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104069"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145007771","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":"Integrating agentic risk signalling in trusted research environments: Automating VEX with Agent2Agent protocols and model context protocol (MCP) in SACRO and TREvolution pipelines","authors":"Petar Radanliev ,&nbsp;Kayvan Atefi ,&nbsp;Omar Santos ,&nbsp;Carsten Maple","doi":"10.1016/j.csi.2025.104079","DOIUrl":"10.1016/j.csi.2025.104079","url":null,"abstract":"<div><div>This study presents a framework for automating the generation and validation of machine-readable vulnerability statements, known as Vulnerability-Exploitability Exchange (VEX) artefacts, within secure research environments. The work addresses a critical limitation in existing vulnerability reporting, where static scoring systems often fail to capture whether a flaw is truly exploitable in a specific analytic context. By integrating structured metadata capture, runtime instrumentation, and cryptographically verifiable provenance, the framework classifies vulnerabilities as affected, fixed, or not relevant, supported by machine-readable evidence bundles. The methodology was evaluated using containerised applications seeded with deliberately vulnerable components. Software bill of materials and vulnerability scanners were applied to generate baseline inventories, while reproducibility frameworks validated that results could be independently replicated. Findings demonstrate that automated VEX generation can reduce false positives by distinguishing theoretical from actionable risks, thereby improving security assurance and reproducibility in federated infrastructures. At the same time, the research acknowledges significant challenges. Computational overhead from multi-layered monitoring, dependence on external tools, and the risk of false negatives introduce barriers to adoption. Broader pilot studies across heterogeneous domains and benchmarking on standardised testbeds are required to enhance generalisability. Privacy concerns from extensive runtime monitoring and the need for sustainable maintenance models also demand attention. By combining automation with human oversight and aligning with emerging standards, the study contributes a reproducible, auditable, and context-sensitive approach to vulnerability management. The work provides both a proof-of-concept and a roadmap for refining security practices in sensitive computational environments.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104079"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324405","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":"Traceable signatures from lattices","authors":"Nam Tran ,&nbsp;Khoa Nguyen ,&nbsp;Dongxi Liu ,&nbsp;Josef Pieprzyk ,&nbsp;Willy Susilo","doi":"10.1016/j.csi.2025.104092","DOIUrl":"10.1016/j.csi.2025.104092","url":null,"abstract":"<div><div>Traceable signatures (Kiayas et al., 2004) is an anonymous digital signature system that extends the tracing power of opening authority in group signatures. There are many known constructions of traceable signatures but all are based on number-theoretical/pairing assumptions. For such reason, they may not be secure in the presence of quantum computers. This work revisits the notion of traceable signatures and presents a lattice-based construction provably secure in the quantum random oracle model (QROM).</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104092"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145578668","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":"ScaFedCrowd: A secure cross-system anonymous authentication and privacy-preserving task recommendation scheme for federated crowdsourcing","authors":"Pei Ren ,&nbsp;Bo Yang ,&nbsp;Yanwei Zhou ,&nbsp;Tao Wang ,&nbsp;Feng Zhu ,&nbsp;Ru Meng","doi":"10.1016/j.csi.2025.104057","DOIUrl":"10.1016/j.csi.2025.104057","url":null,"abstract":"<div><div>As a prominent area of research in the AI 2.0 era, crowdsourcing has garnered significant attention. Traditional crowdsourcing systems suffer from several drawbacks, including single points of failure, privacy breaches, and isolated resources. The development of decentralized, privacy-preserving federated crowdsourcing systems has consequently emerged as an inevitable trend. However, this shift also introduces new security challenges, such as ensuring participant privacy, enabling rational task recommendations, and establishing inter-system trust. To address these challenges, we propose ScaFedCrowd, a secure cross-system anonymous authentication and privacy-preserving task recommendation scheme for federated crowdsourcing. Our scheme utilizes blockchain with smart contracts as the underlying platform to manage the crowdsourcing process, facilitating secure inter-system collaboration. We propose an intra-system registration and authentication method that uses a trapdoor function and non-interactive zero-knowledge (NIZK) proofs to provide optional anonymity for users. Based on similarity measurement and ElGamal cryptography, our scheme achieves secure cross-system authentication and authorization between servers and workers. Furthermore, task recommendations based on simple hashing intersection technique provide a foundation for cross-system authentication, ensuring privacy while recommending the most suitable tasks for workers. Finally, a secure revocation and tracking mechanism ensures the protection of legitimate rights. Security analysis and simulation results demonstrate that ScaFedCrowd enhances effectiveness, security, and versatility.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104057"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145007729","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":"BcFCKA:Blockchain-based Fair and continuous key agreement for DIDComm in Self-Sovereign Identity","authors":"Mingrui Zhang ,&nbsp;Ru Meng ,&nbsp;Tao Wang ,&nbsp;Yanwei Zhou ,&nbsp;Yi Zhao ,&nbsp;Bo Yang ,&nbsp;Lei Zhang","doi":"10.1016/j.csi.2025.104085","DOIUrl":"10.1016/j.csi.2025.104085","url":null,"abstract":"<div><div>Self-Sovereign Identity (SSI) is a novel identity management paradigm that empowers entities to control their own identities through agents, without relying on centralized authorities. However, the widely adopted DIDComm framework for secure communication between agents in SSI still faces several critical challenges, such as the lack of perfect forward secrecy, insufficient message loss resilience, and the absence of continuous key updates. To address these issues, we propose a blockchain-based Fair and Continuous Key Agreement (BcFCKA) primitive, which enables agents to perform fair and continuous session key updates, even in the presence of message loss and without relying on any centralized trusted entity. We further present a concrete scheme instantiation, namely BcFCX3DH, and provide both formal and informal analyses to demonstrate that our scheme achieves several security properties (e.g., known-key security and perfect forward secrecy) as well as several design goals (e.g., key pre-storage freedom and message loss resilience). In addition, simulation results show that the proposed scheme establishes the initial session key and performs key updates within only a few milliseconds, demonstrating its practicality.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104085"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145361675","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 security-aware multi-criteria decision-making framework for ordering task mapping techniques in 3D-NoC based MPSoC architectures of IoT","authors":"Ahmed Abbas Jasim Al-Hchaimi ,&nbsp;Yousif Raad Muhsen ,&nbsp;Dragan Pamucar ,&nbsp;Vladimir Simic","doi":"10.1016/j.csi.2025.104075","DOIUrl":"10.1016/j.csi.2025.104075","url":null,"abstract":"<div><div>Efficient Task Mapping Techniques (TMTs) play a crucial role in enhancing the security of 3-Dimensional Network-on-Chip-based Multiprocessor Systems-on-Chip (3D-NoC-based MPSoCs) architectures deployed in IoT environments by optimizing resource allocation and minimizing vulnerabilities in communication. However, selecting the secure TMT is a fresh challenge due to the difference in importance of evaluation criteria, data variation among these criteria, trade-offs, and uncertainty. This study aims to determine the secure TMT utilizing the Multicriteria Decision-Making (MCDM) framework. Our methodology is separated into three phases. Firstly, this paper establishes a decision matrix for TMT, considering ten criteria and ten alternatives. Secondly, the Pythagorean Fuzzy Set with Weighted Fuzzy Judgment Matrix (PYS-FWJM) method is proposed to determine the weights of ten evaluation criteria. Moreover, the MULTIMOORA-Borda method is employed to construct the TMT selection model based on ten key alternatives. The criteria weighting results highlight that communication overhead (0.1038), thermal management (0.1021), and cost-effectiveness (0.1029) are the most critical factors influencing TMT selection, emphasizing the importance of efficient data transfer, thermal stability, and resource optimization. The MULTIMOORA-Borda ranking results indicate that Dynamic Voltage and Frequency Scaling (DVFS) ranks as the top TMT, while the Branch-and-Bound is the least effective TMT. The framework's effectiveness and robustness are verified through sensitivity analysis and the Spearman technique. This research offers a structured and scalable evaluation model that enables researchers and practitioners to enhance TMT efficiency while ensuring robust security protection in IoT-driven environments. The outputs of this study contribute to achieving SDG 12 by promoting sustainable IoT.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104075"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145105867","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":"EIVBoost: An efficient and interpretable gradient boosting framework for Vertical Federated Learning","authors":"Lianhai Wang,&nbsp;Xiangyan Kong,&nbsp;Shujiang Xu,&nbsp;Shuhui Zhang,&nbsp;Wei Shao,&nbsp;Qizheng Wang","doi":"10.1016/j.csi.2025.104082","DOIUrl":"10.1016/j.csi.2025.104082","url":null,"abstract":"<div><div>The rapid growth of internet data and stringent privacy regulations have posed significant challenges to traditional machine learning methods in multi-party collaborative environments due to data silos. In this context, Vertical Federated Learning (VFL) has emerged as a promising solution. Gradient boosting tree-based VFL schemes, in particular, have gained prominence due to their widespread applicability. However, conventional gradient boosting tree models in VFL settings suffer from notable shortcomings, including high communication overhead from frequent interactions, inefficient utilization of computational resources, limited model interpretability, and privacy leakage risks arising from joint modeling. To address these issues, we propose EIVBoost, a novel gradient boosting tree framework. EIVBoost leverages Function Secret Sharing (FSS) to implement a secure comparison protocol, enabling passive parties without labels to generate pseudo-labels through shared functions and train independently, thereby significantly reducing communication overhead and training time while ensuring privacy. Furthermore, through model simplification and rule extraction, EIVBoost aggregates rules from independent models into a globally interpretable decision tree, enhancing model transparency and inference efficiency. Comprehensive security analyses demonstrate that EIVBoost effectively safeguards data privacy. Extensive experiments on real-world datasets confirm that the framework substantially improves training efficiency without compromising model accuracy, offering a robust, secure, and interpretable solution for VFL.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104082"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324419","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":"Overview of methods to improve execution time in image steganography and watermarking","authors":"Anna Melman,&nbsp;Kristina Dzhanashia,&nbsp;Oleg Evsutin","doi":"10.1016/j.csi.2025.104066","DOIUrl":"10.1016/j.csi.2025.104066","url":null,"abstract":"<div><div>The cybersecurity problems remain extremely relevant in the modern world. Every year image steganography and watermarking schemes are proposed that solve the problems of hidden confidential data transfer and image authentication, respectively. The authors attempt to maximize the main embedding indicators, such as capacity, invisibility, and robustness. However, in practice, the time effectiveness of embedding schemes also becomes paramount. Some schemes can provide outstanding embedding quality according to the main embedding indicators but have unsuitable time complexity for real-world applications. Others, on the contrary, aim to satisfy the requirements of real applications, sacrificing the main indicators in the process. Some authors manage to achieve the trade-off between embedding efficiency and algorithm complexity using special measures. Yet, in many works, these solutions are not covered in detail. In this paper, an overview of relevant studies in image steganography and watermarking, the authors of which apply various techniques for speed improvement, is presented. Algorithmic, software, and hardware approaches to improving computation time are analyzed separately, and the most widespread solutions are highlighted. The overview ends with promising research directions for improving the performance of additional information embedding into digital images in the context of execution time.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104066"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144933213","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":"Enhanced YOLOv8 model for accurate and real-time remote sensing target detection","authors":"Israr Ahmad ,&nbsp;Fengjun Shang ,&nbsp;Muhammad Faheem","doi":"10.1016/j.csi.2025.104093","DOIUrl":"10.1016/j.csi.2025.104093","url":null,"abstract":"<div><div>Current remote sensing image object detection algorithms often struggle with false positives, missed targets, and suboptimal accuracy. To address these issues, we propose an improved YOLOv8 network (PIYN) solution achieved through targeted modifications to the YOLOv8 architecture. The backbone of YOLOv8 utilizes a Cross-Stage Partial (CSP) structure that includes two convolutions, called a faster C2f module. Firstly, we infuse the C2f module integrating an Efficient Multi-Scale Attention (EMA) mechanism, which enhances the module's ability to process information across various scales. Secondly, we introduce a Compact Path Aggregation Network (Compact-PAN) structure within the neck of the network, which reduces the computational complexity of the model. Finally, replacing the Complete Intersection over Union (CIoU) loss function with the Weighted Intersection over Union (WIoU) loss refines the model's detection accuracy. Additionally, we applied K-fold cross-validation on the dataset to mitigate overfitting. Experiments using the extensive Dataset for Object Detection in Aerial images (DOTA) and the Dataset for Object Recognition in Optical Remote Sensing Imagery (DIOR) reveal PIYN's effectiveness: there is a 2.43 % and 2.56 % increase in Mean Average Precision (mAP) over YOLOv8, respectively, alongside a 4.49 % reduction in GFLOPs. These results demonstrate PIYN's capability to enhance accuracy while maintaining efficiency and solidify its progressive and practical impact, particularly for smart city applications.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104093"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145578670","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":"Fluent: Round-efficient secure aggregation for private federated learning","authors":"Xincheng Li ,&nbsp;Jianting Ning ,&nbsp;Geong Sen Poh ,&nbsp;Xinchun Yin ,&nbsp;Leo Yu Zhang ,&nbsp;Tianwei Zhang","doi":"10.1016/j.csi.2025.104096","DOIUrl":"10.1016/j.csi.2025.104096","url":null,"abstract":"<div><div>Federated learning (FL) facilitates collaborative training of machine learning models among a large number of clients while safeguarding the privacy of their local datasets. However, FL remains susceptible to vulnerabilities such as privacy inference and inversion attacks. Single-server secure aggregation schemes were proposed to address these threats. Nonetheless, they encounter practical constraints due to their round and communication complexities. This work introduces Fluent, a round-and communication-efficient secure aggregation scheme for private FL. Fluent offers improvements compared to state-of-the-art solutions, i.e., BBGLR (Bell et al., 2020) and Flamingo (Ma et al., 2023): (1) it eliminates the need for iterative handshakes and secret sharing operations by efficiently reusing the shares across multiple training iterations, while maintaining an equivalent level of security assurance as BBGLR and Flamingo; (2) it accomplishes both the consistency check and weight unmasking in one round, thereby reducing the communication complexity. With these constructions, Fluent achieves the fewest communication rounds (i.e., two in the collection phase) in the malicious server setting, in contrast to at least three rounds in BBGLR and Flamingo. This significantly reduces the latency for geographically distributed clients; (3) In addition, a dynamic variant with a participant selection algorithm and multilevel (hierarchical) secret sharing scheme was introduced. It facilitates dynamic client joining, hence enhancing the flexibility and scalability of Fluent. We implemented Fluent and compared it with BBGLR and Flamingo. Experimental results based on the EMNIST dataset show that Fluent achieves significant enhancements in training efficiency. Specifically, Fluent achieves improvements of 6.8<span><math><mo>×</mo></math></span> and 2.4<span><math><mo>×</mo></math></span> in training time against BBGLR and Flamingo respectively, without compromising accuracy.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"96 ","pages":"Article 104096"},"PeriodicalIF":3.1,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145578669","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}