Computer Standards & Interfaces最新文献

{"title":"People 4.0 — A model for Human-in-the-Loop CPS-based systems","authors":"José Marcelo Fernandes ,&nbsp;Jorge Eduardo Rivadeneira ,&nbsp;André Rodrigues ,&nbsp;Fernando Boavida ,&nbsp;Jorge Sá Silva","doi":"10.1016/j.csi.2024.103895","DOIUrl":"10.1016/j.csi.2024.103895","url":null,"abstract":"<div><p>Technology has become ubiquitous, and humans are increasingly dependent on it. Concepts like Smart and Cyber–Physical Systems (CPS), and the Internet of Things (IoT), are frequently used to describe applications and systems that surround us. These concepts commonly encompass applications that are able to sense their environment, collect and process data, make inferences, and communicate with other applications. However, most of the systems that currently exist do not account for human actions and intents, treating humans as mere sources of data. Furthermore, even the few systems that consider the human factor only do so to a very limited extent. On the premise that technology is made by people for people, new human-centric paradigms are needed, in which emotions, human states, and actions can be conveyed into the system. In this paper, we delve into the concept of Human-in-the-Loop Cyber–Physical Systems (HiTLCPS) and the challenges it presents. Building upon this foundation, we propose a novel approach that integrates humans into all phases of the cyber–physical loop. This comprehensive integration entails influencing human emotions and states, and incorporating human actions into the system architecture and functionalities. Finally, to demonstrate the feasibility and effectiveness of our proposed model, we provide concrete implementation examples in this paper. These examples, along with associated case studies, offer insights into how our human-centric paradigm enhances system performance, user experience, and overall effectiveness.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103895"},"PeriodicalIF":4.1,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000643/pdfft?md5=96ca4434ab3c0f7effcc1aed9026a49d&pid=1-s2.0-S0920548924000643-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Revocable ring signatures with CCA-anonymity from standard lattices","authors":"Jiaming Wen ,&nbsp;Willy Susilo ,&nbsp;Rupeng Yang ,&nbsp;Zuoxia Yu ,&nbsp;Huanguo Zhang","doi":"10.1016/j.csi.2024.103893","DOIUrl":"10.1016/j.csi.2024.103893","url":null,"abstract":"<div><p>Ring signatures are significant cryptographic primitives used for anonymous authentication due to their <em>anonymity</em> and <em>spontaneity</em>. However, in some scenarios, they may offer excessive <em>anonymity</em> to the signer. Revocable ring signatures aim to preserve the desirable properties of ring signatures while incorporating the <em>accountability</em> aspect of group signatures, leading a better trade-off between <em>anonymity</em> and <em>accountability</em>. Nevertheless, most revocable ring signature schemes only provide relatively weak CPA-Anonymity. In this paper, we present an instantiation of CCA-Anonymity from standard lattices, and prove its security under the random oracle model. Our construction achieves stronger anonymity and revocability, while relying on weaker assumptions than existing schemes from module lattices. Moreover, it boasts smaller sizes when the ring is large.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103893"},"PeriodicalIF":4.1,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S092054892400062X/pdfft?md5=90da223784763327cbb04d51db577410&pid=1-s2.0-S092054892400062X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"PSCBO: A provably secure consensus-based blockchain Oracle","authors":"Yusong Yao ,&nbsp;Yiwen Shi ,&nbsp;Guohua Tian ,&nbsp;Meixia Miao ,&nbsp;Willy Susilo","doi":"10.1016/j.csi.2024.103892","DOIUrl":"10.1016/j.csi.2024.103892","url":null,"abstract":"<div><p>Blockchain technology, successful in cryptocurrency, holds transformative potential for various industries. In decentralized applications driven by blockchain, acquiring non-digitally verifiable data is crucial, particularly in smart contracts. To facilitate the transfer of off-chain data from websites to the blockchain, several studies have proposed various centralized and decentralized blockchain Oracles. However, centralized Oracles reintroduce central risks, such as the Single Point of Failure, while decentralized Oracles consistently rely on a voting mechanism, which incurs additional vulnerabilities and substantial costs. In this work, we uncover a misdirection attack in decentralized Oracles, resulting in a diminished security region in blockchain consensus. This manifests as prolonged settle times and reduced upper bounds for tolerance of adversarial consensus chip. By formalizing the voting process as a discrete-time Markov chain (DTMC), we further demonstrate that the maximum stake of the adversary for launching a misdirection attack is less than 50%. To counteract this threat, we introduce a novel voting model that relies on chain length rather than block data for voting. Formally, we propose the definition of our model named <span><math><mrow><mi>V</mi><mi>o</mi><mi>t</mi><mi>e</mi><mi>F</mi><mi>o</mi><mi>r</mi><mi>k</mi></mrow></math></span>. Following this, we present the specific consensus-based blockchain Oracle protocol, PSCBO. This protocol involves blockchain clients collecting and providing Oracle data, with an epoch-based voting mechanism to verify each set of Oracle information. We also analyze the security of the PSCBO backbone <span><math><mrow><mi>V</mi><mi>o</mi><mi>t</mi><mi>e</mi><mi>F</mi><mi>o</mi><mi>r</mi><mi>k</mi></mrow></math></span>, demonstrating its security region akin to a typical blockchain. Finally, we implement a proof-of-concept system to validate the security region and further underscore the practicality. Both security analysis and experiments affirm that PSCBO exhibits a higher adversarial fault tolerance and shorter waiting time to confirm transactions.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103892"},"PeriodicalIF":4.1,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141845734","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":"COBLAH: A chaotic OBL initialized hybrid algebraic-heuristic algorithm for optimal S-box construction","authors":"Md Saquib Jawed ,&nbsp;Mohammad Sajid","doi":"10.1016/j.csi.2024.103890","DOIUrl":"10.1016/j.csi.2024.103890","url":null,"abstract":"<div><p>The Substitution box (S-box) is the main nonlinear component responsible for the cryptographic strength of any Substitution-Permutation Network (SPN) based block cipher. Generating the S-box with optimal cryptographic properties is one of cryptography's most challenging combinatorial problems because of its enormous search space, lack of guidance, and conflicting performance criteria. This paper introduces a novel Chaotic Opposition-based Learning Initialized Hybrid Algebraic-Heuristic (COBLAH) algorithm, combining the favorable traits of Algebraic and heuristics methods based on Galois field inversion, affine mapping, and Genetic Algorithm (GA). The Galois field inversion and affine mapping are used to construct the S-box, while the GA guides the algebraic construction to find the best bit-matrix and additive vector based on any irreducible polynomial for <em>GF</em>(2⁸). GA initializes with a random population generated using a newly constructed cosine-cubic map incorporated with binarization and Opposition-based Learning (OBL). Further, Multi-Objective Optimization Ratio Analysis (MOORA) is utilized to identify the best S-box from the final optimized population. The performance of the proposed algorithm is evaluated by comparing the generated COBLAH S-box with more than twenty state-of-the-art S-boxes, including Advanced Encryption Standard (AES), Skipjack, Gray, and Affine Power Affine (APA). The COBLAH S-box has nonlinearity 112, Strict Avalanche Criterion (SAC) offset 0.0202, Distance to SAC (DSAC) 332, Differential Approximation Probability (DP) 0.0625, Linear Approximation Probability (LP) 0.0156, Bit Independence Criterion-Strict Avalanche Criterion (BIC-SAC) 0.50006, and Bit Independence Criterion-Nonlinearity (BIC-NL) 112, which stands as the optimal observed thus far. The absence of fixed and opposite fixed points and the fact that it adheres to a single cycle aligns the COBLAH S-box with an ideal S-box. In addition, an image encryption mechanism is utilized to encrypt and decrypt the different images sourced from the standard USC-SIPI image dataset using COBLAH S-box and compared against different state-of-the-art S-boxes based on various image characteristics.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103890"},"PeriodicalIF":4.1,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141711383","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":"Advancing histopathology in Health 4.0: Enhanced cell nuclei detection using deep learning and analytic classifiers","authors":"S. Pons,&nbsp;E. Dura,&nbsp;J. Domingo,&nbsp;S. Martin","doi":"10.1016/j.csi.2024.103889","DOIUrl":"10.1016/j.csi.2024.103889","url":null,"abstract":"<div><p>This study contributes to the Health 4.0 paradigm by enhancing the precision of cell nuclei detection in histopathological images, a critical step in digital pathology. The presented approach is characterized by the combination of deep learning with traditional analytic classifiers.</p><p>Traditional methods in histopathology rely heavily on manual inspection by expert histopathologists. While deep learning has revolutionized this process by offering rapid and accurate detections, its black-box nature often results in a lack of interpretability. This can be a significant hindrance in clinical settings where understanding the rationale behind predictions is crucial for decision-making and quality assurance.</p><p>Our research addresses this gap by employing the YOLOv5 framework for initial nuclei detection, followed by an analysis phase where poorly performing cases are isolated and retrained to enhance model robustness. Furthermore, we introduce a logistic regression classifier that uses a combination of color and textural features to discriminate between satisfactorily and unsatisfactorily analyzed images. This dual approach not only improves detection accuracy but also provides insights into model performance variations, fostering a layer of interpretability absent in most deep learning applications.</p><p>By integrating these advanced analytical techniques, our work aligns with the Health 4.0 initiative’s goals of leveraging digital innovations to elevate healthcare quality. This study paves the way for more transparent, efficient, and reliable digital pathology practices, underscoring the potential of smart technologies in enhancing diagnostic processes within the Health 4.0 framework.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103889"},"PeriodicalIF":4.1,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000588/pdfft?md5=2aecb6b7b269d5474e3f8e31350c5d1a&pid=1-s2.0-S0920548924000588-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141710234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A secure data storage and sharing scheme for port supply chain based on blockchain and dynamic searchable encryption","authors":"Jiatao Li ,&nbsp;Dezhi Han ,&nbsp;Tien-Hsiung Weng ,&nbsp;Huafeng Wu ,&nbsp;Kuan-Ching Li ,&nbsp;Arcangelo Castiglione","doi":"10.1016/j.csi.2024.103887","DOIUrl":"10.1016/j.csi.2024.103887","url":null,"abstract":"<div><p>The port supply chain can provide strong data support for smart port decision-making. However, the traditional port supply chain suffers from poor flexibility of centralized authority management, data asymmetry, low efficiency of encrypted data retrieval and high delay of data update. Therefore, a secure storage and sharing scheme for port supply chain data based on blockchain assistance is proposed in this work. First, a fine-grained access control model for the port supply chain is designed in the smart contract to achieve auditable and decentralized management of user privileges. Second, the whole process of dynamic searchable encrypted data storage and access is realized in the smart contract, which ensures data security and encrypted data access efficiency. Moreover, an off-chain auxiliary storage method is designed to alleviate the storage pressure of the blockchain. Moreover, a reliable smart contract interface is provided for user operation, which can effectively regulate the access and storage of data. In addition, a consensus mechanism for the port supply chain is proposed, which takes the credibility and seniority of the operators at all levels as an indicator of the consensus agreement rights and interests. It improves the consensus efficiency under the premise of guaranteeing the security of the consensus process and meets the high data throughput demand of the supply chain system. Finally, the proposed scheme is implemented in Hyperledger Fabric. The security analysis and experimental results show that our scheme is secure and efficient in large-scale port supply chain data scenarios, and the system is scalable.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103887"},"PeriodicalIF":4.1,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141629740","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":"Practically secure linear-map vector commitment and its applications","authors":"Meixia Miao ,&nbsp;Siqi Zhao ,&nbsp;Jiawei Li ,&nbsp;Jianghong Wei ,&nbsp;Willy Susilo","doi":"10.1016/j.csi.2024.103885","DOIUrl":"10.1016/j.csi.2024.103885","url":null,"abstract":"<div><p>The primitive of vector commitment scheme allows a user to commit to an ordered sequence of messages (i.e., a vector) and later open the commitment at any position subset of the vector. The most important and desirable feature of vector commitment schemes is that the size of the opening proof is sublinear in the length of the committed vector. The original vector commitment scheme has now been extended to support several new functionalities like aggregation, updatability and homomorphism, and has applications ranging from verifiable data streaming to stateless cryptocurrency. Among these extensions, the linear-map vector commitment (LVC) scheme enables a user to open a general linear map evaluated on the committed vector, rather than those messages of the committed vector as in the original vector commitment scheme. However, the existing LVC schemes are only proved to be secure under the idealized assumptions, i.e., using the algebraic group model, which might be unpractical in the real world. To this end, we eliminate the use of algebraic group model, and propose a practically secure LVC construction. Our construction achieves practical security by additionally generating degree proofs for polynomials that enable a verifier to check the degree of polynomials publicly. We prove the security of the proposed LVC construction in the standard model under a <span><math><mi>q</mi></math></span>-type complexity assumption over bilinear groups. Moreover, we demonstrate how to use the proposed LVC scheme to construct maintainable vector commitments and verifiable data streaming protocols. The theoretical comparison and experimental results indicate that our proposal provides stronger security guarantee, while being competitive in terms of efficiency.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103885"},"PeriodicalIF":4.1,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141623150","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":"Improving efficiency and security of Camenisch–Lysyanskaya signatures for anonymous credential systems","authors":"Jia-Chng Loh,&nbsp;Fuchun Guo,&nbsp;Willy Susilo","doi":"10.1016/j.csi.2024.103886","DOIUrl":"10.1016/j.csi.2024.103886","url":null,"abstract":"<div><p>Camenisch–Lysyanskaya signature scheme with randomizability, namely CL signatures, at CRYPTO’04 has been well adopted for many privacy-preserving constructions, especially in the context of anonymous credential systems. Unfortunately, CL signatures suffer from linear size drawbacks. The signature size grows linearly based on the signing messages, which decreases the interest in practice, as each user may have multiple attributes (messages). Its standard EUF-CMA security was first proven under an interactive assumption. While the interactive assumption is not desirable in cryptography, Fuchsbauer et al. revisited its security at CRYPTO’18 by proving the scheme under the discrete logarithm (Dlog) assumption in the algebraic group model (AGM) that idealizes the adversary’s computation to be algebraic, yet the reduction loss is non-tight. In this work, we propose a new variant of CL signatures, namely CL+ signatures, that improves efficiency and security. The proposed CL+ signatures possess randomizability without the linear size drawback, such that signature size is a constant of three group elements. Besides, we prove the security of CL+ signatures can be tightly reduced to the DLog problem in AGM with only a loss factor of 3. Lastly, we show how CL+ signatures can also be instantiated to anonymous credential systems.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103886"},"PeriodicalIF":4.1,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000552/pdfft?md5=1c1214ab7bbdb123b5edc48b58eb293e&pid=1-s2.0-S0920548924000552-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141693217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient multi-party PSI and its application in port management","authors":"Mengyan Qiao ,&nbsp;Lifei Wei ,&nbsp;Dezhi Han ,&nbsp;Huafeng Wu","doi":"10.1016/j.csi.2024.103884","DOIUrl":"10.1016/j.csi.2024.103884","url":null,"abstract":"<div><p>Private Set Intersection (PSI) technology is a cryptographic tool that allows the parties holding private data to determine the intersection of sets in a joint computation without revealing any additional privacy information. As a critical component of secure multi-party computation, this technology has been widely used in the security domain of artificial intelligence and data mining. With the emergence of the era of multi-source data sharing, protocols for private set intersection computation applicable to multiple participants have also emerged. However, the performance of existing multi-party private set intersection (MPSI) protocols is suboptimal when some participants use devices with limited communication or computational capabilities, such as mobile devices. To overcome the above issues, we design a cloud-aided multi-party private set intersection protocol (Cloud-Aided-MPSI) based on oblivious programmable pseudorandom functions (OPPRF) and oblivious key–value stores (OKVS). Due to the protocol efficiently outsourcing partial computational and communication tasks to cloud servers, our performance has been further enhanced compared to existing work. Through the Cloud-Aided-MPSI protocol, we propose a port scheduling protocol for coordinated management scenarios of ships arriving and departing from ports. The protocol effectively addresses the privacy protection concerns of port management when scheduling the arrival and departure of ships. We analyze the performance of this protocol.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103884"},"PeriodicalIF":4.1,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141639251","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":"Fast bicriteria streaming algorithms for submodular cover problem under noise models","authors":"Bich-Ngan T. Nguyen ,&nbsp;Phuong N.H. Pham ,&nbsp;Canh V. Pham ,&nbsp;Vaclav Snasel","doi":"10.1016/j.csi.2024.103883","DOIUrl":"https://doi.org/10.1016/j.csi.2024.103883","url":null,"abstract":"<div><p>The Submodular Cover (<span><math><mi>SC</mi></math></span>) problem has attracted the attention of researchers because of its wide variety of applications in many domains. Previous studies on this problem have focused on solving it under the assumption of a non-noise environment or using the greedy algorithm to solve it under noise. However, in some applications, the data is often large-scale and brings a noisy version, so the existing solutions are ineffective or not applicable to large and noisy data. Motivated by this phenomenon, we study the Submodular Cover under Noises (<span><math><mi>SCN</mi></math></span>) problem and propose two efficient streaming algorithms, which provide a solution with theoretical bounds under two common noise models, multiplicative and additive noises. The experimental results indicate that our proposed algorithms not only provide the solution with a high objective function value but also outperform the state-of-the-art algorithm in terms of both the number of queries and the running time.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103883"},"PeriodicalIF":4.1,"publicationDate":"2024-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541837","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}