Computer Standards & Interfaces最新文献_第9页

A consent-aware electronic medical records sharing method based on blockchain 基于区块链的同意感知电子病历共享方法

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-31 DOI: 10.1016/j.csi.2024.103902

Xiao Qu , Zhexuan Yang , Zeng Chen , Guozi Sun

{"title":"A consent-aware electronic medical records sharing method based on blockchain","authors":"Xiao Qu , Zhexuan Yang , Zeng Chen , Guozi Sun","doi":"10.1016/j.csi.2024.103902","DOIUrl":"10.1016/j.csi.2024.103902","url":null,"abstract":"<div><p>Electronic medical records (EMRs) sharing has become a vital component of the modern health care system, which involves patients, The Medical Institution with Medical Records (MI-MR), and The Medical Institution Requiring Medical Records (MI-RMR) within this ecosystem. Currently, a substantial amount of research focuses on the security, authenticity, and privacy of the shared information. However, there is a shortage of attention on design and research that adequately reflect personal rights and interests of patients. We propose a consent-aware EMR sharing method leveraging blockchain technology, which not only preserves patients’ right to be informed, but also fulfills the fundamental needs for security and privacy in EMR sharing. Furthermore, it ensures transparency and decentralization in the sharing process and incorporates on-chain verification mechanisms against malicious alteration of blockchain data. To enhance system scalability, a secure off-chain storage mechanism has been implemented. Our experimental findings underscore the practicality of our smart contract on Ethereum, along with its economic benefits, evaluated using tests conducted on a Ganache-based Ethereum blockchain network and a Remix-based Ethereum blockchain network. The performance and advantages of the proposed architecture have been corroborated through a prototype implementation using Ethereum.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103902"},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941199","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}

引用次数: 0

Encrypted data inner product KNN secure query based on BALL-PB tree 基于 BALL-PB 树的加密数据内积 KNN 安全查询

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-31 DOI: 10.1016/j.csi.2024.103901

Huijie Liu, Jinsheng Xing

{"title":"Encrypted data inner product KNN secure query based on BALL-PB tree","authors":"Huijie Liu, Jinsheng Xing","doi":"10.1016/j.csi.2024.103901","DOIUrl":"10.1016/j.csi.2024.103901","url":null,"abstract":"<div><p>With the increased data volume, data query service outsourcing to cloud servers is widely used. However, enabling authorized users to access confidential data is critical when conducting queries on untrusted cloud servers. To this end, an inner-product k-nearest neighbor (KNN) query scheme with access control (IPKNN_AC) is proposed under privacy protection. Firstly, this scheme utilizes the designed Ball-PB tree structure to partition the dataset into multiple subsets. Considering the efficiency and confidentiality of inner-product queries on the tree, the scheme represents the internal nodes and leaf nodes accordingly and defines a secure inner-product calculation protocol, EncInp. Secondly, relying on EncInp, a query algorithm is employed to perform similarity inner-product queries on the encrypted tree representation. Finally, the scheme is shown to be secure through security proofs of homomorphic encryption. Experimental evaluation results on medical datasets demonstrate the effectiveness of the scheme.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103901"},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000709/pdfft?md5=c8c4923f65a97b115b4f3323d577d702&pid=1-s2.0-S0920548924000709-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941202","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}

引用次数: 0

Quantifying heuristic evaluation 量化启发式评估

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-29 DOI: 10.1016/j.csi.2024.103891

Marc Gonzalez Capdevila , Karine Aparecida Pistili Rodrigues , Tales Augusto Sartório Furlan , Toni Granollers

{"title":"Quantifying heuristic evaluation","authors":"Marc Gonzalez Capdevila , Karine Aparecida Pistili Rodrigues , Tales Augusto Sartório Furlan , Toni Granollers","doi":"10.1016/j.csi.2024.103891","DOIUrl":"10.1016/j.csi.2024.103891","url":null,"abstract":"<div><p>Since Nielsen presented his work on heuristic evaluation in the 90s, it has been seen how this inspection method has been used recurrently not only in academia but also in the industry. The benefits of their application have been studied widely and multiple heuristics for multiple purposes have been designed. Despite it, quantifying their qualitative nature has been challenging. This research presents a novel approach to provide a framework for quantifying an heuristic evaluation based on the calculus of what we called Usability Percentage. We have used an initial study that started in 2018 with 7 different evaluators and we presented a new methodology to calculate the aforementioned percentage and also provide multiple information that might be added into a final report. We have used the platform RUXAILAB that allows us to create heuristic evaluations to prepare and execute the test. Our findings are that by comparing both studies the new methodology presents a narrowed data distribution through the different evaluators and allows us to identify in a more precise and concise way which heuristics might fail in an evaluation test.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103891"},"PeriodicalIF":4.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941201","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}

引用次数: 0

Privacy-preserving top-k spatio-temporal keyword preference query 保护隐私的顶k时空关键词偏好查询

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-27 DOI: 10.1016/j.csi.2024.103900

Xuan Zhao, Jia Yu

