首页 > 最新文献

ACM Transactions on Privacy and Security最新文献

英文 中文
Privacy-preserving Decentralized Federated Learning over Time-varying Communication Graph 时变通信图上保护隐私的分散联邦学习
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-10-01 DOI: 10.1145/3591354
Yang Lu, Zhengxin Yu, N. Suri
Establishing how a set of learners can provide privacy-preserving federated learning in a fully decentralized (peer-to-peer, no coordinator) manner is an open problem. We propose the first privacy-preserving consensus-based algorithm for the distributed learners to achieve decentralized global model aggregation in an environment of high mobility, where participating learners and the communication graph between them may vary during the learning process. In particular, whenever the communication graph changes, the Metropolis-Hastings method [69] is applied to update the weighted adjacency matrix based on the current communication topology. In addition, the Shamir’s secret sharing (SSS) scheme [61] is integrated to facilitate privacy in reaching consensus of the global model. The article establishes the correctness and privacy properties of the proposed algorithm. The computational efficiency is evaluated by a simulation built on a federated learning framework with a real-world dataset.
建立一组学习器如何以完全分散(点对点,没有协调器)的方式提供保护隐私的联邦学习是一个开放的问题。本文提出了第一种基于共识的分布式学习算法,用于在高流动性环境下实现分布式全局模型聚合,该环境下参与学习的学习者及其之间的通信图可能在学习过程中发生变化。特别是,当通信图发生变化时,采用Metropolis-Hastings方法[69]根据当前通信拓扑更新加权邻接矩阵。此外,还集成了Shamir秘密共享(SSS)方案[61],以促进隐私达成全球模型的共识。本文建立了该算法的正确性和隐私性。通过建立在具有真实数据集的联邦学习框架上的仿真来评估计算效率。
{"title":"Privacy-preserving Decentralized Federated Learning over Time-varying Communication Graph","authors":"Yang Lu, Zhengxin Yu, N. Suri","doi":"10.1145/3591354","DOIUrl":"https://doi.org/10.1145/3591354","url":null,"abstract":"Establishing how a set of learners can provide privacy-preserving federated learning in a fully decentralized (peer-to-peer, no coordinator) manner is an open problem. We propose the first privacy-preserving consensus-based algorithm for the distributed learners to achieve decentralized global model aggregation in an environment of high mobility, where participating learners and the communication graph between them may vary during the learning process. In particular, whenever the communication graph changes, the Metropolis-Hastings method [69] is applied to update the weighted adjacency matrix based on the current communication topology. In addition, the Shamir’s secret sharing (SSS) scheme [61] is integrated to facilitate privacy in reaching consensus of the global model. The article establishes the correctness and privacy properties of the proposed algorithm. The computational efficiency is evaluated by a simulation built on a federated learning framework with a real-world dataset.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"43 1","pages":"1 - 39"},"PeriodicalIF":2.3,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41272545","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}
引用次数: 4
A Solicitous Approach to Smart Contract Verification 智能合约验证的贴心方法
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-28 DOI: https://dl.acm.org/doi/10.1145/3564699
Rodrigo Otoni, Matteo Marescotti, Leonardo Alt, Patrick Eugster, Antti E. J. Hyvärinen, Natasha Sharygina

Smart contracts are tempting targets of attacks, since they often hold and manipulate significant financial assets, are immutable after deployment, and have publicly available source code, with assets estimated in the order of millions of US Dollars being lost in the past due to vulnerabilities. Formal verification is thus a necessity, but smart contracts challenge the existing highly efficient techniques routinely applied in the symbolic verification of software, due to specificities not present in general programming languages. A common feature of existing works in this area is the attempt to reuse off-the-shelf verification tools designed for general programming languages. This reuse can lead to inefficiency and potentially unsound results, since domain translation is required. In this paper we describe a carefully crafted approach that directly models the central aspects of smart contracts natively, going from the contract to its logical representation without intermediary steps. We use the expressive and highly automatable logic of constrained Horn clauses for modeling and we instantiate our approach to the Solidity language. A tool implementing our approach, called Solicitous, was developed and integrated into the SMTChecker module of the Solidity compiler solc. We evaluated our approach on an extensive benchmark set containing 22446 real-world smart contracts deployed on the Ethereum blockchain over a 27 months period. The results show that our approach is able to establish safety of significantly more contracts than comparable, publicly available verification tools, with an order of magnitude increase in the percentage of formally verified contracts.

智能合约是诱人的攻击目标,因为它们通常持有和操纵重要的金融资产,部署后不可变,并且具有公开可用的源代码,过去由于漏洞而损失的资产估计在数百万美元左右。因此,形式验证是必要的,但由于一般编程语言中不存在的特殊性,智能合约挑战了常规应用于软件符号验证的现有高效技术。该领域现有工作的一个共同特征是尝试重用为通用编程语言设计的现成验证工具。这种重用可能会导致效率低下和潜在的不可靠结果,因为需要进行域转换。在本文中,我们描述了一种精心设计的方法,该方法直接对智能合约的核心方面进行本地建模,从合约到其逻辑表示,无需中间步骤。我们使用富有表现力和高度自动化的约束Horn子句逻辑进行建模,并实例化了我们对solid语言的方法。我们开发了一个实现我们方法的工具,名为Solicitous,它被集成到Solidity编译器solc的SMTChecker模块中。我们在一个广泛的基准集上评估了我们的方法,该基准集包含了在27个月内部署在以太坊区块链上的22446个真实世界的智能合约。结果表明,我们的方法能够比可比的、公开可用的验证工具建立更多合同的安全性,并且在正式验证的合同的百分比上增加了一个数量级。
{"title":"A Solicitous Approach to Smart Contract Verification","authors":"Rodrigo Otoni, Matteo Marescotti, Leonardo Alt, Patrick Eugster, Antti E. J. Hyvärinen, Natasha Sharygina","doi":"https://dl.acm.org/doi/10.1145/3564699","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3564699","url":null,"abstract":"<p>Smart contracts are tempting targets of attacks, since they often hold and manipulate significant financial assets, are immutable after deployment, and have publicly available source code, with assets estimated in the order of millions of US Dollars being lost in the past due to vulnerabilities. Formal verification is thus a necessity, but smart contracts challenge the existing highly efficient techniques routinely applied in the symbolic verification of software, due to specificities not present in general programming languages. A common feature of existing works in this area is the attempt to reuse off-the-shelf verification tools designed for general programming languages. This reuse can lead to inefficiency and potentially unsound results, since domain translation is required. In this paper we describe a carefully crafted approach that directly models the central aspects of smart contracts natively, going from the contract to its logical representation without intermediary steps. We use the expressive and highly automatable logic of constrained Horn clauses for modeling and we instantiate our approach to the Solidity language. A tool implementing our approach, called Solicitous, was developed and integrated into the SMTChecker module of the Solidity compiler solc. We evaluated our approach on an extensive benchmark set containing 22446 real-world smart contracts deployed on the Ethereum blockchain over a 27 months period. The results show that our approach is able to establish safety of significantly more contracts than comparable, publicly available verification tools, with an order of magnitude increase in the percentage of formally verified contracts.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"11 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540617","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
A Solicitous Approach to Smart Contract Verification 智能合约验证的一种吸引人的方法
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-28 DOI: 10.1145/3564699
Rodrigo Otoni, Matteo Marescotti, Leonardo S. Alt, P. Eugster, A. Hyvärinen, N. Sharygina
Smart contracts are tempting targets of attacks, as they often hold and manipulate significant financial assets, are immutable after deployment, and have publicly available source code, with assets estimated in the order of millions of dollars being lost in the past due to vulnerabilities. Formal verification is thus a necessity, but smart contracts challenge the existing highly efficient techniques routinely applied in the symbolic verification of software, due to specificities not present in general programming languages. A common feature of existing works in this area is the attempt to reuse off-the-shelf verification tools designed for general programming languages. This reuse can lead to inefficiency and potentially unsound results, as domain translation is required. In this article, we describe a carefully crafted approach that directly models the central aspects of smart contracts natively, going from the contract to its logical representation without intermediary steps. We use the expressive and highly automatable logic of constrained Horn clauses for modeling and instantiate our approach to the Solidity language. A tool implementing our approach, called Solicitous, was developed and integrated into the SMTChecker module of the Solidity compiler solc. We evaluated our approach on an extensive benchmark set containing 22,446 real-world smart contracts deployed on the Ethereum blockchain over a 27-month period. The results show that our approach is able to establish safety of significantly more contracts than comparable, publicly available verification tools, with an order of magnitude increase in the percentage of formally verified contracts.
智能合约是诱人的攻击目标,因为它们通常持有和操纵重要的金融资产,部署后不可变,并且具有公开可用的源代码,过去由于漏洞估计损失了数百万美元的资产。因此,形式验证是必要的,但由于一般编程语言中不存在的特殊性,智能合约挑战了常规应用于软件符号验证的现有高效技术。该领域现有工作的一个共同特征是尝试重用为通用编程语言设计的现成验证工具。由于需要进行域转换,这种重用可能导致效率低下和潜在的不可靠结果。在本文中,我们描述了一种精心设计的方法,该方法直接对智能合约的核心方面进行本地建模,从合约到其逻辑表示,无需中间步骤。我们使用富有表现力和高度自动化的约束Horn子句逻辑进行建模,并实例化我们对solid语言的方法。我们开发了一个实现我们方法的工具,名为Solicitous,它被集成到Solidity编译器solc的SMTChecker模块中。我们在一个广泛的基准集上评估了我们的方法,该基准集包含了在27个月的时间里部署在以太坊区块链上的22,446个真实世界的智能合约。结果表明,我们的方法能够比可比的、公开可用的验证工具建立更多合同的安全性,并且在正式验证的合同的百分比上增加了一个数量级。
{"title":"A Solicitous Approach to Smart Contract Verification","authors":"Rodrigo Otoni, Matteo Marescotti, Leonardo S. Alt, P. Eugster, A. Hyvärinen, N. Sharygina","doi":"10.1145/3564699","DOIUrl":"https://doi.org/10.1145/3564699","url":null,"abstract":"Smart contracts are tempting targets of attacks, as they often hold and manipulate significant financial assets, are immutable after deployment, and have publicly available source code, with assets estimated in the order of millions of dollars being lost in the past due to vulnerabilities. Formal verification is thus a necessity, but smart contracts challenge the existing highly efficient techniques routinely applied in the symbolic verification of software, due to specificities not present in general programming languages. A common feature of existing works in this area is the attempt to reuse off-the-shelf verification tools designed for general programming languages. This reuse can lead to inefficiency and potentially unsound results, as domain translation is required. In this article, we describe a carefully crafted approach that directly models the central aspects of smart contracts natively, going from the contract to its logical representation without intermediary steps. We use the expressive and highly automatable logic of constrained Horn clauses for modeling and instantiate our approach to the Solidity language. A tool implementing our approach, called Solicitous, was developed and integrated into the SMTChecker module of the Solidity compiler solc. We evaluated our approach on an extensive benchmark set containing 22,446 real-world smart contracts deployed on the Ethereum blockchain over a 27-month period. The results show that our approach is able to establish safety of significantly more contracts than comparable, publicly available verification tools, with an order of magnitude increase in the percentage of formally verified contracts.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":" ","pages":"1 - 28"},"PeriodicalIF":2.3,"publicationDate":"2022-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42255692","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
Time-Aware Anonymization of Knowledge Graphs 知识图谱的时间感知匿名化
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-23 DOI: https://dl.acm.org/doi/10.1145/3563694
Anh-Tu Hoang, Barbara Carminati, Elena Ferrari

Knowledge graphs (KGs) play an essential role in data sharing because they can model both users’ attributes and their relationships. KGs can tailor many data analyses, such as classification where a sensitive attribute is selected and the analyst analyzes the associations between users and the sensitive attribute’s values (aka sensitive values). Data providers anonymize their KGs and share the anonymized versions to protect users’ privacy. Unfortunately, an adversary can exploit these attributes and relationships to infer sensitive information by monitoring either one or many snapshots of a KG. To cope with this issue, in this paper, we introduce (k, l)-Sequential Attribute Degree ((k, l)-sad), an extension of the kw-tad principle[10], to ensure that sensitive values of re-identified users are diverse enough to prevent them from being inferred with a confidence higher than (frac{1}{l} ) even though adversaries monitor all published KGs. In addition, we develop the Time-Aware Knowledge Graph Anonymization Algorithm to anonymize KGs such that all published anonymized versions of a KG satisfy the (k, l)-sad principle, by, at the same time, preserving the utility of the anonymized data. We conduct experiments on four real-life datasets to show the effectiveness of our proposal and compare it with kw-tad.

知识图(Knowledge graphs, KGs)在数据共享中扮演着重要的角色,因为它可以对用户属性及其关系进行建模。kg可以定制许多数据分析,例如选择敏感属性的分类,分析人员分析用户与敏感属性值(又称敏感值)之间的关联。为了保护用户的隐私,数据提供商对其KGs进行匿名化处理,并共享匿名版本。不幸的是,攻击者可以利用这些属性和关系,通过监视KG的一个或多个快照来推断敏感信息。为了解决这个问题,本文引入了(k, l)-顺序属性度((k, l)-sad),这是对kw-tad原理[10]的扩展,以确保重新识别的用户的敏感值足够多样化,即使攻击者监视所有发布的KGs,也不会以高于(frac{1}{l} )的置信度推断出他们。我们开发了时间感知知识图匿名化算法来匿名化KG,使所有已发布的KG的匿名版本满足(k, l)-sad原则,同时保留匿名数据的效用。我们在四个实际数据集上进行了实验,以证明我们的建议的有效性,并将其与know -tad进行了比较。
{"title":"Time-Aware Anonymization of Knowledge Graphs","authors":"Anh-Tu Hoang, Barbara Carminati, Elena Ferrari","doi":"https://dl.acm.org/doi/10.1145/3563694","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3563694","url":null,"abstract":"<p>Knowledge graphs (KGs) play an essential role in data sharing because they can model both users’ attributes and their relationships. KGs can tailor many data analyses, such as classification where a sensitive attribute is selected and the analyst analyzes the associations between users and the sensitive attribute’s values (aka sensitive values). Data providers anonymize their KGs and share the anonymized versions to protect users’ privacy. Unfortunately, an adversary can exploit these attributes and relationships to infer sensitive information by monitoring either one or many snapshots of a KG. To cope with this issue, in this paper, we introduce (<i>k</i>, <i>l</i>)-Sequential Attribute Degree ((<i>k</i>, <i>l</i>)-sad), an extension of the <i>k<sup>w</sup></i>-tad principle[10], to ensure that sensitive values of re-identified users are diverse enough to prevent them from being inferred with a confidence higher than (frac{1}{l} ) even though adversaries monitor all published KGs. In addition, we develop the Time-Aware Knowledge Graph Anonymization Algorithm to anonymize KGs such that all published anonymized versions of a KG satisfy the (<i>k</i>, <i>l</i>)-sad principle, by, at the same time, preserving the utility of the anonymized data. We conduct experiments on four real-life datasets to show the effectiveness of our proposal and compare it with <i>k<sup>w</sup></i>-tad.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"14 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540620","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
Time-Aware Anonymization of Knowledge Graphs 知识图谱的时间感知匿名化
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-23 DOI: 10.1145/3563694
A. Hoang, B. Carminati, E. Ferrari
Knowledge graphs (KGs) play an essential role in data sharing because they can model both users’ attributes and their relationships. KGs can tailor many data analyses, such as classification where a sensitive attribute is selected and the analyst analyzes the associations between users and the sensitive attribute’s values (aka sensitive values). Data providers anonymize their KGs and share the anonymized versions to protect users’ privacy. Unfortunately, an adversary can exploit these attributes and relationships to infer sensitive information by monitoring either one or many snapshots of a KG. To cope with this issue, in this paper, we introduce (k, l)-Sequential Attribute Degree ((k, l)-sad), an extension of the kw-tad principle[10], to ensure that sensitive values of re-identified users are diverse enough to prevent them from being inferred with a confidence higher than (frac{1}{l} ) even though adversaries monitor all published KGs. In addition, we develop the Time-Aware Knowledge Graph Anonymization Algorithm to anonymize KGs such that all published anonymized versions of a KG satisfy the (k, l)-sad principle, by, at the same time, preserving the utility of the anonymized data. We conduct experiments on four real-life datasets to show the effectiveness of our proposal and compare it with kw-tad.
知识图(Knowledge graphs, KGs)在数据共享中扮演着重要的角色,因为它可以对用户属性及其关系进行建模。kg可以定制许多数据分析,例如选择敏感属性的分类,分析人员分析用户与敏感属性值(又称敏感值)之间的关联。为了保护用户的隐私,数据提供商对其KGs进行匿名化处理,并共享匿名版本。不幸的是,攻击者可以利用这些属性和关系,通过监视KG的一个或多个快照来推断敏感信息。为了解决这个问题,在本文中,我们引入了(k, l)-顺序属性度((k, l)-sad),这是对kw-tad原则[10]的扩展,以确保重新识别的用户的敏感值足够多样化,即使攻击者监视所有发布的KGs,也不会以高于(frac{1}{l} )的置信度推断他们。我们开发了时间感知知识图匿名化算法来匿名化KG,使所有已发布的KG的匿名版本满足(k, l)-sad原则,同时保留匿名数据的效用。我们在四个实际数据集上进行了实验,以证明我们的建议的有效性,并将其与know -tad进行了比较。
{"title":"Time-Aware Anonymization of Knowledge Graphs","authors":"A. Hoang, B. Carminati, E. Ferrari","doi":"10.1145/3563694","DOIUrl":"https://doi.org/10.1145/3563694","url":null,"abstract":"Knowledge graphs (KGs) play an essential role in data sharing because they can model both users’ attributes and their relationships. KGs can tailor many data analyses, such as classification where a sensitive attribute is selected and the analyst analyzes the associations between users and the sensitive attribute’s values (aka sensitive values). Data providers anonymize their KGs and share the anonymized versions to protect users’ privacy. Unfortunately, an adversary can exploit these attributes and relationships to infer sensitive information by monitoring either one or many snapshots of a KG. To cope with this issue, in this paper, we introduce (k, l)-Sequential Attribute Degree ((k, l)-sad), an extension of the kw-tad principle[10], to ensure that sensitive values of re-identified users are diverse enough to prevent them from being inferred with a confidence higher than (frac{1}{l} ) even though adversaries monitor all published KGs. In addition, we develop the Time-Aware Knowledge Graph Anonymization Algorithm to anonymize KGs such that all published anonymized versions of a KG satisfy the (k, l)-sad principle, by, at the same time, preserving the utility of the anonymized data. We conduct experiments on four real-life datasets to show the effectiveness of our proposal and compare it with kw-tad.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"1 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47354739","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}
引用次数: 4
Security Best Practices: A Critical Analysis Using IoT as a Case Study 安全最佳实践:使用物联网作为案例研究的关键分析
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-15 DOI: https://dl.acm.org/doi/10.1145/3563392
David Barrera, Christopher Bellman, Paul C. van Oorschot

Academic research has highlighted the failure of many Internet of Things (IoT) product manufacturers to follow accepted practices, while IoT security best practices have recently attracted considerable attention worldwide from industry and governments. Given current examples of security advice, confusion is evident from guidelines that conflate desired outcomes with security practices to achieve those outcomes. We explore a surprising lack of clarity, and void in the literature, on what (generically) best practice means, independent of identifying specific individual practices or highlighting failure to follow best practices. We consider categories of security advice, and analyze how they apply over the lifecycle of IoT devices. For concreteness in discussion, we use iterative inductive coding to code and systematically analyze a set of 1013 IoT security best practices, recommendations, and guidelines collated from industrial, government, and academic sources. Among our findings, of all analyzed items, 68% fail to meet our definition of an (actionable) practice, and 73% of all actionable advice relates to the software development lifecycle phase, highlighting the critical position of manufacturers and developers. We hope that our work provides a basis for the community to better understand best practices, identify and reach consensus on specific practices, and find ways to motivate relevant stakeholders to follow them.

学术研究强调了许多物联网(IoT)产品制造商未能遵循公认的实践,而物联网安全最佳实践最近引起了全球工业界和政府的广泛关注。考虑到当前的安全建议示例,将期望的结果与实现这些结果的安全实践混为一谈的指导方针很容易引起混淆。我们探索了一个令人惊讶的缺乏清晰度和空白的文献,关于什么是(一般的)最佳实践,独立于确定具体的个人实践或强调失败遵循最佳实践。我们考虑了安全建议的类别,并分析了它们如何在物联网设备的生命周期中应用。为了讨论的具体,我们使用迭代归纳编码来编码并系统分析一组1013个物联网安全最佳实践、建议和指南,这些最佳实践、建议和指南来自工业、政府和学术来源。在我们的发现中,在所有分析的项目中,68%的项目不符合我们对(可操作的)实践的定义,73%的可操作建议与软件开发生命周期阶段有关,突出了制造商和开发人员的关键地位。我们希望我们的工作能为社区提供一个基础,以便更好地了解最佳实践,确定具体实践并达成共识,并找到激励相关利益相关者遵循这些实践的方法。
{"title":"Security Best Practices: A Critical Analysis Using IoT as a Case Study","authors":"David Barrera, Christopher Bellman, Paul C. van Oorschot","doi":"https://dl.acm.org/doi/10.1145/3563392","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3563392","url":null,"abstract":"<p>Academic research has highlighted the failure of many Internet of Things (IoT) product manufacturers to follow accepted practices, while IoT security <i>best practices</i> have recently attracted considerable attention worldwide from industry and governments. Given current examples of security advice, confusion is evident from guidelines that conflate desired outcomes with security practices to achieve those outcomes. We explore a surprising lack of clarity, and void in the literature, on what (generically) <i>best practice</i> means, independent of identifying specific individual practices or highlighting failure to follow best practices. We consider categories of security advice, and analyze how they apply over the lifecycle of IoT devices. For concreteness in discussion, we use iterative inductive coding to code and systematically analyze a set of 1013 IoT security best practices, recommendations, and guidelines collated from industrial, government, and academic sources. Among our findings, of all analyzed items, 68% fail to meet our definition of an (actionable) practice, and 73% of all actionable advice relates to the software development lifecycle phase, highlighting the critical position of manufacturers and developers. We hope that our work provides a basis for the community to better understand best practices, identify and reach consensus on specific practices, and find ways to motivate relevant stakeholders to follow them.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"21 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540615","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
ThermoSecure: Investigating the Effectiveness of AI-Driven Thermal Attacks on Commonly Used Computer Keyboards ThermoSecure:研究人工智能驱动的热攻击对常用计算机键盘的有效性
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-15 DOI: 10.1145/3563693
N. Alotaibi, John Williamson, M. Khamis
Thermal cameras can reveal heat traces on user interfaces, such as keyboards. This can be exploited maliciously to infer sensitive input, such as passwords. While previous work considered thermal attacks that rely on visual inspection of simple image processing techniques, we show that attackers can perform more effective artificial intelligence (AI)–driven attacks. We demonstrate this by presenting the development of ThermoSecure and its evaluation in two user studies (N = 21, N = 16), which reveal novel insights about thermal attacks. We detail the implementation of ThermoSecure and make a dataset of 1,500 thermal images of keyboards with heat traces resulting from input publicly available. Our first study shows that ThermoSecure successfully attacks 6-symbol, 8-symbol, 12-symbol, and 16-symbol passwords with an average accuracy of 92%, 80%, 71%, and 55% respectively, and even higher accuracy when thermal images are taken within 30 seconds. We found that typing behavior significantly impacts vulnerability to thermal attacks: hunt-and-peck typists are more vulnerable than fast typists (92% vs. 83% thermal attack success. respectively, if performed within 30 seconds). The second study showed that keycap material has a statistically significant effect on the effectiveness of thermal attacks: ABS keycaps retain the thermal trace of user presses for a longer period of time, making them more vulnerable to thermal attacks, with a 52% average attack accuracy compared with 14% for keyboards with PBT keycaps. Finally, we discuss how systems can leverage our results to protect from thermal attacks and present 7 mitigation approaches that are based on our results and previous work.
热像仪可以显示用户界面上的热迹,比如键盘。这可以被恶意利用来推断敏感输入,比如密码。虽然以前的工作考虑了依赖于简单图像处理技术的视觉检测的热攻击,但我们表明攻击者可以执行更有效的人工智能(AI)驱动的攻击。我们通过介绍ThermoSecure的发展及其在两个用户研究(N = 21, N = 16)中的评估来证明这一点,这揭示了关于热攻击的新见解。我们详细介绍了ThermoSecure的实现,并制作了一个由1500个键盘热图像组成的数据集,这些图像带有输入产生的热迹。我们的第一项研究表明,ThermoSecure成功攻击了6个符号、8个符号、12个符号和16个符号的密码,平均准确率分别为92%、80%、71%和55%,在30秒内拍摄热图像时准确率更高。我们发现,打字行为对热攻击的脆弱性有显著影响:快速打字者比快速打字者更容易受到攻击(热攻击成功率为92%对83%)。分别(如果在30秒内执行)。第二项研究表明,键帽材料对热攻击的有效性有统计学上显著的影响:ABS键帽在更长的时间内保留了用户按下的热痕迹,使它们更容易受到热攻击,平均攻击精度为52%,而PBT键帽键盘的平均攻击精度为14%。最后,我们讨论了系统如何利用我们的结果来保护免受热攻击,并根据我们的结果和以前的工作提出了7种缓解方法。
{"title":"ThermoSecure: Investigating the Effectiveness of AI-Driven Thermal Attacks on Commonly Used Computer Keyboards","authors":"N. Alotaibi, John Williamson, M. Khamis","doi":"10.1145/3563693","DOIUrl":"https://doi.org/10.1145/3563693","url":null,"abstract":"Thermal cameras can reveal heat traces on user interfaces, such as keyboards. This can be exploited maliciously to infer sensitive input, such as passwords. While previous work considered thermal attacks that rely on visual inspection of simple image processing techniques, we show that attackers can perform more effective artificial intelligence (AI)–driven attacks. We demonstrate this by presenting the development of ThermoSecure and its evaluation in two user studies (N = 21, N = 16), which reveal novel insights about thermal attacks. We detail the implementation of ThermoSecure and make a dataset of 1,500 thermal images of keyboards with heat traces resulting from input publicly available. Our first study shows that ThermoSecure successfully attacks 6-symbol, 8-symbol, 12-symbol, and 16-symbol passwords with an average accuracy of 92%, 80%, 71%, and 55% respectively, and even higher accuracy when thermal images are taken within 30 seconds. We found that typing behavior significantly impacts vulnerability to thermal attacks: hunt-and-peck typists are more vulnerable than fast typists (92% vs. 83% thermal attack success. respectively, if performed within 30 seconds). The second study showed that keycap material has a statistically significant effect on the effectiveness of thermal attacks: ABS keycaps retain the thermal trace of user presses for a longer period of time, making them more vulnerable to thermal attacks, with a 52% average attack accuracy compared with 14% for keyboards with PBT keycaps. Finally, we discuss how systems can leverage our results to protect from thermal attacks and present 7 mitigation approaches that are based on our results and previous work.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"149 ","pages":"1 - 24"},"PeriodicalIF":2.3,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41310189","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}
引用次数: 5
Assessment Framework for the Identification and Evaluation of Main Features for Distributed Usage Control Solutions 用于识别和评估分布式使用控制解决方案的主要特征的评估框架
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-09 DOI: 10.1145/3561511
Gonzalo Gil, A. Arnaiz, M. Higuero, F. J. Díez
Data exchange between organizations is becoming an increasingly significant issue due to the great opportunities it presents. However, there is great reluctance to share if data sovereignty is not provided. Providing it calls for not only access control but also usage control implemented in distributed systems. Access control is a research field where there has been a great deal of work, but usage control, especially implemented in distributed systems as Distributed Usage Control (DUC), is a very new field of research that presents great challenges. Moreover, little is known about what challenges must really be faced and how they must be addressed. This is evidenced by the fact that existing research has focused non-specifically on different features of DUC, which are not formalized. Therefore, the path for the development of DUC solutions is unclear and it is difficult to analyze the scope of data sovereignty attained by the wide range of DUC solutions. In this context, this article is based on an initial in-depth analysis of DUC related work. In it, the challenges posed by DUC in terms of data sovereignty and the features that must be provided to address them are identified and analyzed for the first time. Based on these features, an initial DUC framework is proposed to assess in a practical and unified way the extent to which DUC solutions provide data sovereignty. Finally, the assessment framework is applied to compare the scopes of the most widespread DUC solutions and identify their limitations.
由于数据交换带来的巨大机遇,组织之间的数据交换正成为一个日益重要的问题。然而,如果不提供数据主权,人们极不愿意分享。提供它不仅需要访问控制,还需要在分布式系统中实现使用控制。访问控制是一个有大量工作的研究领域,但使用控制,特别是在分布式系统中实现的分布式使用控制(DUC),是一个非常新的研究领域。此外,人们对真正必须面对的挑战以及如何应对这些挑战知之甚少。这一点可以从以下事实中得到证明:现有的研究非专门关注DUC的不同特征,这些特征尚未正式化。因此,DUC解决方案的发展路径尚不明确,也很难分析广泛的DUC解决方法所获得的数据主权范围。在这种背景下,本文是基于对DUC相关工作的初步深入分析。在报告中,首次确定并分析了DUC在数据主权方面提出的挑战以及必须提供的功能。基于这些特征,提出了一个初步的DUC框架,以实用和统一的方式评估DUC解决方案提供数据主权的程度。最后,应用评估框架来比较最广泛的DUC解决方案的范围,并确定其局限性。
{"title":"Assessment Framework for the Identification and Evaluation of Main Features for Distributed Usage Control Solutions","authors":"Gonzalo Gil, A. Arnaiz, M. Higuero, F. J. Díez","doi":"10.1145/3561511","DOIUrl":"https://doi.org/10.1145/3561511","url":null,"abstract":"Data exchange between organizations is becoming an increasingly significant issue due to the great opportunities it presents. However, there is great reluctance to share if data sovereignty is not provided. Providing it calls for not only access control but also usage control implemented in distributed systems. Access control is a research field where there has been a great deal of work, but usage control, especially implemented in distributed systems as Distributed Usage Control (DUC), is a very new field of research that presents great challenges. Moreover, little is known about what challenges must really be faced and how they must be addressed. This is evidenced by the fact that existing research has focused non-specifically on different features of DUC, which are not formalized. Therefore, the path for the development of DUC solutions is unclear and it is difficult to analyze the scope of data sovereignty attained by the wide range of DUC solutions. In this context, this article is based on an initial in-depth analysis of DUC related work. In it, the challenges posed by DUC in terms of data sovereignty and the features that must be provided to address them are identified and analyzed for the first time. Based on these features, an initial DUC framework is proposed to assess in a practical and unified way the extent to which DUC solutions provide data sovereignty. Finally, the assessment framework is applied to compare the scopes of the most widespread DUC solutions and identify their limitations.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"26 1","pages":"1 - 28"},"PeriodicalIF":2.3,"publicationDate":"2022-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41584871","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
Security Best Practices: A Critical Analysis Using IoT as a Case Study 安全最佳实践:使用物联网作为案例研究的关键分析
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-02 DOI: 10.1145/3563392
David Barrera, Christopher Bellman, P. V. van Oorschot
Academic research has highlighted the failure of many Internet of Things (IoT) product manufacturers to follow accepted practices, while IoT security best practices have recently attracted considerable attention worldwide from industry and governments. Given current examples of security advice, confusion is evident from guidelines that conflate desired outcomes with security practices to achieve those outcomes. We explore a surprising lack of clarity, and void in the literature, on what (generically) best practice means, independent of identifying specific individual practices or highlighting failure to follow best practices. We consider categories of security advice, and analyze how they apply over the lifecycle of IoT devices. For concreteness in discussion, we use iterative inductive coding to code and systematically analyze a set of 1,013 IoT security best practices, recommendations, and guidelines collated from industrial, government, and academic sources. Among our findings, of all analyzed items, 68% fail to meet our definition of an (actionable) practice, and 73% of all actionable advice relates to the software development lifecycle phase, highlighting the critical position of manufacturers and developers. We hope that our work provides a basis for the community to better understand best practices, identify and reach consensus on specific practices, and find ways to motivate relevant stakeholders to follow them.
学术研究强调了许多物联网(IoT)产品制造商未能遵循公认的实践,而物联网安全最佳实践最近引起了全球工业界和政府的广泛关注。考虑到当前的安全建议示例,将期望的结果与实现这些结果的安全实践混为一谈的指导方针很容易引起混淆。我们探索了一个令人惊讶的缺乏清晰度和空白的文献,关于什么是(一般的)最佳实践,独立于确定具体的个人实践或强调失败遵循最佳实践。我们考虑了安全建议的类别,并分析了它们如何在物联网设备的生命周期中应用。为了讨论的具体,我们使用迭代归纳编码来编码并系统分析一组1,013个物联网安全最佳实践、建议和指南,这些最佳实践、建议和指南来自工业、政府和学术来源。在我们的发现中,在所有分析的项目中,68%的项目不符合我们对(可操作的)实践的定义,73%的可操作建议与软件开发生命周期阶段有关,突出了制造商和开发人员的关键地位。我们希望我们的工作能为社区提供一个基础,以便更好地了解最佳实践,确定具体实践并达成共识,并找到激励相关利益相关者遵循这些实践的方法。
{"title":"Security Best Practices: A Critical Analysis Using IoT as a Case Study","authors":"David Barrera, Christopher Bellman, P. V. van Oorschot","doi":"10.1145/3563392","DOIUrl":"https://doi.org/10.1145/3563392","url":null,"abstract":"Academic research has highlighted the failure of many Internet of Things (IoT) product manufacturers to follow accepted practices, while IoT security best practices have recently attracted considerable attention worldwide from industry and governments. Given current examples of security advice, confusion is evident from guidelines that conflate desired outcomes with security practices to achieve those outcomes. We explore a surprising lack of clarity, and void in the literature, on what (generically) best practice means, independent of identifying specific individual practices or highlighting failure to follow best practices. We consider categories of security advice, and analyze how they apply over the lifecycle of IoT devices. For concreteness in discussion, we use iterative inductive coding to code and systematically analyze a set of 1,013 IoT security best practices, recommendations, and guidelines collated from industrial, government, and academic sources. Among our findings, of all analyzed items, 68% fail to meet our definition of an (actionable) practice, and 73% of all actionable advice relates to the software development lifecycle phase, highlighting the critical position of manufacturers and developers. We hope that our work provides a basis for the community to better understand best practices, identify and reach consensus on specific practices, and find ways to motivate relevant stakeholders to follow them.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"26 1","pages":"1 - 30"},"PeriodicalIF":2.3,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41578596","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}
引用次数: 5
Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure Binsec/Rel:用于安全的符号二进制分析器,用于恒定时间和秘密擦除
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-09-02 DOI: 10.1145/3563037
Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk
This article tackles the problem of designing efficient binary-level verification for a subset of information flow properties encompassing constant-time and secret-erasure. These properties are crucial for cryptographic implementations but are generally not preserved by compilers. Our proposal builds on relational symbolic execution enhanced with new optimizations dedicated to information flow and binary-level analysis, yielding a dramatic improvement over prior work based on symbolic execution. We implement a prototype, Binsec/Rel, for bug-finding and bounded-verification of constant-time and secret-erasure and perform extensive experiments on a set of 338 cryptographic implementations, demonstrating the benefits of our approach. Using Binsec/Rel, we also automate two prior manual studies on preservation of constant-time and secret-erasure by compilers for a total of 4,148 and 1,156 binaries, respectively. Interestingly, our analysis highlights incorrect usages of volatile data pointer for secret-erasure and shows that scrubbing mechanisms based on volatile function pointers can introduce additional register spilling that might break secret-erasure. We also discovered that gcc -O0 and backend passes of clang introduce violations of constant-time in implementations that were previously deemed secure by a state-of-the-art constant-time verification tool operating at LLVM level, showing the importance of reasoning at binary level.
本文解决了为包含恒定时间和秘密擦除的信息流属性子集设计有效的二进制级验证的问题。这些属性对于加密实现至关重要,但编译器通常不会保留这些属性。我们的建议建立在关系符号执行的基础上,增强了专门针对信息流和二进制级分析的新优化,比先前基于符号执行的工作产生了巨大的改进。我们实现了一个原型Binsec/Rel,用于bug查找和恒定时间和秘密擦除的有界验证,并在一组338个加密实现上进行了广泛的实验,证明了我们方法的优点。使用Binsec/Rel,我们还自动执行了两个先前的手动研究,分别针对总共4,148个和1,156个二进制文件进行了恒定时间保存和秘密擦除。有趣的是,我们的分析强调了volatile数据指针用于秘密擦除的错误用法,并表明基于volatile函数指针的擦除机制可能会引入额外的寄存器溢出,从而破坏秘密擦除。我们还发现,gcc - 0和clang的后端传递在实现中引入了对恒定时间的违反,而这些实现以前被在LLVM级别运行的最先进的恒定时间验证工具认为是安全的,这显示了在二进制级别进行推理的重要性。
{"title":"Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure","authors":"Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk","doi":"10.1145/3563037","DOIUrl":"https://doi.org/10.1145/3563037","url":null,"abstract":"This article tackles the problem of designing efficient binary-level verification for a subset of information flow properties encompassing constant-time and secret-erasure. These properties are crucial for cryptographic implementations but are generally not preserved by compilers. Our proposal builds on relational symbolic execution enhanced with new optimizations dedicated to information flow and binary-level analysis, yielding a dramatic improvement over prior work based on symbolic execution. We implement a prototype, Binsec/Rel, for bug-finding and bounded-verification of constant-time and secret-erasure and perform extensive experiments on a set of 338 cryptographic implementations, demonstrating the benefits of our approach. Using Binsec/Rel, we also automate two prior manual studies on preservation of constant-time and secret-erasure by compilers for a total of 4,148 and 1,156 binaries, respectively. Interestingly, our analysis highlights incorrect usages of volatile data pointer for secret-erasure and shows that scrubbing mechanisms based on volatile function pointers can introduce additional register spilling that might break secret-erasure. We also discovered that gcc -O0 and backend passes of clang introduce violations of constant-time in implementations that were previously deemed secure by a state-of-the-art constant-time verification tool operating at LLVM level, showing the importance of reasoning at binary level.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":"26 1","pages":"1 - 42"},"PeriodicalIF":2.3,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42035739","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}
引用次数: 5
期刊
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