Computer Standards & Interfaces最新文献

{"title":"Privacy-preserving fair outsourcing polynomial computation without FHE and FPR","authors":"Qiang Wang,&nbsp;Ying Wang,&nbsp;Fucai Zhou,&nbsp;Jian Xu,&nbsp;Changsheng Zhang","doi":"10.1016/j.csi.2024.103899","DOIUrl":"10.1016/j.csi.2024.103899","url":null,"abstract":"<div><p>With the development of cloud computing, verifiable outsourcing computation (VC) has received much more attention. The polynomial is a fundamental mathematical function with widespread applications. Plenty of VC schemes for polynomials have been proposed recently. However, most previous schemes focus on ensuring that the client can get a valid result returned by the cloud service provide (CSP) before payment, while often ignoring the CSP’s interest. To the best of our knowledge, Guan et al. (2021) proposed a pioneering framework for building fair outsourcing polynomial computation, which serves as the state of the art. However, it discloses the privacy of outsourced polynomials, inputs, and outputs. Furthermore, it suffers from a false positive rate (FPR) in the verification phase due to the sampling technique. As a result, it breaks the fairness between the client and the CSP.</p><p>To solve these problems, we propose a privacy-preserving fair outsourcing polynomial computation without FPR. To avoid expensive Fully Homomorphic Encryption (FHE), we utilize Paillier encryption and blind technique to ensure privacy. Our proposed scheme can guarantee fairness with an overwhelming probability by applying the SGX technique. The comprehensive performance evaluation and extensive simulations show that our protocol is more practical in cloud computing.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103899"},"PeriodicalIF":4.1,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141853702","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":"Revisiting “online/offline provable data possession” schemes","authors":"Feng Wang ,&nbsp;Changlu Lin ,&nbsp;Manli Yuan","doi":"10.1016/j.csi.2024.103898","DOIUrl":"10.1016/j.csi.2024.103898","url":null,"abstract":"<div><p>Wang et al. proposed the concept of “online/offline provable data possession” (OOPDP) [IEEE Transactions on Information Forensics and Security, 12(5): 1182-1194, 2017], and presented two instantiations, namely: CDH-based OOPDP and optimized OOPDP. However, in this paper we reveal that the tags in both CDH-based OOPDP and optimized OOPDP can be modified, and the optimized OOPDP is vulnerable to known one-file-tag attack. Then, we demonstrate how the (previously unrevealed) vulnerabilities can be addressed in two improved schemes, which we also show that the improved schemes incur only 61.5% of the storage space for tags on the cloud without increasing computational overhead at the user-end.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103898"},"PeriodicalIF":4.1,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141839284","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":"Revocable identity-based designated verifier proxy re-signature with signature evolution","authors":"Qiu Zhang ,&nbsp;Yinxia Sun ,&nbsp;Yang Lu ,&nbsp;Wensheng Huang","doi":"10.1016/j.csi.2024.103894","DOIUrl":"10.1016/j.csi.2024.103894","url":null,"abstract":"<div><p>Identity-based proxy re-signature (IDPRS) enables a semi-trusted proxy to convert one user’s signature to another user’s for the same message without revealing any secret information of both users’ signing keys. In IDPRS, user revocation is a necessary problem arising from privilege expiry or private key compromise. A revoked user cannot produce new signatures including re-signatures from the proxy. There is a need for some applications like a contract management system to keep expired message and signature pairs valid in the next period. The conventional solution is to require the unrevoked users to sign these messages again, which burdens users heavily. Therefore, establishing an IDPRS system with revocation and efficient signature updating is crucial. This paper introduces the concept of revocable IDPRS with signature evolution, facilitating efficient signature updating. The signature evolution enables the proxy to batch update non-revoked users’ signatures from old ones to new ones, while also offering precise execution of signature updates on specific messages. Moreover, to further protect the privacy of signature validity, we employ designated verifier in our scheme. Formal security proofs are provided, and performance evaluation demonstrates our scheme’s lower computation costs for signature updating and its comprehensive security attributes.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103894"},"PeriodicalIF":4.1,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841635","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":"Interpreting the latent space of a Convolutional Variational Autoencoder for semi-automated eye blink artefact detection in EEG signals","authors":"Sabatina Criscuolo ,&nbsp;Andrea Apicella ,&nbsp;Roberto Prevete ,&nbsp;Luca Longo","doi":"10.1016/j.csi.2024.103897","DOIUrl":"10.1016/j.csi.2024.103897","url":null,"abstract":"<div><p>Electroencephalography (EEG) allows the investigation of brain activity. However, neural signals often contain artefacts, hindering signal analysis. For example, eye-blink artefacts are particularly challenging due to their frequency overlap with neural signals. Artificial intelligence, particularly Variational Autoencoders (VAE), has shown promise in EEG artefact removal. This research explores the design and application of Convolutional VAEs for automatically detecting and removing eye blinks in EEG signals. The latent space of CVAE, trained on EEG topographic maps, is used to identify latent components that are selective for eye blinks. Receiver Operating Characteristic (ROC) curves and Area Under the Curve (AUC) are employed to evaluate the discriminative performance of each latent component. The most discriminative component, determined by the highest AUC, is modified to eliminate eye blinks. The evaluation of artefact removal involves visual inspection and Pearson correlation index assessment of the original EEG signal and the reconstructed clean version, focusing on the <span><math><mrow><mi>F</mi><mi>p</mi><mn>1</mn></mrow></math></span> and <span><math><mrow><mi>F</mi><mi>p</mi><mn>2</mn></mrow></math></span> channels most affected by eye-blink artefacts. Results indicate that the proposed method effectively removes eye blinks without significant loss of information related to the neural signal, demonstrating Pearson correlation values around 0.60 for each subject. The contribution to the knowledge offered by this research study is the design and application of a novel offline pipeline for automatically detecting and removing eye blinks from multi-variate EEG signals without human intervention.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103897"},"PeriodicalIF":4.1,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000667/pdfft?md5=3ce75b85802532f0585db97e4d225a04&pid=1-s2.0-S0920548924000667-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141851155","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":"Specific feature selection in wearable EEG-based transducers for monitoring high cognitive load in neurosurgeons","authors":"Pasquale Arpaia ,&nbsp;Mirco Frosolone ,&nbsp;Ludovica Gargiulo ,&nbsp;Nicola Moccaldi ,&nbsp;Marco Nalin ,&nbsp;Alessandro Perin ,&nbsp;Cosimo Puttilli","doi":"10.1016/j.csi.2024.103896","DOIUrl":"10.1016/j.csi.2024.103896","url":null,"abstract":"<div><p>The electroencephalographic (EEG) features for discriminating high and low cognitive load associated with fine motor activity in neurosurgeons were identified by combining wearable transducers and Machine Learning (ML). To date, in the literature, the specific impact of fine-motor tasks on surgeons’ cognitive load is poorly investigated and studies rely on the EEG features selected for cognitive load induced by other types of tasks (driving and flight contexts). In this study, the specific EEG features for detecting cognitive load associated with fine motor activity in neurosurgeons are investigated. Six neurosurgeons were EEG monitored by means of an eight-dry-channel EEG transducer during the execution of a standardized test of fine motricity assessment. The most informative EEG features of the cognitive load induced by fine motor activity were identified by exploiting the algorithm Sequential Feature Selector. In particular, five ML classifiers maximized their classification accuracy having as input the relative alpha power in Fz, O1, and O2, computed on 2-s epochs with an overlap of 50 %. These results demonstrate the feasibility of ML-supported wearable EEG solutions for monitoring persistent high cognitive load over time and alerting healthcare management.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103896"},"PeriodicalIF":4.1,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000655/pdfft?md5=3b3906ab7c699d01ab9b1c865229d0c4&pid=1-s2.0-S0920548924000655-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141842394","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":"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}