首页 > 最新文献

ACM Computing Surveys最新文献

英文 中文
Identifying Authorship in Malicious Binaries: Features, Challenges & Datasets 识别恶意二进制文件中的作者身份:特征、挑战和数据集
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-26 DOI: 10.1145/3653973
Jason Gray, Daniele Sgandurra, Lorenzo Cavallaro, Jorge Blasco

Attributing a piece of malware to its creator typically requires threat intelligence. Binary attribution increases the level of difficulty as it mostly relies upon the ability to disassemble binaries to obtain authorship-related features. We perform a systematic analysis of works in the area of malware authorship attribution. We identify key findings, some shortcomings of current approaches and explore the open research challenges. To mitigate the lack of ground truth datasets in this domain, we publish alongside this survey the largest and most diverse meta-information dataset of 17,513 malware labeled to 275 threat actor groups.

将恶意软件归属于其创建者通常需要威胁情报。二进制归属增加了难度,因为它主要依赖于反汇编二进制文件以获取作者相关特征的能力。我们对恶意软件作者归属领域的工作进行了系统分析。我们确定了主要发现、当前方法的一些不足之处,并探讨了有待解决的研究难题。为了缓解该领域缺乏基本真实数据集的问题,我们在发布本调查报告的同时,还发布了最大、最多样化的元信息数据集,该数据集包含 17,513 个恶意软件,标记为 275 个威胁行为者团体。
{"title":"Identifying Authorship in Malicious Binaries: Features, Challenges & Datasets","authors":"Jason Gray, Daniele Sgandurra, Lorenzo Cavallaro, Jorge Blasco","doi":"10.1145/3653973","DOIUrl":"https://doi.org/10.1145/3653973","url":null,"abstract":"<p>Attributing a piece of malware to its creator typically requires threat intelligence. Binary attribution increases the level of difficulty as it mostly relies upon the ability to disassemble binaries to obtain authorship-related features. We perform a systematic analysis of works in the area of malware authorship attribution. We identify key findings, some shortcomings of current approaches and explore the open research challenges. To mitigate the lack of ground truth datasets in this domain, we publish alongside this survey the largest and most diverse meta-information dataset of 17,513 malware labeled to 275 threat actor groups.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140291641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semantic data integration and querying: a survey and challenges 语义数据集成与查询:调查与挑战
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-23 DOI: 10.1145/3653317
Maroua Masmoudi, Sana Ben Abdallah Ben Lamine, Mohamed Hedi Karray, Bernard Archimede, Hajer Baazaoui Zghal

Digital revolution produces massive, heterogeneous and isolated data. These latter remain underutilized, unsuitable for integrated querying and knowledge discovering. Hence the importance of this survey on data integration which identifies challenging issues and trends. First, an overview of the different generations and basics of data integration is given. Then, semantic data integration is focused, since it semantically links data allowing wider insights and decision-making. More than thirty works are reviewed. The goal is to help analysts to identify relevant criteria to compare then choose among semantic data integration approaches, focusing on the category (materialized, virtual or hybrid) and querying techniques.

数字革命产生了海量、异构和孤立的数据。这些数据仍未得到充分利用,不适合进行综合查询和知识发现。因此,这份关于数据集成的调查报告就显得尤为重要,它指出了具有挑战性的问题和趋势。首先,概述了数据集成的不同时代和基本原理。然后,重点介绍了语义数据集成,因为语义数据集成从语义上将数据联系起来,使人们能够获得更广泛的见解和决策。对三十多部作品进行了评述。目的是帮助分析人员确定相关标准,以便在语义数据集成方法中进行比较和选择,重点是类别(物化、虚拟或混合)和查询技术。
{"title":"Semantic data integration and querying: a survey and challenges","authors":"Maroua Masmoudi, Sana Ben Abdallah Ben Lamine, Mohamed Hedi Karray, Bernard Archimede, Hajer Baazaoui Zghal","doi":"10.1145/3653317","DOIUrl":"https://doi.org/10.1145/3653317","url":null,"abstract":"<p>Digital revolution produces massive, heterogeneous and isolated data. These latter remain underutilized, unsuitable for integrated querying and knowledge discovering. Hence the importance of this survey on data integration which identifies challenging issues and trends. First, an overview of the different generations and basics of data integration is given. Then, semantic data integration is focused, since it semantically links data allowing wider insights and decision-making. More than thirty works are reviewed. The goal is to help analysts to identify relevant criteria to compare then choose among semantic data integration approaches, focusing on the category (materialized, virtual or hybrid) and querying techniques.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140196110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Survey on the Densest Subgraph Problem and Its Variants 最密子图问题及其变体概览
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-22 DOI: 10.1145/3653298
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi

The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density. The problem has received a great deal of attention in the algorithmic literature over the last five decades, with many variants proposed and many applications built on top of this basic definition. Recent years have witnessed a revival of research interest in this problem with several important contributions, including some groundbreaking results, published in 2022 and 2023. This survey provides a deep overview of the fundamental results and an exhaustive coverage of the many variants proposed in the literature, with a special attention to the most recent results. The survey also presents a comprehensive overview of applications and discusses some interesting open problems for this evergreen research topic.

最密集子图问题(Densest Subgraph Problem)要求在给定的图中找到一个顶点子集,其诱导子图的密度最大。在过去的五十年里,该问题在算法文献中受到了广泛关注,在这一基本定义的基础上提出了许多变体和应用。近年来,人们对这一问题的研究兴趣有所恢复,在 2022 年和 2023 年发表了几篇重要论文,其中包括一些开创性成果。本调查报告深入概述了基本结果,并详尽介绍了文献中提出的许多变体,特别关注了最新结果。调查还全面概述了应用,并讨论了这一常青研究课题的一些有趣的开放性问题。
{"title":"A Survey on the Densest Subgraph Problem and Its Variants","authors":"Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi","doi":"10.1145/3653298","DOIUrl":"https://doi.org/10.1145/3653298","url":null,"abstract":"<p>The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density. The problem has received a great deal of attention in the algorithmic literature over the last five decades, with many variants proposed and many applications built on top of this basic definition. Recent years have witnessed a revival of research interest in this problem with several important contributions, including some groundbreaking results, published in 2022 and 2023. This survey provides a deep overview of the fundamental results and an exhaustive coverage of the many variants proposed in the literature, with a special attention to the most recent results. The survey also presents a comprehensive overview of applications and discusses some interesting open problems for this evergreen research topic.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140188811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Survey on Software Vulnerability Exploitability Assessment 软件漏洞可利用性评估调查
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-20 DOI: 10.1145/3648610
Sarah Elder, Rayhanur Rahman, Gage Fringer, Kunal Kapoor, Laurie Williams

Knowing the exploitability and severity of software vulnerabilities helps practitioners prioritize vulnerability mitigation efforts. Researchers have proposed and evaluated many different exploitability assessment methods. The goal of this research is to assist practitioners and researchers in understanding existing methods for assessing vulnerability exploitability through a survey of exploitability assessment literature. We identify three exploitability assessment approaches: assessments based on original, manual CVSS, automated Deterministic assessments, and automated Probabilistic assessments. Other than the original CVSS, the two most common subcategories are Deterministic, Program-State-Based, and Probabilistic Learning Model (LM) Assessments.

了解软件漏洞的可利用性和严重性有助于从业人员确定漏洞缓解工作的优先次序。研究人员提出并评估了许多不同的可利用性评估方法。本研究的目的是通过对漏洞可利用性评估文献的调查,帮助从业人员和研究人员了解现有的漏洞可利用性评估方法。我们确定了三种可利用性评估方法:基于原始手工 CVSS 的评估、自动确定性评估和自动概率评估。除原始 CVSS 外,最常见的两个子类别是确定性评估、基于程序状态的评估和概率学习模型 (LM) 评估。
{"title":"A Survey on Software Vulnerability Exploitability Assessment","authors":"Sarah Elder, Rayhanur Rahman, Gage Fringer, Kunal Kapoor, Laurie Williams","doi":"10.1145/3648610","DOIUrl":"https://doi.org/10.1145/3648610","url":null,"abstract":"<p>Knowing the exploitability and severity of software vulnerabilities helps practitioners prioritize vulnerability mitigation efforts. Researchers have proposed and evaluated many different exploitability assessment methods. <i>The goal of this research is to assist practitioners and researchers in understanding existing methods for assessing vulnerability exploitability through a survey of exploitability assessment literature.</i> We identify three exploitability assessment approaches: assessments based on original, manual CVSS, automated Deterministic assessments, and automated Probabilistic assessments. Other than the original CVSS, the two most common subcategories are Deterministic, Program-State-Based, and Probabilistic Learning Model (LM) Assessments.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140182720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Taxonomy and Survey on Grid-based Routing Protocols Designed for Wireless Sensor Networks 为无线传感器网络设计的网格路由协议分类与调查
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-20 DOI: 10.1145/3653315
Shubhra Jain, Rahul Kumar Verma

Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks (WSNs), since sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are very popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of WSNs, this paper provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility, i.e., static sink- and mobile sink-based grid routing protocols. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.

在为无线传感器网络(WSN)开发路由协议时,能耗最小化是研究人员的主要关注点,因为传感器节点的电力供应有限。虚拟拓扑是路由的一个组成部分,基于网格的路由协议因其简化、高效的虚拟网格拓扑构建而非常流行。尽管目前已有一系列调查报告,或侧重于更广泛的路由协议,或侧重于其他虚拟拓扑,但这些调查报告都不涉及网格拓扑和基于网格的路由协议。基于这一动机,并考虑到这些路由协议对控制和管理 WSN 能量消耗的影响,本文根据网格路由协议的方法对其进行了广泛评估。在这项调查中,现有的基于网格的路由协议从汇移动性的角度分为两类,即基于静态汇和基于移动汇的网格路由协议。按时间顺序对这些路由协议进行了阶段性的全面概述,并进行了比较分析。此外,还介绍了基于网格的路由协议的特点、设计问题和挑战。
{"title":"A Taxonomy and Survey on Grid-based Routing Protocols Designed for Wireless Sensor Networks","authors":"Shubhra Jain, Rahul Kumar Verma","doi":"10.1145/3653315","DOIUrl":"https://doi.org/10.1145/3653315","url":null,"abstract":"<p>Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks (WSNs), since sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are very popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of WSNs, this paper provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility, i.e., static sink- and mobile sink-based grid routing protocols. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140164688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rearrangement Distance Problems: An updated survey 重排距离问题:最新调查
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-20 DOI: 10.1145/3653295
Andre Rodrigues Oliveira, Klairton Lima Brito, Alexsandro Oliveira Alexandrino, Gabriel Siqueira, Ulisses Dias, Zanoni Dias

One of the challenges in the Comparative Genomics field is to infer how close two organisms are based on the similarities and differences between their genetic materials. Recent advances in DNA sequencing have made complete genomes increasingly available. That said, several new algorithms trying to infer the distance between two organisms based on genome rearrangements have been proposed in the literature. However, given the diversity of approaches, the diversity of genome rearrangement events, or even how each work models the genomes and what assumptions are made by each of them, finding the ideal algorithm for each situation or simply knowing the range of applicable approaches can be challenging. In this work, we review these approaches having the algorithmic and combinatorial advances since 2010 as our main focus. This survey aims to organize the recently published papers using a concise notation and to indicate the gaps filled by each of them in the literature. This makes it easier to understand what still needs to be done and what has room for enhancement.

比较基因组学领域的挑战之一是根据两种生物遗传物质的异同来推断它们之间的亲缘关系。最近,DNA 测序技术的进步使得越来越多的人可以获得完整的基因组。因此,文献中提出了几种新算法,试图根据基因组重排来推断两种生物之间的距离。然而,由于方法的多样性、基因组重排事件的多样性,甚至每种方法是如何建立基因组模型的,以及每种方法都做了哪些假设,因此要为每种情况找到理想的算法,或者仅仅了解适用方法的范围都具有挑战性。在这项工作中,我们以 2010 年以来的算法和组合进展为重点,对这些方法进行了回顾。本调查旨在使用简洁的符号组织近期发表的论文,并指出每篇论文在文献中填补的空白。这样,我们就能更容易地了解哪些方面还有待改进,哪些方面还有提升的空间。
{"title":"Rearrangement Distance Problems: An updated survey","authors":"Andre Rodrigues Oliveira, Klairton Lima Brito, Alexsandro Oliveira Alexandrino, Gabriel Siqueira, Ulisses Dias, Zanoni Dias","doi":"10.1145/3653295","DOIUrl":"https://doi.org/10.1145/3653295","url":null,"abstract":"<p>One of the challenges in the Comparative Genomics field is to infer how close two organisms are based on the similarities and differences between their genetic materials. Recent advances in DNA sequencing have made complete genomes increasingly available. That said, several new algorithms trying to infer the distance between two organisms based on genome rearrangements have been proposed in the literature. However, given the diversity of approaches, the diversity of genome rearrangement events, or even how each work models the genomes and what assumptions are made by each of them, finding the ideal algorithm for each situation or simply knowing the range of applicable approaches can be challenging. In this work, we review these approaches having the algorithmic and combinatorial advances since 2010 as our main focus. This survey aims to organize the recently published papers using a concise notation and to indicate the gaps filled by each of them in the literature. This makes it easier to understand what still needs to be done and what has room for enhancement.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140164553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Epidemic Model-based Network Influential Node Ranking Methods: A Ranking Rationality Perspective 基于流行病模型的网络影响节点排序方法:排名合理性视角
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-19 DOI: 10.1145/3653296
Bing Zhang, Xuyang Zhao, Jiangtian Nie, Jianhang Tang, Yuling Chen, Yang Zhang, Dusit Niyato

Existing surveys and reviews on Influential Node Ranking Methods (INRMs) have primarily focused on technical details, neglecting thorough research on verifying the actual influence of these nodes in a network. This oversight may result in erroneous rankings. In this survey, we address this gap by conducting an extensive analysis of 82 primary studies related to INRMs based on the epidemic model over the past 20 years. We statistically analyze and categorize benchmark networks into four types, and conclude that high-quality networks with complete information are insufficient and most INRMs only focus on undirected and unweighted networks, which encourages collaboration between industry and academia to provide optimized networks. Additionally, we categorize and discuss the strengths, weaknesses, and optimized crafts of seven categories of INRMs, helping engineers and researchers narrow down their choices when selecting appropriate INRMs for their specific needs. Furthermore, we define the Capability and Correctness metrics and utilize their usage frequency and functionality to assist engineers and researchers in prioritizing and selecting suitable metrics for different INRMs and networks. To our knowledge, this is the first survey that systematically summarizes the Capability and Correctness of INRMs, providing insights for the complex network community and aiding INRM selection and evaluation.

现有的影响节点排序方法(INRMs)调查和评论主要关注技术细节,而忽视了对验证这些节点在网络中的实际影响力的深入研究。这种疏忽可能会导致错误的排名。在本调查中,我们对过去 20 年中基于流行病模型的 82 项与 INRM 相关的主要研究进行了广泛分析,从而弥补了这一不足。我们通过统计分析将基准网络分为四种类型,并得出结论:具有完整信息的高质量网络是不够的,大多数 INRM 只关注无向和非加权网络,这鼓励业界和学术界合作提供优化网络。此外,我们还对七类 INRM 的优缺点和优化工艺进行了分类和讨论,帮助工程师和研究人员在根据具体需求选择合适的 INRM 时缩小选择范围。此外,我们还定义了能力和正确性指标,并利用它们的使用频率和功能来帮助工程师和研究人员为不同的 INRM 和网络优先选择合适的指标。据我们所知,这是第一份系统总结 INRM 的能力和正确性的调查报告,为复杂网络社区提供了深入见解,并有助于 INRM 的选择和评估。
{"title":"Epidemic Model-based Network Influential Node Ranking Methods: A Ranking Rationality Perspective","authors":"Bing Zhang, Xuyang Zhao, Jiangtian Nie, Jianhang Tang, Yuling Chen, Yang Zhang, Dusit Niyato","doi":"10.1145/3653296","DOIUrl":"https://doi.org/10.1145/3653296","url":null,"abstract":"<p>Existing surveys and reviews on Influential Node Ranking Methods (INRMs) have primarily focused on technical details, neglecting thorough research on verifying the actual influence of these nodes in a network. This oversight may result in erroneous rankings. In this survey, we address this gap by conducting an extensive analysis of 82 primary studies related to INRMs based on the epidemic model over the past 20 years. We statistically analyze and categorize benchmark networks into four types, and conclude that high-quality networks with complete information are insufficient and most INRMs only focus on undirected and unweighted networks, which encourages collaboration between industry and academia to provide optimized networks. Additionally, we categorize and discuss the strengths, weaknesses, and optimized crafts of seven categories of INRMs, helping engineers and researchers narrow down their choices when selecting appropriate INRMs for their specific needs. Furthermore, we define the Capability and Correctness metrics and utilize their usage frequency and functionality to assist engineers and researchers in prioritizing and selecting suitable metrics for different INRMs and networks. To our knowledge, this is the first survey that systematically summarizes the Capability and Correctness of INRMs, providing insights for the complex network community and aiding INRM selection and evaluation.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140161772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy Preservation of Electronic Health Records in the Modern Era: A Systematic Survey 现代电子健康记录的隐私保护:系统调查
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-19 DOI: 10.1145/3653297
Raza Nowrozy, Khandakar Ahmed, A.S.M. Kayes, Hua Wang, Timothy R. McIntosh

Building a secure and privacy-preserving health data sharing framework is a topic of great interest in the healthcare sector, but its success is subject to ensuring the privacy of user data. We clarified the definitions of privacy, confidentiality and security (PCS) because these three terms have been used interchangeably in the literature. We found that researchers and developers must address the differences of these three terms when developing electronic health record (EHR) solutions. We surveyed 130 studies on EHRs, privacy-preserving techniques, and tools that were published between 2012 and 2022, aiming to preserve the privacy of EHRs. The observations and findings were summarized with the help of the identified studies framed along the survey questions addressed in the literature review. Our findings suggested that the usage of access control, blockchain, cloud-based, and cryptography techniques is common for EHR data sharing. We summarized the commonly used strategies for preserving privacy that are implemented by various EHR tools. Additionally, we collated a comprehensive list of differences and similarities between PCS. Finally, we summarized the findings in a tabular form for all EHR tools and techniques and proposed a fusion of techniques to better preserve the PCS of EHRs.

建立一个安全且能保护隐私的健康数据共享框架是医疗保健领域非常关注的话题,但其成功与否取决于能否确保用户数据的隐私。我们澄清了隐私、保密和安全 (PCS) 的定义,因为这三个术语在文献中交替使用。我们发现,研究人员和开发人员在开发电子健康记录 (EHR) 解决方案时,必须解决这三个术语之间的差异。我们调查了 2012 年至 2022 年间发表的 130 篇关于电子健康记录、隐私保护技术和工具的研究,旨在保护电子健康记录的隐私。我们根据文献综述中提出的调查问题,对已确定的研究进行了观察和发现总结。我们的研究结果表明,在电子病历数据共享中,访问控制、区块链、云技术和加密技术的使用非常普遍。我们总结了各种电子病历工具常用的隐私保护策略。此外,我们还整理了 PCS 之间的全面异同列表。最后,我们以表格形式总结了所有电子病历工具和技术的研究结果,并提出了一种技术融合方案,以更好地保护电子病历的 PCS。
{"title":"Privacy Preservation of Electronic Health Records in the Modern Era: A Systematic Survey","authors":"Raza Nowrozy, Khandakar Ahmed, A.S.M. Kayes, Hua Wang, Timothy R. McIntosh","doi":"10.1145/3653297","DOIUrl":"https://doi.org/10.1145/3653297","url":null,"abstract":"<p>Building a secure and privacy-preserving health data sharing framework is a topic of great interest in the healthcare sector, but its success is subject to ensuring the privacy of user data. We clarified the definitions of privacy, confidentiality and security (PCS) because these three terms have been used interchangeably in the literature. We found that researchers and developers must address the differences of these three terms when developing electronic health record (EHR) solutions. We surveyed 130 studies on EHRs, privacy-preserving techniques, and tools that were published between 2012 and 2022, aiming to preserve the privacy of EHRs. The observations and findings were summarized with the help of the identified studies framed along the survey questions addressed in the literature review. Our findings suggested that the usage of access control, blockchain, cloud-based, and cryptography techniques is common for EHR data sharing. We summarized the commonly used strategies for preserving privacy that are implemented by various EHR tools. Additionally, we collated a comprehensive list of differences and similarities between PCS. Finally, we summarized the findings in a tabular form for all EHR tools and techniques and proposed a fusion of techniques to better preserve the PCS of EHRs.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140161770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Survey on Cyber-Resilience Approaches for Cyber-Physical Systems 网络物理系统的网络复原力方法概览
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-16 DOI: 10.1145/3652953
Mariana Segovia-Ferreira, Jose Rubio-Hernan, Ana Rosa Cavalli, Joaquin Garcia-Alfaro

Concerns for the resilience of Cyber-Physical Systems (CPS) in critical infrastructure are growing. CPS integrate sensing, computation, control, and networking into physical objects and mission-critical services, connecting traditional infrastructure to internet technologies. While this integration increases service efficiency, it has to face the possibility of new threats posed by the new functionalities. This leads to cyber-threats, such as denial-of-service, modification of data, information leakage, spreading of malware, and many others. Cyber-resilience refers to the ability of a CPS to prepare, absorb, recover, and adapt to the adverse effects associated with cyber-threats, e.g., physical degradation of the CPS performance resulting from a cyber-attack. Cyber-resilience aims at ensuring CPS survival, by keeping the core functionalities of the CPS in case of extreme events. The literature on cyber-resilience is rapidly increasing, leading to a broad variety of research works addressing this new topic. In this article, we create a systematization of knowledge about existing scientific efforts of making CPS cyber-resilient. We systematically survey recent literature addressing cyber-resilience with a focus on techniques that may be used on CPS. We first provide preliminaries and background on CPS and threats, and subsequently survey state-of-the-art approaches that have been proposed by recent research work applicable to CPS. In particular, we aim at differentiating research work from traditional risk management approaches, based on the general acceptance that it is unfeasible to prevent and mitigate all possible risks threatening a CPS. We also discuss questions and research challenges, with a focus on the practical aspects of cyber-resilience, such as the use of metrics and evaluation methods, as well as testing and validation environments.

人们越来越关注关键基础设施中网络物理系统(CPS)的恢复能力。网络物理系统将传感、计算、控制和网络整合到物理对象和关键任务服务中,将传统基础设施与互联网技术连接起来。这种整合在提高服务效率的同时,也必须面对新功能可能带来的新威胁。这就导致了网络威胁,如拒绝服务、修改数据、信息泄露、恶意软件传播等。网络复原力是指 CPS 准备、吸收、恢复和适应与网络威胁相关的不利影响的能力,如网络攻击导致的 CPS 性能物理下降。网络复原力旨在确保 CPS 的生存,在极端事件发生时保持 CPS 的核心功能。有关网络复原力的文献正在迅速增加,导致针对这一新课题的研究工作种类繁多。在本文中,我们将对现有的使 CPS 具有网络复原力的科学工作进行系统化的知识梳理。我们系统地调查了近期有关网络复原力的文献,重点关注可用于 CPS 的技术。我们首先介绍了 CPS 和威胁的前言和背景,随后调查了近期研究工作提出的适用于 CPS 的最新方法。特别是,我们的目标是将研究工作与传统的风险管理方法区分开来,因为人们普遍认为,要预防和减轻威胁 CPS 的所有可能风险是不可行的。我们还讨论了问题和研究挑战,重点是网络复原力的实际方面,如指标和评估方法的使用,以及测试和验证环境。
{"title":"A Survey on Cyber-Resilience Approaches for Cyber-Physical Systems","authors":"Mariana Segovia-Ferreira, Jose Rubio-Hernan, Ana Rosa Cavalli, Joaquin Garcia-Alfaro","doi":"10.1145/3652953","DOIUrl":"https://doi.org/10.1145/3652953","url":null,"abstract":"<p>Concerns for the resilience of Cyber-Physical Systems (CPS) in critical infrastructure are growing. CPS integrate sensing, computation, control, and networking into physical objects and mission-critical services, connecting traditional infrastructure to internet technologies. While this integration increases service efficiency, it has to face the possibility of new threats posed by the new functionalities. This leads to cyber-threats, such as denial-of-service, modification of data, information leakage, spreading of malware, and many others. Cyber-resilience refers to the ability of a CPS to prepare, absorb, recover, and adapt to the adverse effects associated with cyber-threats, e.g., physical degradation of the CPS performance resulting from a cyber-attack. Cyber-resilience aims at ensuring CPS survival, by keeping the core functionalities of the CPS in case of extreme events. The literature on cyber-resilience is rapidly increasing, leading to a broad variety of research works addressing this new topic. In this article, we create a systematization of knowledge about existing scientific efforts of making CPS cyber-resilient. We systematically survey recent literature addressing cyber-resilience with a focus on techniques that may be used on CPS. We first provide preliminaries and background on CPS and threats, and subsequently survey state-of-the-art approaches that have been proposed by recent research work applicable to CPS. In particular, we aim at differentiating research work from traditional risk management approaches, based on the general acceptance that it is unfeasible to prevent and mitigate all possible risks threatening a CPS. We also discuss questions and research challenges, with a focus on the practical aspects of cyber-resilience, such as the use of metrics and evaluation methods, as well as testing and validation environments.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140142075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mobile Near-Infrared Sensing - A Systematic Review on Devices, Data, Modeling and Applications 移动近红外传感--关于设备、数据、建模和应用的系统综述
IF 16.6 1区 计算机科学 Q1 Mathematics Pub Date : 2024-03-16 DOI: 10.1145/3652596
Weiwei Jiang, Jorge Goncalves, Vassilis Kostakos

Mobile near-infrared sensing is becoming an increasingly important method in many research and industrial areas. To help consolidate progress in this area, we use the PRISMA guidelines to conduct a systematic review of mobile near-infrared sensing, including 1) existing prototypes and commercial products; 2) data collection techniques; 3) machine learning methods; 4) relevant application areas. Our work measures historical and current trends, and identifies current challenges and future directions for this emerging topic.

在许多研究和工业领域,移动近红外传感正成为一种日益重要的方法。为了帮助巩固这一领域的进展,我们利用 PRISMA 准则对移动近红外传感进行了系统性回顾,包括:1)现有原型和商业产品;2)数据收集技术;3)机器学习方法;4)相关应用领域。我们的工作衡量了历史和当前趋势,并确定了这一新兴课题的当前挑战和未来方向。
{"title":"Mobile Near-Infrared Sensing - A Systematic Review on Devices, Data, Modeling and Applications","authors":"Weiwei Jiang, Jorge Goncalves, Vassilis Kostakos","doi":"10.1145/3652596","DOIUrl":"https://doi.org/10.1145/3652596","url":null,"abstract":"<p>Mobile near-infrared sensing is becoming an increasingly important method in many research and industrial areas. To help consolidate progress in this area, we use the PRISMA guidelines to conduct a systematic review of mobile near-infrared sensing, including 1) existing prototypes and commercial products; 2) data collection techniques; 3) machine learning methods; 4) relevant application areas. Our work measures historical and current trends, and identifies current challenges and future directions for this emerging topic.</p>","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":null,"pages":null},"PeriodicalIF":16.6,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140139446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
ACM Computing Surveys
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1