Computer Standards & Interfaces最新文献

{"title":"An adaptive geometrical clustering routing protocol (AGCRP) for energy-efficient mobile wireless sensor networks in smart cities","authors":"Mohamed Abdou ,&nbsp;Hanan M. Amer ,&nbsp;Abeer T. Khalil ,&nbsp;Mohamed M. Abdelsalam","doi":"10.1016/j.csi.2025.104056","DOIUrl":"10.1016/j.csi.2025.104056","url":null,"abstract":"<div><div>The use of wireless sensor networks (WSNs) has increased rapidly in recent years as almost everything around us is becoming smart. Many challenges are facing WSNs, and one of them is energy utilization. In most scenarios, sensor nodes (SNs) are battery-powered. Once the battery is exhausted, the SN is treated as a dead node and its coverage area is considered a blind region. Another problem is the mobility of SNs. In many applications, SNs are movable that creates a frequent change in the system’s topology, which may lead to a great reduction in the system’s performance. Building an appropriate routing protocol to handle these problems can significantly increase the system’s performance. An adaptive geometrical clustering routing protocol for mobile WSNs (AGCRP) is introduced. The protocol divides the network into grid cells, each cell has a forwarder cluster head (FCH), a collector cluster head (CCH), and a set of cluster members (CMs). The CCH collects the data from CMs in its cluster and sends it to the FCH. The FCH then sends the data to the main station (MS). The selection of FCHs and CCHs has been done considering parameters such as energy level, distance to the grid center, and average distance relative to CMs. The simulation results show that the suggested method increases the stabilization, lifetime, and throughput of the static environment by about 31%, 34%, and 41% respectively compared with EECRAIFA, and increases the stabilization, and lifetime for the dynamic environment by about 74% and 32% respectively compared with DTC-BR.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104056"},"PeriodicalIF":3.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144866521","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":"Fuzzy Password Authentication Key Exchange protocol in universal composable framework for blockchain privacy protection","authors":"Qihong Chen,&nbsp;Changgen Peng,&nbsp;Dequan Xu","doi":"10.1016/j.csi.2025.104032","DOIUrl":"10.1016/j.csi.2025.104032","url":null,"abstract":"<div><div>In this paper, we construct a lattice-based fuzzy Password Authentication Key Exchange protocol in universal composable model. Through the known Password Authentication Key Exchange scheme, the Randomized Fuzzy Equality protocol and the Oblivious Transfer protocol are introduced to improve Password Authentication Key Exchange into fuzzy Password Authentication Key Exchange. First, the parties go through two rounds of Oblivious Transfer protocol, and then the key exchange is achieved based on the information exchanged. fuzzy Password Authentication Key Exchange satisfies that even if there is noise in the passwords between users, key exchange is still possible. Therefore, fuzzy Password Authentication Key Exchange is suitable for more application scenarios compared to Password Authentication Key Exchange, and the construction is universal composable security.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104032"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331256","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":"SecureMD5: A new stream cipher for secure file systems and encryption key generation with artificial intelligence","authors":"Isabel Herrera Montano ,&nbsp;Juan Ramos Diaz ,&nbsp;Sergio Molina-Cardín ,&nbsp;Juan José Guerrero López ,&nbsp;José Javier García Aranda ,&nbsp;Isabel de la Torre Díez","doi":"10.1016/j.csi.2025.104047","DOIUrl":"10.1016/j.csi.2025.104047","url":null,"abstract":"<div><div>The insider threat to sensitive information posed by employees or partners of an organisation remains a major cybersecurity challenge. In this regard, the measures taken by organisations and companies to protect information are often insufficient. Primarily, due to the legitimate access and knowledge of security holes that these individuals possess.</div><div>This study proposes SecureMD5, an encryption algorithm designed specifically for secure file systems (SFS). The algorithm is based on custom one-way functions integrated into an encryption scheme that operates at the byte level. It uses 11 dynamic variables generated from contextual parameters such as file position, access time, random values, and user-specific keys. This approach ensures that SecureMD5 does not inherit the known vulnerabilities of MD5 as a standard cryptographic algorithm. Consequently, SecureMD5 is presented as an adaptive and robust solution that addresses the challenges posed by insider threats in SFS.</div><div>In parallel, a modular contextual key generation scheme is proposed, which can incorporate various challenges such as user identity, access time and device location. Biometric key generation based on Artificial Intelligence (AI) methods is evaluated independently from the validation of the encryption algorithm. In the evaluated biometric key generation scheme, the AI models MediaPipe Hand Landmark and LBPHFaceRecognizer from OpenCV have been used. These methods are part of a sub-key generation scheme based on contextual challenges. This scheme eliminates the need for key storage for dynamic and secure access to sensitive information.</div><div>SecureMD5 was validated by diffusion, confusion, entropy and performance analysis. It achieved 31 % higher entropy than comparable algorithms. Performance improved by 0.32 % compared to RC4. It also passed 87 % of NIST 800–22 tests, demonstrating its robustness against cryptographic vulnerabilities. In addition, SecureMD5 balances security and performance, with encryption times 25 % faster than a modified AES algorithm for 10 MB files. Biometric key generation methods were evaluated using metrics such as precision, accuracy, false acceptance rate and specificity, achieving satisfactory values above 80 % on all metrics. This work addresses critical gaps in information security, providing significant advances in protecting SFS against insider threats. The design and adaptability of SecureMD5 make it particularly suitable for sectors with strict security requirements, such as healthcare, finance, and corporate data management. Its ability to enable dynamic and secure access control addresses the real challenges posed by protecting confidential information from internal threats.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104047"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655383","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":"Logarithmic identity-based ring signature over lattices and linkable variant","authors":"Wen Gao ,&nbsp;Tianyou Fu ,&nbsp;Baodong Qin ,&nbsp;Xiaoli Dong ,&nbsp;Zhen Zhao ,&nbsp;Momeng Liu","doi":"10.1016/j.csi.2025.104036","DOIUrl":"10.1016/j.csi.2025.104036","url":null,"abstract":"<div><div>The ring signature is extensively utilized in many fields, including e-voting, cryptocurrency, blockchain settings, etc. This paper proposes an effective identity-based ring signature (IBRS) from the lattice assumption by using logarithmic size OR proofs of group action to make the ring signature able to cope with the challenges of quantum attacks. Our construction has been proven anonymous and unforgeable in the random oracle model (ROM) under the hardness of Module Small Integer Solution (MSIS) assumption from lattices, a hot quantum-resistant cryptographic primitive. The anonymity makes it possible for a signer to sign the same message twice or more without being detected by the verifier. This would bring repeated e-voting or double spending of the same money in blockchain. Therefore, as an additional work, we give a linkable variant. Compared with existing IBRS schemes with linear sizes, the size of our scheme is relatively short and achieves logarithmic communication cost with its ring scale <span><math><mi>N</mi></math></span>. Our research data show that the signature size of our proposal has significant advantages over several existing schemes with an increase of <span><math><mi>N</mi></math></span>. When the ring scale <span><math><mi>N</mi></math></span> is set to be 32 (512, resp.), our scheme has a signature size of 177.13KiB (179.75KiB, resp.), while the previous scheme has a size of at least 154.06KiB (2695.74KiB, resp.).</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104036"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144557322","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":"Efficient structure-aware private set intersection with distributed interval function","authors":"Huimin Zhang ,&nbsp;Wenmin Li ,&nbsp;Yanjin Cheng ,&nbsp;Sujuan Qin ,&nbsp;Fei Gao ,&nbsp;Tengfei Tu","doi":"10.1016/j.csi.2025.104044","DOIUrl":"10.1016/j.csi.2025.104044","url":null,"abstract":"<div><div>Structure-aware PSI protocol (Sa-PSI) allows both parties to identify pairs of points within a predefined distance threshold across their respective datasets. However, in previous work, the cost of computation scales linearly with the number of prefixes in the structure, which may become excessively large, and additionally, this protocol risks disclosing sensitive elements. In this work, we present a lightweight and efficient Sa-PSI protocol (LESa-PSI), which aims at achieving the computational cost independent of the number of prefixes in the structure while simultaneously minimizing information leakage. We formally define an FSS based on the two-sided intervals function — compact DIF. This compact DIF is instantiated for a single-dimensional two-sided interval function and then extended to <span><math><mi>d</mi></math></span>-dimensional, which may be of independent interest. By combining compact DIF with a novel variant of DPF, we achieve key size compression for the set. Meanwhile, a structural decomposition strategy is proposed to divide the structure set, thereby enabling efficient function evaluation and computing the intersection. We prove that the LESa-PSI is secure in the semi-honest model. Furthermore, a comprehensive analysis of compact DIF and LESa-PSI is conducted through theory and experiments, with a comparison against some state-of-the-art works. The experimental results show that our compact DIF has a smaller key size, while the LESa-PSI has better performance in the intersection search and Bob’s elements evaluation.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104044"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144634018","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":"Blockchain beyond immutability: Application firewalls on ethereum-based platforms","authors":"Christian Delgado-von-Eitzen,&nbsp;Manuel José Fernández-Iglesias,&nbsp;Luis Anido-Rifón,&nbsp;Fernando A. Mikic-Fonte","doi":"10.1016/j.csi.2025.104038","DOIUrl":"10.1016/j.csi.2025.104038","url":null,"abstract":"<div><div>Blockchain is a technology that gained relevance in various fields due to its transparency and security in recording information in a reliable and immutable manner. In particular, the adoption of private blockchain platforms based on the Ethereum technology grew significantly in enterprise environments. However, there are certain issues concerning privacy and access control that may pose significant challenges in scenarios where private transactions occur between user agents instead of nodes, that is, between blockchain accounts that are not necessarily attached to specific nodes. The Blockchain Application Firewall (BAF) is introduced as a conceptual framework that can be applied in cases where control over data access is needed, including private transactions between accounts. More specifically, the BAF is intended to complement a blockchain endpoint acting as an intermediary between users and blockchain services and data, monitoring and controlling incoming and outgoing traffic, according to an applied access policy. This work investigates BAF’s feasibility and effectiveness in enhancing the capabilities of Ethereum-based blockchains in the described scenarios. A proof-of-concept was implemented with Besu to assess its feasibility, providing evidence that BAF can act as an additional layer of control over data stored, helping to solve key limitations in practical implementations and allowing exploration of new use cases that could not be addressed so far.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104038"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144502422","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":"Software defect prediction using graph sample and aggregate-attention network optimized with nomadic people optimizer for enhancing the software reliability","authors":"P. Dhavakumar ,&nbsp;S. Vengadeswaran","doi":"10.1016/j.csi.2025.104033","DOIUrl":"10.1016/j.csi.2025.104033","url":null,"abstract":"<div><div>The major objective of Software Defect Prediction (SDP) is to detect code location where errors are likely to occur to focus testing efforts on more suspect areas. Therefore, a high-quality software is developed that takes lesser time without effort. The dataset used for SDP usually contains more non-defective examples than defective examples. SDP is an important activity in software engineering that detect potential defects in software systems before they occur. For that, this paper proposes a Software Defect Prediction using Graph Sample and Aggregate-Attention Network optimized with Nomadic people Optimizer for enhancing the Software Reliability (graphSAGE-NPO-SDP). Here, the data are taken from Promise Repository dataset and given to the pre-processing. The pre-processing is done by normalization techniques of Min-Max Scaling. After preprocessing, the features are selected under Univariate Ensemble Feature Selection technique (UEFST). The classification process is performed by graphSAGE. The classification results are classified as defect class and non-defective class. The performance metrics, like Accuracy, Execution time, F-measure, Precision, Root Mean Square Error, Sensitivity, and Specificity is examined. The proposed graphSAGE-NPO-SDP method attains higher accuracy 32.45 %, 36.48 % and 28.34 % when compared to the existing models: Complexity-based over sampling technique in SDP (COT-ACI-SDP), Classification Method for SDP utilizing multiple filter feature selection approach (MLP-SDP), Boosted WOA-SDP and hybrid model depending on deep neural network based for SDP under Software Metrics (DNN-GA-SDP) respectively.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"95 ","pages":"Article 104033"},"PeriodicalIF":4.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144262586","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":"An efficient rejection-free threshold ring signature from lattices and its application in receipt-free cloud e-voting","authors":"Chunhui Wu ,&nbsp;Youkang Zhou ,&nbsp;Fangguo Zhang ,&nbsp;Yusong Du ,&nbsp;Qiping Lin","doi":"10.1016/j.csi.2025.104008","DOIUrl":"10.1016/j.csi.2025.104008","url":null,"abstract":"<div><div>The threshold ring signature is a generalization of the ring signature. It confirms that <span><math><mi>t</mi></math></span>-out-of-<span><math><mi>N</mi></math></span> members are signing anonymously in a set of <span><math><mi>N</mi></math></span> users, and thus it can be well applied to e-voting. In this paper, we present a more efficient lattice-based threshold ring signature, using Lagrange polynomial interpolation to express the threshold. The scheme eliminates the dependence on Stern-like identification protocols with large soundness error, and achieves much shorter signature sizes. It also uses the technique of Gaussian convolution (<span>G</span>+<span>G</span>) proposed by Devevey et al.<!--> <!-->in Asiacrypt 2023 to remove the rejection sampling in BLISS signature. Compared with previous distributed FSwA (Fiat-Shamir with Aborts) signatures where the number of repetitions increases exponentially with that of signers, our scheme has much higher computation efficiency. We prove the unforgeability and strong anonymity, i.e., fellow-signer anonymity, unclaimability and anonymity against the untrusted leader of our proposed threshold ring signature scheme. Leveraging the security and efficiency advantages of our signature scheme, we propose a post-quantum receipt-free and verifiable e-voting protocol for large-scale elections with untrusted cloud servers.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"94 ","pages":"Article 104008"},"PeriodicalIF":4.1,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143806843","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":"Survey of reversible data hiding: Statistics, current trends, and future outlook","authors":"Sonal Gandhi,&nbsp;Rajeev Kumar","doi":"10.1016/j.csi.2025.104003","DOIUrl":"10.1016/j.csi.2025.104003","url":null,"abstract":"<div><div>In the era of increasing digital media storage and transmission over networks, reversible data hiding (RDH) has evolved as a prominent area of research mitigating information security risk. To study the evolution of research, highlight its achievements over the years, and provide future prospects, this paper presents an extensive review of RDH utilizing the dataset extracted from one of the most popular and exhaustive databases, Web of Science. The study aims to first perform quantitative analysis that includes trend analysis, citation analysis, prominent authors and organizations, and geographical coverage, along with qualitative analysis focusing on key research areas and future prospects within RDH. The study further provides a structured view of sub-technologies within RDH, along with the key contributors and their proposed techniques that have led to the evolution of RDH over the years. Next, we provide a comprehensive review of some of the prominent works in each of the sub-technologies of RDH. Finally, several key research directions, identified based on current research trends and early-stage problems and motivations, are discussed. Overall, the proposed study provides valuable insights into the evolution, key milestones, current state, and future prospects of RDH, serving as a guide for the research community.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"94 ","pages":"Article 104003"},"PeriodicalIF":4.1,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143725098","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":"Revealing the mobile UX horizon: Exploring user experience aspects, attributes, and measurement methods - A systematic mapping study","authors":"Haifa Alshammare ,&nbsp;Mohammad Alshayeb ,&nbsp;Malak Baslyman","doi":"10.1016/j.csi.2025.103999","DOIUrl":"10.1016/j.csi.2025.103999","url":null,"abstract":"<div><h3>Context</h3><div>The exponential growth of mobile internet usage underscores the critical importance of investigating mobile app enhancements across various domains. User Experience (UX) emerges as a pivotal quality factor, encompassing emotional, sensory, and contextual dimensions, significantly influencing user behavior and retention.</div></div><div><h3>Objective</h3><div>This systematic mapping study investigates research efforts on mobile application UX to discern domains where UX has been explored, identifying UX aspects, attributes, and assessment methods.</div></div><div><h3>Method</h3><div>Through a standard systematic mapping procedure, 189 primary studies were identified from 9107 reviewed articles across five digital libraries.</div></div><div><h3>Results</h3><div>100 distinct UX aspects and 166 attributes were identified and categorized into App, User, and Context aspects. These aspects were distributed among 14 domains, with healthcare being extensively researched. The usability aspect is prominent in 54.5 % of studies. Efficiency, satisfaction, effectiveness, learnability, memorability, attractiveness, errors, and ease of use emerged as the most commonly utilized attributes—notably, these attributes are considered usability attributes among several standards. Additionally, 38 and 22 evaluation methods were identified for aspects and attributes, grouped into self-reported, physiological, observational, and expert evaluation categories. Questionnaires were predominantly utilized.</div></div><div><h3>Conclusion</h3><div>This review summarizes the mobile application UX landscape, highlighting key aspects, attributes, and evaluation methods across domains. Future research should leverage these insights to advance UX design and evaluation practices, fostering innovation in software engineering and human-computer interaction.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"94 ","pages":"Article 103999"},"PeriodicalIF":4.1,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143684750","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}