首页 > 最新文献

ACM Transactions on Privacy and Security最新文献

英文 中文
Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction Euler:通过可伸缩的时间链路预测检测网络横向移动
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-24 DOI: 10.1145/3588771
I. J. King, Huimin Huang
Lateral movement is a key stage of system compromise used by advanced persistent threats. Detecting it is no simple task. When network host logs are abstracted into discrete temporal graphs, the problem can be reframed as anomalous edge detection in an evolving network. Research in modern deep graph learning techniques has produced many creative and complicated models for this task. However, as is the case in many machine learning fields, the generality of models is of paramount importance for accuracy and scalability during training and inference. In this article, we propose a formalized approach to this problem with a framework we call Euler. It consists of a model-agnostic graph neural network stacked upon a model-agnostic sequence encoding layer such as a recurrent neural network. Models built according to the Euler framework can easily distribute their graph convolutional layers across multiple machines for large performance improvements. Additionally, we demonstrate that Euler-based models are as good, or better, than every state-of-the-art approach to anomalous link detection and prediction that we tested. As anomaly-based intrusion detection systems, our models efficiently identified anomalous connections between entities with high precision and outperformed all other unsupervised techniques for anomalous lateral movement detection. Additionally, we show that as a piece of a larger anomaly detection pipeline, Euler models perform well enough for use in real-world systems. With more advanced, yet still lightweight, alerting mechanisms ingesting the embeddings produced by Euler models, precision is boosted from 0.243, to 0.986 on real-world network traffic.
横向移动是高级持续威胁所使用的系统折衷的关键阶段。检测它不是一项简单的任务。当网络主机日志被抽象为离散的时间图时,该问题可以被重新定义为进化网络中的异常边缘检测。现代深度图学习技术的研究已经为这项任务产生了许多创造性的复杂模型。然而,与许多机器学习领域的情况一样,模型的通用性对于训练和推理过程中的准确性和可扩展性至关重要。在本文中,我们提出了一种形式化的方法来解决这个问题,我们称之为Euler的框架。它由堆叠在模型不可知序列编码层(如递归神经网络)上的模型不可知图神经网络组成。根据Euler框架构建的模型可以很容易地将其图卷积层分布在多台机器上,以大幅提高性能。此外,我们证明了基于欧拉的模型与我们测试的所有最先进的异常链路检测和预测方法一样好,甚至更好。作为基于异常的入侵检测系统,我们的模型以高精度有效地识别了实体之间的异常连接,并在异常横向移动检测方面优于所有其他无监督技术。此外,我们还表明,作为一个更大的异常检测管道的一部分,欧拉模型的性能足以在现实世界的系统中使用。随着更先进但仍然轻量级的警报机制吸收了欧拉模型产生的嵌入,真实世界网络流量的精度从0.243提高到0.986。
{"title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","authors":"I. J. King, Huimin Huang","doi":"10.1145/3588771","DOIUrl":"https://doi.org/10.1145/3588771","url":null,"abstract":"Lateral movement is a key stage of system compromise used by advanced persistent threats. Detecting it is no simple task. When network host logs are abstracted into discrete temporal graphs, the problem can be reframed as anomalous edge detection in an evolving network. Research in modern deep graph learning techniques has produced many creative and complicated models for this task. However, as is the case in many machine learning fields, the generality of models is of paramount importance for accuracy and scalability during training and inference. In this article, we propose a formalized approach to this problem with a framework we call Euler. It consists of a model-agnostic graph neural network stacked upon a model-agnostic sequence encoding layer such as a recurrent neural network. Models built according to the Euler framework can easily distribute their graph convolutional layers across multiple machines for large performance improvements. Additionally, we demonstrate that Euler-based models are as good, or better, than every state-of-the-art approach to anomalous link detection and prediction that we tested. As anomaly-based intrusion detection systems, our models efficiently identified anomalous connections between entities with high precision and outperformed all other unsupervised techniques for anomalous lateral movement detection. Additionally, we show that as a piece of a larger anomaly detection pipeline, Euler models perform well enough for use in real-world systems. With more advanced, yet still lightweight, alerting mechanisms ingesting the embeddings produced by Euler models, precision is boosted from 0.243, to 0.986 on real-world network traffic.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44216238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
PrivExtractor: Toward Redressing the Imbalance of Understanding between Virtual Assistant Users and Vendors PrivExtractor:解决虚拟助手用户和供应商之间理解的不平衡
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-23 DOI: 10.1145/3588770
T. Bolton, T. Dargahi, Sana Belguith, C. Maple
The use of voice-controlled virtual assistants (VAs) is significant, and user numbers increase every year. Extensive use of VAs has provided the large, cash-rich technology companies who sell them with another way of consuming users’ data, providing a lucrative revenue stream. Whilst these companies are legally obliged to treat users’ information “fairly and responsibly,” artificial intelligence techniques used to process data have become incredibly sophisticated, leading to users’ concerns that a lack of clarity is making it hard to understand the nature and scope of data collection and use. There has been little work undertaken on a self-contained user awareness tool targeting VAs. PrivExtractor, a novel web-based awareness dashboard for VA users, intends to redress this imbalance of understanding between the data “processors” and the user. It aims to achieve this using the four largest VA vendors as a case study and providing a comparison function that examines the four companies’ privacy practices and their compliance with data protection law. As a result of this research, we conclude that the companies studied are largely compliant with the law, as expected. However, the user remains disadvantaged due to the ineffectiveness of current data regulation that does not oblige the companies to fully and transparently disclose how and when they use, share, or profit from the data. Furthermore, the software tool developed during the research is, we believe, the first that is capable of a comparative analysis of VA privacy with a visual demonstration to increase ease of understanding for the user.
语音控制虚拟助手(VAs)的使用非常重要,用户数量每年都在增加。VAs的广泛使用,为那些现金充裕的大型科技公司提供了另一种消费用户数据的方式,提供了一种利润丰厚的收入来源。虽然这些公司在法律上有义务“公平和负责任地”对待用户的信息,但用于处理数据的人工智能技术已经变得非常复杂,导致用户担心缺乏明确性使其难以理解数据收集和使用的性质和范围。在针对虚拟助理的独立用户意识工具方面开展的工作很少。PrivExtractor是一款针对VA用户的新型基于网络的感知仪表板,旨在纠正数据“处理器”和用户之间的这种理解失衡。为了实现这一目标,它将四家最大的虚拟服务供应商作为案例研究,并提供一个比较功能,检查这四家公司的隐私实践及其对数据保护法的遵守情况。根据这项研究,我们得出的结论是,所研究的公司在很大程度上遵守了法律,正如预期的那样。然而,由于当前数据监管的无效,用户仍然处于不利地位,这些监管并未要求公司充分透明地披露他们如何以及何时使用、分享或从数据中获利。此外,我们认为,在研究期间开发的软件工具是第一个能够通过可视化演示对VA隐私进行比较分析的软件工具,以增加用户的理解难度。
{"title":"PrivExtractor: Toward Redressing the Imbalance of Understanding between Virtual Assistant Users and Vendors","authors":"T. Bolton, T. Dargahi, Sana Belguith, C. Maple","doi":"10.1145/3588770","DOIUrl":"https://doi.org/10.1145/3588770","url":null,"abstract":"The use of voice-controlled virtual assistants (VAs) is significant, and user numbers increase every year. Extensive use of VAs has provided the large, cash-rich technology companies who sell them with another way of consuming users’ data, providing a lucrative revenue stream. Whilst these companies are legally obliged to treat users’ information “fairly and responsibly,” artificial intelligence techniques used to process data have become incredibly sophisticated, leading to users’ concerns that a lack of clarity is making it hard to understand the nature and scope of data collection and use. There has been little work undertaken on a self-contained user awareness tool targeting VAs. PrivExtractor, a novel web-based awareness dashboard for VA users, intends to redress this imbalance of understanding between the data “processors” and the user. It aims to achieve this using the four largest VA vendors as a case study and providing a comparison function that examines the four companies’ privacy practices and their compliance with data protection law. As a result of this research, we conclude that the companies studied are largely compliant with the law, as expected. However, the user remains disadvantaged due to the ineffectiveness of current data regulation that does not oblige the companies to fully and transparently disclose how and when they use, share, or profit from the data. Furthermore, the software tool developed during the research is, we believe, the first that is capable of a comparative analysis of VA privacy with a visual demonstration to increase ease of understanding for the user.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46678769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving Resilient Consensus for Multi-agent Systems in a General Topology Structure 通用拓扑结构下多智能体系统的隐私保护弹性一致性
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-16 DOI: 10.1145/3587933
Jian Hou, Jing Wang, Mingyue Zhang, Zhi Jin, Chunlin Wei, Zuohua Ding
Recent advances of consensus control have made it significant in multi-agent systems such as in distributed machine learning, distributed multi-vehicle cooperative systems. However, during its application it is crucial to achieve resilience and privacy; specifically, when there are adversary/faulty nodes in a general topology structure, normal agents can also reach consensus while keeping their actual states unobserved. In this article, we modify the state-of-the-art Q-consensus algorithm by introducing predefined noise or well-designed cryptography to guarantee the privacy of each agent state. In the former case, we add specified noise on agent state before it is transmitted to the neighbors and then gradually decrease the value of noise so the exact agent state cannot be evaluated. In the latter one, the Paillier cryptosystem is applied for reconstructing reward function in two consecutive interactions between each pair of neighboring agents. Therefore, multi-agent privacy-preserving resilient consensus (MAPPRC) can be achieved in a general topology structure. Moreover, in the modified version, we reconstruct reward function and credibility function so both convergence rate and stability of the system are improved. The simulation results indicate the algorithms’ tolerance for constant and/or persistent faulty agents as well as their protection of privacy. Compared with the previous studies that consider both resilience and privacy-preserving requirements, the proposed algorithms in this article greatly relax the topological conditions. At the end of the article, to verify the effectiveness of the proposed algorithms, we conduct two sets of experiments, i.e., a smart-car hardware platform consisting of four vehicles and a distributed machine learning platform containing 10 workers and a server.
共识控制的最新进展使其在分布式机器学习、分布式多车辆协作系统等多智能体系统中具有重要意义。然而,在应用过程中,实现弹性和隐私是至关重要的;具体来说,当一般拓扑结构中存在对手/故障节点时,正常代理也可以在保持其实际状态不被观察的情况下达成共识。在本文中,我们通过引入预定义的噪声或精心设计的加密来修改最先进的Q-consensus算法,以保证每个代理状态的隐私性。在前一种情况下,我们在智能体状态传递给邻居之前,在其上加入指定的噪声,然后逐渐减小噪声的值,从而无法评估出智能体的确切状态。在后一种算法中,采用Paillier密码系统重构相邻智能体之间的连续交互中的奖励函数。因此,多智能体隐私保护弹性共识(MAPPRC)可以在一般的拓扑结构中实现。此外,在改进版本中,我们重构了奖励函数和可信度函数,从而提高了系统的收敛速度和稳定性。仿真结果表明了算法对持续故障代理的容忍度以及对隐私的保护。与以往同时考虑弹性和隐私保护要求的研究相比,本文提出的算法大大放宽了拓扑条件。在文章的最后,为了验证所提出算法的有效性,我们进行了两组实验,即由四辆车组成的智能汽车硬件平台和包含10名工人和一台服务器的分布式机器学习平台。
{"title":"Privacy-preserving Resilient Consensus for Multi-agent Systems in a General Topology Structure","authors":"Jian Hou, Jing Wang, Mingyue Zhang, Zhi Jin, Chunlin Wei, Zuohua Ding","doi":"10.1145/3587933","DOIUrl":"https://doi.org/10.1145/3587933","url":null,"abstract":"Recent advances of consensus control have made it significant in multi-agent systems such as in distributed machine learning, distributed multi-vehicle cooperative systems. However, during its application it is crucial to achieve resilience and privacy; specifically, when there are adversary/faulty nodes in a general topology structure, normal agents can also reach consensus while keeping their actual states unobserved. In this article, we modify the state-of-the-art Q-consensus algorithm by introducing predefined noise or well-designed cryptography to guarantee the privacy of each agent state. In the former case, we add specified noise on agent state before it is transmitted to the neighbors and then gradually decrease the value of noise so the exact agent state cannot be evaluated. In the latter one, the Paillier cryptosystem is applied for reconstructing reward function in two consecutive interactions between each pair of neighboring agents. Therefore, multi-agent privacy-preserving resilient consensus (MAPPRC) can be achieved in a general topology structure. Moreover, in the modified version, we reconstruct reward function and credibility function so both convergence rate and stability of the system are improved. The simulation results indicate the algorithms’ tolerance for constant and/or persistent faulty agents as well as their protection of privacy. Compared with the previous studies that consider both resilience and privacy-preserving requirements, the proposed algorithms in this article greatly relax the topological conditions. At the end of the article, to verify the effectiveness of the proposed algorithms, we conduct two sets of experiments, i.e., a smart-car hardware platform consisting of four vehicles and a distributed machine learning platform containing 10 workers and a server.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43575658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
RansomShield: A Visualization Approach to Defending Mobile Systems Against Ransomware RansomShield:一种可视化方法来保护移动系统免受勒索软件的侵害
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-13 DOI: https://dl.acm.org/doi/10.1145/3579822
Nada Lachtar, Duha Ibdah, Hamza Khan, Anys Bacha

The unprecedented growth in mobile systems has transformed the way we approach everyday computing. Unfortunately, the emergence of a sophisticated type of malware known as ransomware poses a great threat to consumers of this technology. Traditional research on mobile malware detection has focused on approaches that rely on analyzing bytecode for uncovering malicious apps. However, cybercriminals can bypass such methods by embedding malware directly in native machine code, making traditional methods inadequate. Another challenge that detection solutions face is scalability. The sheer number of malware variants released every year makes it difficult for solutions to efficiently scale their coverage.

To address these concerns, this work presents RansomShield, an energy-efficient solution that leverages CNNs to detect ransomware. We evaluate CNN architectures that have been known to perform well on computer vision tasks and examine their suitability for ransomware detection. We show that systematically converting native instructions from Android apps into images using space-filling curve visualization techniques enable CNNs to reliably detect ransomware with high accuracy. We characterize the robustness of this approach across ARM and x86 architectures and demonstrate the effectiveness of this solution across heterogeneous platforms including smartphones and chromebooks. We evaluate the suitability of different models for mobile systems by comparing their energy demands using different platforms. In addition, we present a CNN introspection framework that determines the important features that are needed for ransomware detection. Finally, we evaluate the robustness of this solution against adversarial machine learning (AML) attacks using state-of-the-art Android malware dataset.

移动系统的空前增长已经改变了我们处理日常计算的方式。不幸的是,一种被称为勒索软件的复杂恶意软件的出现对这种技术的消费者构成了巨大的威胁。传统的移动恶意软件检测研究主要集中在依赖于分析字节码来发现恶意应用程序的方法上。然而,网络犯罪分子可以通过将恶意软件直接嵌入本机机器码来绕过这些方法,这使得传统方法无法发挥作用。检测解决方案面临的另一个挑战是可伸缩性。每年发布的恶意软件变种的绝对数量使得解决方案很难有效地扩展其覆盖范围。为了解决这些问题,这项工作提出了RansomShield,一种利用cnn检测勒索软件的节能解决方案。我们评估了已知在计算机视觉任务上表现良好的CNN架构,并检查了它们对勒索软件检测的适用性。我们表明,使用空间填充曲线可视化技术系统地将Android应用程序的本地指令转换为图像,使cnn能够以高精度可靠地检测勒索软件。我们描述了这种方法在ARM和x86架构上的健壮性,并证明了这种解决方案在包括智能手机和chromebook在内的异构平台上的有效性。我们通过比较使用不同平台的移动系统的能量需求来评估不同模型的适用性。此外,我们提出了一个CNN自省框架,该框架确定了勒索软件检测所需的重要特征。最后,我们使用最先进的Android恶意软件数据集评估了该解决方案对对抗性机器学习(AML)攻击的鲁棒性。
{"title":"RansomShield: A Visualization Approach to Defending Mobile Systems Against Ransomware","authors":"Nada Lachtar, Duha Ibdah, Hamza Khan, Anys Bacha","doi":"https://dl.acm.org/doi/10.1145/3579822","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3579822","url":null,"abstract":"<p>The unprecedented growth in mobile systems has transformed the way we approach everyday computing. Unfortunately, the emergence of a sophisticated type of malware known as ransomware poses a great threat to consumers of this technology. Traditional research on mobile malware detection has focused on approaches that rely on analyzing bytecode for uncovering malicious apps. However, cybercriminals can bypass such methods by embedding malware directly in native machine code, making traditional methods inadequate. Another challenge that detection solutions face is scalability. The sheer number of malware variants released every year makes it difficult for solutions to efficiently scale their coverage. </p><p>To address these concerns, this work presents RansomShield, an energy-efficient solution that leverages CNNs to detect ransomware. We evaluate CNN architectures that have been known to perform well on computer vision tasks and examine their suitability for ransomware detection. We show that systematically converting native instructions from Android apps into images using space-filling curve visualization techniques enable CNNs to reliably detect ransomware with high accuracy. We characterize the robustness of this approach across ARM and x86 architectures and demonstrate the effectiveness of this solution across heterogeneous platforms including smartphones and chromebooks. We evaluate the suitability of different models for mobile systems by comparing their energy demands using different platforms. In addition, we present a CNN introspection framework that determines the important features that are needed for ransomware detection. Finally, we evaluate the robustness of this solution against adversarial machine learning (AML) attacks using state-of-the-art Android malware dataset. </p><p></p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automated Security Assessments of Amazon Web Services Environments Amazon Web服务环境的自动安全评估
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-13 DOI: 10.1145/3570903
Viktor Engström, Pontus Johnson, Robert Lagerström, Erik Ringdahl, Max Wällstedt
Migrating enterprises and business capabilities to cloud platforms like Amazon Web Services (AWS) has become increasingly common. However, securing cloud operations, especially at large scales, can quickly become intractable. Customer-side issues such as service misconfigurations, data breaches, and insecure changes are prevalent. Furthermore, cloud-specific tactics and techniques paired with application vulnerabilities create a large and complex search space. Various solutions and modeling languages for cloud security assessments exist. However, no single one appeared sufficiently cloud-centered and holistic. Many also did not account for tactical security dimensions. This article, therefore, presents a domain-specific modeling language for AWS environments. When used to model AWS environments, manually or automatically, the language automatically constructs and traverses attack graphs to assess security. Assessments, therefore, require minimal security expertise from the user. The modeling language was primarily tested on four third-party AWS environments through securiCAD Vanguard, a commercial tool built around the AWS modeling language. The language was validated further by measuring performance on models provided by anonymous end users and a comparison with a similar open source assessment tool. As of March 2020, the modeling language could represent essential AWS structures, cloud tactics, and threats. However, the tests highlighted certain shortcomings. Data collection steps, such as planted credentials, and some missing tactics were obvious. Nevertheless, the issues covered by the DSL were already reminiscent of common issues with real-world precedents. Future additions to attacker tactics and addressing data collection should yield considerable improvements.
将企业和业务能力迁移到亚马逊网络服务(AWS)等云平台变得越来越普遍。然而,保护云操作,尤其是大规模的云操作,可能很快就会变得棘手。诸如服务配置错误、数据泄露和不安全的更改等客户端问题普遍存在。此外,特定于云的策略和技术与应用程序漏洞相结合,创造了一个庞大而复杂的搜索空间。存在用于云安全评估的各种解决方案和建模语言。然而,没有一个是以云为中心和整体的。许多人也没有考虑到战术安全层面。因此,本文为AWS环境提供了一种特定于领域的建模语言。当用于手动或自动建模AWS环境时,该语言会自动构建和遍历攻击图以评估安全性。因此,评估需要用户提供最低限度的安全专业知识。建模语言主要通过围绕AWS建模语言构建的商业工具securiCAD Vanguard在四个第三方AWS环境中进行了测试。通过测量匿名最终用户提供的模型的性能,并与类似的开源评估工具进行比较,进一步验证了该语言。截至2020年3月,建模语言可能代表基本的AWS结构、云策略和威胁。然而,测试突出了某些缺点。数据收集步骤,如植入凭证,以及一些缺失的策略是显而易见的。尽管如此,DSL所涵盖的问题已经让人想起了现实世界先例中的常见问题。未来对攻击者策略和寻址数据收集的添加应该会带来相当大的改进。
{"title":"Automated Security Assessments of Amazon Web Services Environments","authors":"Viktor Engström, Pontus Johnson, Robert Lagerström, Erik Ringdahl, Max Wällstedt","doi":"10.1145/3570903","DOIUrl":"https://doi.org/10.1145/3570903","url":null,"abstract":"Migrating enterprises and business capabilities to cloud platforms like Amazon Web Services (AWS) has become increasingly common. However, securing cloud operations, especially at large scales, can quickly become intractable. Customer-side issues such as service misconfigurations, data breaches, and insecure changes are prevalent. Furthermore, cloud-specific tactics and techniques paired with application vulnerabilities create a large and complex search space. Various solutions and modeling languages for cloud security assessments exist. However, no single one appeared sufficiently cloud-centered and holistic. Many also did not account for tactical security dimensions. This article, therefore, presents a domain-specific modeling language for AWS environments. When used to model AWS environments, manually or automatically, the language automatically constructs and traverses attack graphs to assess security. Assessments, therefore, require minimal security expertise from the user. The modeling language was primarily tested on four third-party AWS environments through securiCAD Vanguard, a commercial tool built around the AWS modeling language. The language was validated further by measuring performance on models provided by anonymous end users and a comparison with a similar open source assessment tool. As of March 2020, the modeling language could represent essential AWS structures, cloud tactics, and threats. However, the tests highlighted certain shortcomings. Data collection steps, such as planted credentials, and some missing tactics were obvious. Nevertheless, the issues covered by the DSL were already reminiscent of common issues with real-world precedents. Future additions to attacker tactics and addressing data collection should yield considerable improvements.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42337773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices 消费类设备脑波认证技术的性能与可用性评估
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-13 DOI: https://dl.acm.org/doi/10.1145/3579356
Patricia Arias-Cabarcos, Matin Fallahi, Thilo Habrich, Karen Schulze, Christian Becker, Thorsten Strufe

Brainwaves have demonstrated to be unique enough across individuals to be useful as biometrics. They also provide promising advantages over traditional means of authentication, such as resistance to external observability, revocability, and intrinsic liveness detection. However, most of the research so far has been conducted with expensive, bulky, medical-grade helmets, which offer limited applicability for everyday usage. With the aim to bring brainwave authentication and its benefits closer to real world deployment, we investigate brain biometrics with consumer devices. We conduct a comprehensive measurement experiment and user study that compare five authentication tasks on a user sample up to 10 times larger than those from previous studies, introducing three novel techniques based on cognitive semantic processing. Furthermore, we apply our analysis on high-quality open brainwave data obtained with a medical-grade headset, to assess the differences. We investigate both the performance, security, and usability of the different options and use this evidence to elicit design and research recommendations. Our results show that it is possible to achieve Equal Error Rates as low as 7.2% (a reduction between 68–72% with respect to existing approaches) based on brain responses to images with current inexpensive technology. We show that the common practice of testing authentication systems only with known attacker data is unrealistic and may lead to overly optimistic evaluations. With regard to adoption, users call for simpler devices, faster authentication, and better privacy.

脑电波已被证明在个体之间具有足够的独特性,可以用作生物识别技术。与传统的身份验证方法相比,它们也提供了有希望的优势,例如抵抗外部可观察性、可撤销性和内在活性检测。然而,到目前为止,大多数研究都是在昂贵、笨重的医疗级头盔上进行的,这些头盔在日常使用中的适用性有限。为了使脑波认证及其好处更接近现实世界的部署,我们研究了消费设备的大脑生物识别技术。我们进行了一项全面的测量实验和用户研究,在用户样本上比较了五种身份验证任务,该用户样本比以前的研究大10倍,并引入了三种基于认知语义处理的新技术。此外,我们对使用医疗级耳机获得的高质量开放脑电波数据进行分析,以评估差异。我们调查了不同选项的性能、安全性和可用性,并使用这些证据得出设计和研究建议。我们的研究结果表明,使用当前廉价的技术,基于大脑对图像的反应,可以实现低至7.2%的相等错误率(与现有方法相比,降低了68-72%)。我们表明,仅使用已知攻击者数据测试身份验证系统的常见做法是不现实的,并且可能导致过于乐观的评估。在采用方面,用户要求更简单的设备、更快的身份验证和更好的隐私。
{"title":"Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices","authors":"Patricia Arias-Cabarcos, Matin Fallahi, Thilo Habrich, Karen Schulze, Christian Becker, Thorsten Strufe","doi":"https://dl.acm.org/doi/10.1145/3579356","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3579356","url":null,"abstract":"<p>Brainwaves have demonstrated to be unique enough across individuals to be useful as biometrics. They also provide promising advantages over traditional means of authentication, such as resistance to external observability, revocability, and intrinsic liveness detection. However, most of the research so far has been conducted with expensive, bulky, medical-grade helmets, which offer limited applicability for everyday usage. With the aim to bring brainwave authentication and its benefits closer to real world deployment, we investigate brain biometrics with consumer devices. We conduct a comprehensive measurement experiment and user study that compare five authentication tasks on a user sample up to 10 times larger than those from previous studies, introducing three novel techniques based on cognitive semantic processing. Furthermore, we apply our analysis on high-quality open brainwave data obtained with a medical-grade headset, to assess the differences. We investigate both the performance, security, and usability of the different options and use this evidence to elicit design and research recommendations. Our results show that it is possible to achieve Equal Error Rates as low as 7.2% (a reduction between 68–72% with respect to existing approaches) based on brain responses to images with current inexpensive technology. We show that the common practice of testing authentication systems only with known attacker data is unrealistic and may lead to overly optimistic evaluations. With regard to adoption, users call for simpler devices, faster authentication, and better privacy. </p><p></p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Balancing Security and Privacy in Genomic Range Queries 基因组范围查询中安全与隐私的平衡
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-13 DOI: https://dl.acm.org/doi/10.1145/3575796
Seoyeon Hwang, Ercan Ozturk, Gene Tsudik

Exciting recent advances in genome sequencing, coupled with greatly reduced storage and computation costs, make genomic testing increasingly accessible to individuals. Already today, one’s digitized DNA can be easily obtained from a sequencing lab and later used to conduct numerous tests by engaging with a testing facility. Due to the inherent sensitivity of genetic material and the often-proprietary nature of genomic tests, privacy is a natural and crucial issue. While genomic privacy received a great deal of attention within and outside the research community, genomic security has not been sufficiently studied. This is surprising since the usage of fake or altered genomes can have grave consequences, such as erroneous drug prescriptions and genetic test outcomes.

Unfortunately, in the genomic domain, privacy and security (as often happens) are at odds with each other. In this article, we attempt to reconcile security with privacy in genomic testing by designing a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user. The proposed technique ensures authenticity and completeness of user-supplied genomic material while maintaining its privacy by releasing only the minimum thereof. To confirm its broad usability, we show how to apply the proposed technique to a previously proposed genomic private substring matching protocol. Experiments show that the proposed technique offers good performance and is quite practical. Furthermore, we generalize the genomic range query problem to sparse integer sets and discuss potential use cases.

基因组测序方面令人兴奋的最新进展,加上存储和计算成本的大大降低,使个体越来越容易进行基因组检测。今天,一个人的数字化DNA可以很容易地从测序实验室获得,然后通过测试设备进行大量的测试。由于遗传物质固有的敏感性和基因组测试通常的专有性质,隐私是一个自然和关键的问题。虽然基因组隐私在研究界内外受到了极大的关注,但基因组安全尚未得到充分的研究。这是令人惊讶的,因为使用假的或改变的基因组可能会产生严重的后果,比如错误的药物处方和基因测试结果。不幸的是,在基因组领域,隐私和安全(经常发生)是相互矛盾的。在本文中,我们试图通过设计一种新的技术,在基因组测试设备和个人用户之间建立安全和私密的基因组范围查询协议,来协调基因组测试中的安全性和隐私性。所提出的技术保证了用户提供的基因组材料的真实性和完整性,同时通过仅释放最小的基因组材料来保持其隐私。为了证实其广泛的可用性,我们展示了如何将所提出的技术应用于先前提出的基因组私有子串匹配协议。实验表明,该技术具有良好的性能和实用性。此外,我们将基因组范围查询问题推广到稀疏整数集,并讨论了潜在的用例。
{"title":"Balancing Security and Privacy in Genomic Range Queries","authors":"Seoyeon Hwang, Ercan Ozturk, Gene Tsudik","doi":"https://dl.acm.org/doi/10.1145/3575796","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3575796","url":null,"abstract":"<p>Exciting recent advances in genome sequencing, coupled with greatly reduced storage and computation costs, make genomic testing increasingly accessible to individuals. Already today, one’s digitized DNA can be easily obtained from a sequencing lab and later used to conduct numerous tests by engaging with a testing facility. Due to the inherent sensitivity of genetic material and the often-proprietary nature of genomic tests, privacy is a natural and crucial issue. While genomic privacy received a great deal of attention within and outside the research community, genomic security has not been sufficiently studied. This is surprising since the usage of fake or altered genomes can have grave consequences, such as erroneous drug prescriptions and genetic test outcomes.</p><p>Unfortunately, in the genomic domain, privacy and security (as often happens) are at odds with each other. In this article, we attempt to reconcile security with privacy in genomic testing by designing a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user. The proposed technique ensures <i>authenticity</i> and <i>completeness</i> of user-supplied genomic material while maintaining its <i>privacy</i> by releasing only the minimum thereof. To confirm its broad usability, we show how to apply the proposed technique to a previously proposed genomic private substring matching protocol. Experiments show that the proposed technique offers good performance and is quite practical. Furthermore, we generalize the genomic range query problem to sparse integer sets and discuss potential use cases.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
VulANalyzeR: Explainable Binary Vulnerability Detection with Multi-task Learning and Attentional Graph Convolution 基于多任务学习和注意图卷积的可解释二进制漏洞检测
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-03-03 DOI: 10.1145/3585386
Litao Li, Steven H. H. Ding, Yuan Tian, B. Fung, P. Charland, Weihan Ou, Leo Song, Congwei Chen
Software vulnerabilities have been posing tremendous reliability threats to the general public as well as critical infrastructures, and there have been many studies aiming to detect and mitigate software defects at the binary level. Most of the standard practices leverage both static and dynamic analysis, which have several drawbacks like heavy manual workload and high complexity. Existing deep learning-based solutions not only suffer to capture the complex relationships among different variables from raw binary code but also lack the explainability required for humans to verify, evaluate, and patch the detected bugs. We propose VulANalyzeR, a deep learning-based model, for automated binary vulnerability detection, Common Weakness Enumeration-type classification, and root cause analysis to enhance safety and security. VulANalyzeR features sequential and topological learning through recurrent units and graph convolution to simulate how a program is executed. The attention mechanism is integrated throughout the model, which shows how different instructions and the corresponding states contribute to the final classification. It also classifies the specific vulnerability type through multi-task learning as this not only provides further explanation but also allows faster patching for zero-day vulnerabilities. We show that VulANalyzeR achieves better performance for vulnerability detection over the state-of-the-art baselines. Additionally, a Common Vulnerability Exposure dataset is used to evaluate real complex vulnerabilities. We conduct case studies to show that VulANalyzeR is able to accurately identify the instructions and basic blocks that cause the vulnerability even without given any prior knowledge related to the locations during the training phase.
软件漏洞一直对公众和关键基础设施构成巨大的可靠性威胁,许多研究旨在检测和减轻二进制级别的软件缺陷。大多数标准实践同时利用静态和动态分析,这有几个缺点,如手动工作量大和复杂性高。现有的基于深度学习的解决方案不仅难以从原始二进制代码中捕捉不同变量之间的复杂关系,而且缺乏人类验证、评估和修补检测到的错误所需的可解释性。我们提出了基于深度学习的VulANalyzeR模型,用于自动二进制漏洞检测、常见弱点枚举类型分类和根本原因分析,以增强安全性。VulANalyzeR的特点是通过递归单元和图卷积进行顺序和拓扑学习,以模拟程序的执行方式。注意力机制集成在整个模型中,显示了不同的指令和相应的状态如何对最终分类做出贡献。它还通过多任务学习对特定的漏洞类型进行了分类,因为这不仅提供了进一步的解释,而且可以更快地修补零日漏洞。我们表明,与最先进的基线相比,VulANalyzeR在漏洞检测方面实现了更好的性能。此外,通用漏洞暴露数据集用于评估真实的复杂漏洞。我们进行的案例研究表明,VulANalyzeR能够准确识别导致漏洞的指令和基本块,即使在训练阶段没有任何与位置相关的先验知识。
{"title":"VulANalyzeR: Explainable Binary Vulnerability Detection with Multi-task Learning and Attentional Graph Convolution","authors":"Litao Li, Steven H. H. Ding, Yuan Tian, B. Fung, P. Charland, Weihan Ou, Leo Song, Congwei Chen","doi":"10.1145/3585386","DOIUrl":"https://doi.org/10.1145/3585386","url":null,"abstract":"Software vulnerabilities have been posing tremendous reliability threats to the general public as well as critical infrastructures, and there have been many studies aiming to detect and mitigate software defects at the binary level. Most of the standard practices leverage both static and dynamic analysis, which have several drawbacks like heavy manual workload and high complexity. Existing deep learning-based solutions not only suffer to capture the complex relationships among different variables from raw binary code but also lack the explainability required for humans to verify, evaluate, and patch the detected bugs. We propose VulANalyzeR, a deep learning-based model, for automated binary vulnerability detection, Common Weakness Enumeration-type classification, and root cause analysis to enhance safety and security. VulANalyzeR features sequential and topological learning through recurrent units and graph convolution to simulate how a program is executed. The attention mechanism is integrated throughout the model, which shows how different instructions and the corresponding states contribute to the final classification. It also classifies the specific vulnerability type through multi-task learning as this not only provides further explanation but also allows faster patching for zero-day vulnerabilities. We show that VulANalyzeR achieves better performance for vulnerability detection over the state-of-the-art baselines. Additionally, a Common Vulnerability Exposure dataset is used to evaluate real complex vulnerabilities. We conduct case studies to show that VulANalyzeR is able to accurately identify the instructions and basic blocks that cause the vulnerability even without given any prior knowledge related to the locations during the training phase.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49141878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Energy Efficient and Secure Neural Network–based Disease Detection Framework for Mobile Healthcare Network 基于节能安全神经网络的移动医疗网络疾病检测框架
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-02-27 DOI: 10.1145/3585536
Sona Alex, Kirubai Dhanaraj, P. P. Deephi
Adopting mobile healthcare network (MHN) services such as disease detection is fraught with concerns about the security and privacy of the entities involved and the resource restrictions at the Internet of Things (IoT) nodes. Hence, the essential requirements for disease detection services are to (i) produce accurate and fast disease detection without jeopardizing the privacy of health clouds and medical users and (ii) reduce the computational and transmission overhead (energy consumption) of the IoT devices while maintaining the privacy. For privacy preservation of widely used neural network– (NN) based disease detection, existing literature suggests either computationally heavy public key fully homomorphic encryption (FHE), or secure multiparty computation, with a large number of interactions. Hence, the existing privacy-preserving NN schemes are energy consuming and not suitable for resource-constrained IoT nodes in MHN. This work proposes a lightweight, fully homomorphic, symmetric key FHE scheme (SkFhe) to address the issues involved in implementing privacy-preserving NN. Based on SkFhe, widely used non-linear activation functions ReLU and Leaky ReLU are implemented over the encrypted domain. Furthermore, based on the proposed privacy-preserving linear transformation and non-linear activation functions, an energy-efficient, accurate, and privacy-preserving NN is proposed. The proposed scheme guarantees privacy preservation of the health cloud’s NN model and medical user’s data. The experimental analysis demonstrates that the proposed solution dramatically reduces the overhead in communication and computation at the user side compared to the existing schemes. Moreover, the improved energy efficiency at the user is accomplished with reduced diagnosis time without sacrificing classification accuracy.
采用疾病检测等移动医疗网络(MHN)服务充满了对相关实体安全和隐私以及物联网(IoT)节点资源限制的担忧。因此,疾病检测服务的基本要求是(i)在不危害健康云和医疗用户隐私的情况下进行准确快速的疾病检测,以及(ii)在保持隐私的同时减少物联网设备的计算和传输开销(能耗)。为了保护广泛使用的基于神经网络(NN)的疾病检测的隐私,现有文献建议要么是计算量大的公钥全同态加密(FHE),要么是具有大量交互的安全多方计算。因此,现有的隐私保护神经网络方案是耗能的,不适合MHN中资源受限的物联网节点。本文提出了一种轻量级、全同态、对称密钥FHE方案(SkFhe),以解决实现隐私保护神经网络所涉及的问题。基于SkFhe,在加密域上实现了广泛使用的非线性激活函数ReLU和Leaky ReLU。此外,基于所提出的隐私保护线性变换和非线性激活函数,提出了一种节能、准确、隐私保护的神经网络。所提出的方案保证了健康云的NN模型和医疗用户数据的隐私保护。实验分析表明,与现有方案相比,所提出的解决方案显著降低了用户端的通信和计算开销。此外,在不牺牲分类精度的情况下,在减少诊断时间的情况下实现了用户能量效率的提高。
{"title":"Energy Efficient and Secure Neural Network–based Disease Detection Framework for Mobile Healthcare Network","authors":"Sona Alex, Kirubai Dhanaraj, P. P. Deephi","doi":"10.1145/3585536","DOIUrl":"https://doi.org/10.1145/3585536","url":null,"abstract":"Adopting mobile healthcare network (MHN) services such as disease detection is fraught with concerns about the security and privacy of the entities involved and the resource restrictions at the Internet of Things (IoT) nodes. Hence, the essential requirements for disease detection services are to (i) produce accurate and fast disease detection without jeopardizing the privacy of health clouds and medical users and (ii) reduce the computational and transmission overhead (energy consumption) of the IoT devices while maintaining the privacy. For privacy preservation of widely used neural network– (NN) based disease detection, existing literature suggests either computationally heavy public key fully homomorphic encryption (FHE), or secure multiparty computation, with a large number of interactions. Hence, the existing privacy-preserving NN schemes are energy consuming and not suitable for resource-constrained IoT nodes in MHN. This work proposes a lightweight, fully homomorphic, symmetric key FHE scheme (SkFhe) to address the issues involved in implementing privacy-preserving NN. Based on SkFhe, widely used non-linear activation functions ReLU and Leaky ReLU are implemented over the encrypted domain. Furthermore, based on the proposed privacy-preserving linear transformation and non-linear activation functions, an energy-efficient, accurate, and privacy-preserving NN is proposed. The proposed scheme guarantees privacy preservation of the health cloud’s NN model and medical user’s data. The experimental analysis demonstrates that the proposed solution dramatically reduces the overhead in communication and computation at the user side compared to the existing schemes. Moreover, the improved energy efficiency at the user is accomplished with reduced diagnosis time without sacrificing classification accuracy.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43263605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stateful Protocol Composition in Isabelle/HOL Isabelle/HOL中的有状态协议组合
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2023-01-25 DOI: 10.1145/3577020
Andreas V. Hess, S. Mödersheim, Achim D. Brucker
Communication networks like the Internet form a large distributed system where a huge number of components run in parallel, such as security protocols and distributed web applications. For what concerns security, it is obviously infeasible to verify them all at once as one monolithic entity; rather, one has to verify individual components in isolation. While many typical components like TLS have been studied intensively, there exists much less research on analyzing and ensuring the security of the composition of security protocols. This is a problem since the composition of systems that are secure in isolation can easily be insecure. The main goal of compositionality is thus a theorem of the form: given a set of components that are already proved secure in isolation and that satisfy a number of easy-to-check conditions, then also their parallel composition is secure. Said conditions should of course also be realistic in practice, or better yet, already be satisfied for many existing components. Another benefit of compositionality is that when one would like to exchange a component with another one, all that is needed is the proof that the new component is secure in isolation and satisfies the composition conditions—without having to re-prove anything about the other components. This article has three contributions over previous work in parallel compositionality. First, we extend the compositionality paradigm to stateful systems: while previous approaches work only for simple protocols that only have a local session state, our result supports participants who maintain long-term databases that can be shared among several protocols. This includes a paradigm for declassification of shared secrets. This result is in fact so general that it also covers many forms of sequential composition as a special case of stateful parallel composition. Second, our compositionality result is formalized and proved in Isabelle/HOL, providing a strong correctness guarantee of our proofs. This also means that one can prove, without gaps, the security of an entire system in Isabelle/HOL, namely the security of components in isolation and the composition conditions, and thus derive the security of the entire system as an Isabelle theorem. For the components one can also make use of our tool PSPSP that can perform automatic proofs for many stateful protocols. Third, for the compositionality conditions we have also implemented an automated check procedure in Isabelle.
像Internet这样的通信网络形成了一个大型分布式系统,其中大量组件并行运行,例如安全协议和分布式web应用程序。出于安全考虑,将它们作为一个整体同时进行验证显然是不可行的;相反,必须孤立地验证各个组件。虽然人们对TLS等许多典型组件进行了深入的研究,但对安全协议组成的安全性分析和保证的研究却很少。这是一个问题,因为孤立安全的系统组成很容易不安全。因此,组合性的主要目标是这样一个定理:给定一组已经被证明是隔离安全的组件,并且满足许多易于检查的条件,那么它们的并行组合也是安全的。当然,上述条件在实践中也应该是现实的,或者更好的是,已经满足了许多现有组件。组合性的另一个好处是,当想要与另一个组件交换一个组件时,所需要做的就是证明新组件是安全隔离的,并且满足组合条件,而不必重新证明其他组件的任何内容。本文在平行组合性方面比以前的工作有三个贡献。首先,我们将组合性范式扩展到有状态系统:虽然以前的方法仅适用于只有本地会话状态的简单协议,但我们的结果支持维护可以在多个协议之间共享的长期数据库的参与者。这包括一个解密共享机密的范例。事实上,这个结果是如此普遍,以至于它也涵盖了许多形式的顺序组合,作为有状态并行组合的特殊情况。其次,我们的组合性结果在Isabelle/HOL中得到形式化证明,为我们的证明提供了强有力的正确性保证。这也意味着可以无缺口地证明整个系统在Isabelle/HOL中的安全性,即孤立组件和组合条件的安全性,从而导出整个系统的安全性作为Isabelle定理。对于组件,还可以使用我们的工具PSPSP,它可以对许多有状态协议执行自动证明。第三,对于组合性条件,我们还在Isabelle中实现了一个自动检查过程。
{"title":"Stateful Protocol Composition in Isabelle/HOL","authors":"Andreas V. Hess, S. Mödersheim, Achim D. Brucker","doi":"10.1145/3577020","DOIUrl":"https://doi.org/10.1145/3577020","url":null,"abstract":"Communication networks like the Internet form a large distributed system where a huge number of components run in parallel, such as security protocols and distributed web applications. For what concerns security, it is obviously infeasible to verify them all at once as one monolithic entity; rather, one has to verify individual components in isolation. While many typical components like TLS have been studied intensively, there exists much less research on analyzing and ensuring the security of the composition of security protocols. This is a problem since the composition of systems that are secure in isolation can easily be insecure. The main goal of compositionality is thus a theorem of the form: given a set of components that are already proved secure in isolation and that satisfy a number of easy-to-check conditions, then also their parallel composition is secure. Said conditions should of course also be realistic in practice, or better yet, already be satisfied for many existing components. Another benefit of compositionality is that when one would like to exchange a component with another one, all that is needed is the proof that the new component is secure in isolation and satisfies the composition conditions—without having to re-prove anything about the other components. This article has three contributions over previous work in parallel compositionality. First, we extend the compositionality paradigm to stateful systems: while previous approaches work only for simple protocols that only have a local session state, our result supports participants who maintain long-term databases that can be shared among several protocols. This includes a paradigm for declassification of shared secrets. This result is in fact so general that it also covers many forms of sequential composition as a special case of stateful parallel composition. Second, our compositionality result is formalized and proved in Isabelle/HOL, providing a strong correctness guarantee of our proofs. This also means that one can prove, without gaps, the security of an entire system in Isabelle/HOL, namely the security of components in isolation and the composition conditions, and thus derive the security of the entire system as an Isabelle theorem. For the components one can also make use of our tool PSPSP that can perform automatic proofs for many stateful protocols. Third, for the compositionality conditions we have also implemented an automated check procedure in Isabelle.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42345755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
期刊
ACM Transactions on Privacy and Security
全部 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