{"title":"Privacy-preserving top-k spatio-temporal keyword preference query","authors":"Xuan Zhao, Jia Yu","doi":"10.1016/j.csi.2024.103900","DOIUrl":"10.1016/j.csi.2024.103900","url":null,"abstract":"<div><p>With the rapid advancement of location-based services and mobile devices, spatial keyword query attracts increasing attention. In this paper, we focus on a new query type known as top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference query. This kind of query considers both the spatial object itself and other spatial objects in the neighborhood to return <span><math><mi>k</mi></math></span> spatial objects with the highest score. These <span><math><mi>k</mi></math></span> spatial objects satisfy spatial and temporal constraints, while their scores are determined by the keyword similarity of the neighboring spatial objects. We propose a scheme to enable privacy-preserving top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference queries. To effectively represent temporal information, we employ time vectors to denote time periods, allowing us to assess whether the data satisfies temporal constraints based on the inner product of time vectors. Furthermore, we adopt a two-step strategy to execute the query. The first step is to find all Points of Interest (POIs) that meet the spatial and temporal constraints. The second step is to calculate the score of each POI and return the top-<span><math><mi>k</mi></math></span> POIs with the highest score. To enhance query efficiency, we build a tree index structure that can achieve sub-linear query complexity. Additionally, we utilize <em>EASPE</em> algorithm to encrypt both the index and the query, ensuring privacy-preserving capabilities. Security analysis proves that our scheme satisfies CQA2-security. At the same time, experimental evaluation validates the query performance of our scheme.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103900"},"PeriodicalIF":4.1,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141838718","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}

引用次数: 0

Framework of standards, guides and methodologies for project, program, portfolio, and PMO management 项目、计划、组合和项目管理办公室管理的标准、指南和方法框架

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-26 DOI: 10.1016/j.csi.2024.103888

João Varajão , Luciana Lopes , Alexandra Tenera

{"title":"Framework of standards, guides and methodologies for project, program, portfolio, and PMO management","authors":"João Varajão , Luciana Lopes , Alexandra Tenera","doi":"10.1016/j.csi.2024.103888","DOIUrl":"10.1016/j.csi.2024.103888","url":null,"abstract":"<div><p>Project, program, portfolio, and Project Management Office (PMO) management standards, guides, and methodologies are indispensable for professionals and companies as they reflect the best practices in the area. However, the number and diversity of extant documents are significant and growing, making their identification, study, and selection difficult. To help overcome this issue, this article presents a framework that integrates and organizes a wide range of concepts, standards, guides, and methodologies for project, program, portfolio, and PMO management. We carried out a literature review of the available documents published by several international entities, including the leading professional associations. The documents were then compiled, analyzed, and organized comprehensively. Theoretically, the proposed framework provides a structured perspective on the standards, guides, and methodologies according to their purpose, scope, and detail. It is also a valuable tool for assisting practitioners in identifying references for managing their projects, programs, portfolios, and PMOs. Moreover, it provides teachers, students, and training entities with a basis for studying standards, guides, and methodologies and designing training courses.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103888"},"PeriodicalIF":4.1,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000576/pdfft?md5=d8bbfe5cedb165cf1118120ec7c211e2&pid=1-s2.0-S0920548924000576-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141848114","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}

引用次数: 0

Privacy-preserving fair outsourcing polynomial computation without FHE and FPR 无 FHE 和 FPR 的隐私保护公平外包多项式计算

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-25 DOI: 10.1016/j.csi.2024.103899

Qiang Wang, Ying Wang, Fucai Zhou, Jian Xu, Changsheng Zhang

{"title":"Privacy-preserving fair outsourcing polynomial computation without FHE and FPR","authors":"Qiang Wang, Ying Wang, Fucai Zhou, Jian Xu, 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}

引用次数: 0

Revisiting “online/offline provable data possession” schemes 重新审视 "在线/离线可证明数据拥有 "计划

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-24 DOI: 10.1016/j.csi.2024.103898

Feng Wang , Changlu Lin , Manli Yuan

引用次数: 0

Revocable identity-based designated verifier proxy re-signature with signature evolution 可撤销的基于身份的指定验证人代理重新签名与签名演变

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-23 DOI: 10.1016/j.csi.2024.103894

Qiu Zhang , Yinxia Sun , Yang Lu , Wensheng Huang

{"title":"Revocable identity-based designated verifier proxy re-signature with signature evolution","authors":"Qiu Zhang , Yinxia Sun , Yang Lu , 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}

引用次数: 0

Interpreting the latent space of a Convolutional Variational Autoencoder for semi-automated eye blink artefact detection in EEG signals 解读卷积变异自动编码器的潜空间，用于脑电信号中的半自动眨眼伪影检测

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-23 DOI: 10.1016/j.csi.2024.103897

Sabatina Criscuolo , Andrea Apicella , Roberto Prevete , Luca Longo

{"title":"Interpreting the latent space of a Convolutional Variational Autoencoder for semi-automated eye blink artefact detection in EEG signals","authors":"Sabatina Criscuolo , Andrea Apicella , Roberto Prevete , 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}

引用次数: 0

Specific feature selection in wearable EEG-based transducers for monitoring high cognitive load in neurosurgeons 用于监测神经外科医生高认知负荷的可穿戴脑电图传感器的特定特征选择

IF 4.1 2区计算机科学

Computer Standards & Interfaces Pub Date : 2024-07-23 DOI: 10.1016/j.csi.2024.103896

Pasquale Arpaia , Mirco Frosolone , Ludovica Gargiulo , Nicola Moccaldi , Marco Nalin , Alessandro Perin , Cosimo Puttilli

{"title":"Specific feature selection in wearable EEG-based transducers for monitoring high cognitive load in neurosurgeons","authors":"Pasquale Arpaia , Mirco Frosolone , Ludovica Gargiulo , Nicola Moccaldi , Marco Nalin , Alessandro Perin , 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}

引用次数: 0