首页 > 最新文献

ACM Transactions on Privacy and Security最新文献

英文 中文
Flexichain: Flexible Payment Channel Network to Defend Against Channel Exhaustion Attack Flexichain:防御渠道枯竭攻击的灵活支付渠道网络
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-08 DOI: 10.1145/3687476
Susil Kumar Mohanty, Somanath Tripathy
Payment Channel Network (PCN) is an effective off-chain scaling solution widely recognized for reducing operational costs on permissionless blockchains. However, it still faces challenges such as lack of flexibility, channel exhaustion, and poor sustainability. Currently, a separate deposit is required for each payment channel, which locks a significant amount of coins for a longer period. This restricts the ability to move locked coins across their channels off-chain. Additionally, unbalanced (unidirectional) transfers can lead to channel exhaustion, rendering the channel unsustainable. To address these issues, we propose a novel off-chain protocol called Flexible Payment Channel Networks (Flexichain). Unlike existing approaches, Flexichain allows users to deposit coins per user rather than per channel. This provides flexibility to move coins freely between channels without relying on the blockchain or disrupting the off-chain cycle. Flexichain is proven to be secure under the Universal Composability framework and resistant against channel exhaustion attacks. To assess the performance of Flexichain, we conduct experiments on both on-chain and off-chain operations using snapshots of the Lightning Network (LN). We evaluated the on-chain gas costs, success ratio and success amount of off-chain payments under uniform and skewed payment demands, as well as the computational and communication overheads of the off-chain contracts.
支付通道网络(PCN)是一种有效的链外扩展解决方案,在降低无权限区块链的运营成本方面得到广泛认可。然而,它仍然面临着缺乏灵活性、渠道枯竭和可持续性差等挑战。目前,每个支付渠道都需要单独的存款,这就在较长时间内锁定了大量的硬币。这就限制了被锁定的币在链外渠道之间移动的能力。此外,不平衡(单向)转移会导致通道耗尽,使通道无法持续。为了解决这些问题,我们提出了一种名为灵活支付通道网络(Flexichain)的新型链外协议。与现有方法不同,Flexichain 允许用户为每个用户而不是每个通道存入硬币。这就提供了在渠道之间自由转移硬币的灵活性,而无需依赖区块链或破坏链外循环。事实证明,Flexichain 在通用可组合性框架下是安全的,可以抵御通道耗尽攻击。为了评估 Flexichain 的性能,我们使用闪电网络(LN)的快照对链上和链下操作进行了实验。我们评估了统一和倾斜支付需求下的链上气体成本、成功率和链下支付成功率,以及链下合约的计算和通信开销。
{"title":"Flexichain: Flexible Payment Channel Network to Defend Against Channel Exhaustion Attack","authors":"Susil Kumar Mohanty, Somanath Tripathy","doi":"10.1145/3687476","DOIUrl":"https://doi.org/10.1145/3687476","url":null,"abstract":"Payment Channel Network (PCN) is an effective off-chain scaling solution widely recognized for reducing operational costs on permissionless blockchains. However, it still faces challenges such as lack of flexibility, channel exhaustion, and poor sustainability. Currently, a separate deposit is required for each payment channel, which locks a significant amount of coins for a longer period. This restricts the ability to move locked coins across their channels off-chain. Additionally, unbalanced (unidirectional) transfers can lead to channel exhaustion, rendering the channel unsustainable. To address these issues, we propose a novel off-chain protocol called Flexible Payment Channel Networks (Flexichain). Unlike existing approaches, Flexichain allows users to deposit coins per user rather than per channel. This provides flexibility to move coins freely between channels without relying on the blockchain or disrupting the off-chain cycle. Flexichain is proven to be secure under the Universal Composability framework and resistant against channel exhaustion attacks. To assess the performance of Flexichain, we conduct experiments on both on-chain and off-chain operations using snapshots of the Lightning Network (LN). We evaluated the on-chain gas costs, success ratio and success amount of off-chain payments under uniform and skewed payment demands, as well as the computational and communication overheads of the off-chain contracts.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141926397","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
SPArch: A Hardware-oriented Sketch-based Architecture for High-speed Network Flow Measurements SPArch:面向硬件的基于草图的高速网络流量测量架构
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-08 DOI: 10.1145/3687477
Arish Sateesan, J. Vliegen, Simon Scherrer, H. Hsiao, A. Perrig, N. Mentens
Network flow measurement is an integral part of modern high-speed applications for network security and data-stream processing. However, processing at line rate while maintaining the required data structure within the on-chip memory of the hardware platform is a challenging task for measurement algorithms, especially when accuracy is of primary importance, such as in network security applications. Most of the existing measurement algorithms are no exception to such issues when deployed in high-speed networking environments and are also not tailored for efficient hardware implementation. Sketch-based measurement algorithms minimize the memory requirement and are suitable for high-speed networks but possess a low memory-accuracy trade-off and lack the versatility of individual flow mapping. To address these challenges, we present a hardware-friendly data structure named Sketch-based Pseudo-associative array Architecture (SPArch). SPArch is highly accurate and extremely memory-efficient, making it suitable for network flow measurement and security applications. The parallelism in SPArch ensures minimal and constant memory access cycles. Unlike other sketch architectures, SPArch provides the functionality of individual flow mapping similar to associative arrays, and the optimized version of SPArch allows the organization of counters in multiple buckets based on the flow sizes. An in-depth analysis of SPArch is carried out in this paper and implemented SPArch on the Alveo data center accelerator card, demonstrating its suitability for high-speed networks.
网络流量测量是现代网络安全和数据流处理高速应用不可或缺的一部分。然而,在硬件平台的片上内存中保持所需的数据结构,同时以线速进行处理,这对测量算法来说是一项具有挑战性的任务,尤其是在网络安全应用等对精度要求极高的情况下。现有的大多数测量算法在部署到高速网络环境中时也不例外,而且也不是为高效的硬件实施而量身定制的。基于草图的测量算法能最大限度地减少内存需求,适用于高速网络,但内存-精度权衡较低,且缺乏单个流量映射的多功能性。为了应对这些挑战,我们提出了一种硬件友好型数据结构,命名为基于草图的伪关联阵列架构(SPArch)。SPArch 具有高精度和极高的内存效率,因此适用于网络流量测量和安全应用。SPArch 的并行性可确保内存访问周期最小且保持不变。与其他草图架构不同,SPArch 提供了与关联数组类似的单个流量映射功能,而且 SPArch 的优化版本允许根据流量大小将计数器组织到多个桶中。本文对 SPArch 进行了深入分析,并在 Alveo 数据中心加速卡上实现了 SPArch,证明其适用于高速网络。
{"title":"SPArch: A Hardware-oriented Sketch-based Architecture for High-speed Network Flow Measurements","authors":"Arish Sateesan, J. Vliegen, Simon Scherrer, H. Hsiao, A. Perrig, N. Mentens","doi":"10.1145/3687477","DOIUrl":"https://doi.org/10.1145/3687477","url":null,"abstract":"Network flow measurement is an integral part of modern high-speed applications for network security and data-stream processing. However, processing at line rate while maintaining the required data structure within the on-chip memory of the hardware platform is a challenging task for measurement algorithms, especially when accuracy is of primary importance, such as in network security applications. Most of the existing measurement algorithms are no exception to such issues when deployed in high-speed networking environments and are also not tailored for efficient hardware implementation. Sketch-based measurement algorithms minimize the memory requirement and are suitable for high-speed networks but possess a low memory-accuracy trade-off and lack the versatility of individual flow mapping. To address these challenges, we present a hardware-friendly data structure named Sketch-based Pseudo-associative array Architecture (SPArch). SPArch is highly accurate and extremely memory-efficient, making it suitable for network flow measurement and security applications. The parallelism in SPArch ensures minimal and constant memory access cycles. Unlike other sketch architectures, SPArch provides the functionality of individual flow mapping similar to associative arrays, and the optimized version of SPArch allows the organization of counters in multiple buckets based on the flow sizes. An in-depth analysis of SPArch is carried out in this paper and implemented SPArch on the Alveo data center accelerator card, demonstrating its suitability for high-speed networks.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141927229","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
VeriBin: A Malware Authorship Verification Approach for APT Tracking through Explainable and Functionality-Debiasing Adversarial Representation Learning VeriBin:通过可解释和功能性去伪存真的对抗性表征学习来追踪 APT 的恶意软件作者身份验证方法
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-20 DOI: 10.1145/3669901
Weihan Ou, Steven H. H. Ding, Mohammad Zulkernine, Li Tao Li, Sarah Labrosse
Malware attacks are posing a significant threat to national security, cooperate network and public endpoint security. Identifying the Advanced Persistent Threat (APT) groups behind the attacks and grouping their activities into attack campaigns help security investigators trace their activities thus providing better security protections against future attacks. Existing Cyber Threat Intelligent (CTI) components mainly focus on malware family identification and behaviour characterization, which cannot solve the APT tracking problem: while APT tracking needs one to link malware binaries of multiple families to a single threat actor, these behavior or function-based techniques are tightened up to a specific attack technique and would fail on connecting different families. Binary Authorship Attribution (AA) solutions could discriminate against threat actors based on their stylometric traits. However, AA solutions assume that the author of a binary is within a fixed candidate author set. However, real-world malware binaries may be created by a new unknown threat actor. To address this research gap, we propose VeriBin for the Binary Authorship Verification (BAV) problem. VeriBin is a novel adversarial neural network that extracts functionality-agnostic style representations from assembly code for the AV task. The extracted style representations can be visualized and are explainable with VeriBin’s multi-head attention mechanism. We benchmark VeriBin with state-of-the-art coding style representations on a standard dataset and a recent malware-APT dataset. Given two anonymous binaries of out-of-sample authors, VeriBin can accurately determine whether they belong to the same author or not. VeriBin is resilient to compiler optimizations and robust against malware family variants.
恶意软件攻击正在对国家安全、合作网络和公共端点安全构成重大威胁。识别攻击背后的高级持续性威胁(APT)组织,并将其活动归类为攻击活动,有助于安全调查人员追踪其活动,从而为未来的攻击提供更好的安全保护。现有的网络威胁智能(CTI)组件主要侧重于恶意软件家族识别和行为特征描述,无法解决 APT 跟踪问题:虽然 APT 跟踪需要将多个家族的恶意软件二进制文件与单个威胁行为者联系起来,但这些基于行为或功能的技术仅限于特定的攻击技术,无法将不同的家族联系起来。二进制作者归属(AA)解决方案可根据威胁行为者的风格特征对其进行区分。不过,二进制作者归属解决方案假定二进制的作者是固定的候选作者集。然而,现实世界中的恶意软件二进制文件可能是由新的未知威胁行为者创建的。为了解决这一研究空白,我们针对二进制作者身份验证(BAV)问题提出了 VeriBin。VeriBin 是一种新型对抗神经网络,可从汇编代码中提取与功能无关的样式表示,用于反病毒任务。通过 VeriBin 的多头注意力机制,提取的风格表征可视化并可解释。我们在一个标准数据集和一个最新的恶意软件-APT 数据集上用最先进的编码风格表示法对 VeriBin 进行了基准测试。对于样本外作者的两个匿名二进制文件,VeriBin 可以准确判断它们是否属于同一作者。VeriBin 对编译器优化有很好的适应性,对恶意软件家族的变种也很强大。
{"title":"VeriBin: A Malware Authorship Verification Approach for APT Tracking through Explainable and Functionality-Debiasing Adversarial Representation Learning","authors":"Weihan Ou, Steven H. H. Ding, Mohammad Zulkernine, Li Tao Li, Sarah Labrosse","doi":"10.1145/3669901","DOIUrl":"https://doi.org/10.1145/3669901","url":null,"abstract":"Malware attacks are posing a significant threat to national security, cooperate network and public endpoint security. Identifying the Advanced Persistent Threat (APT) groups behind the attacks and grouping their activities into attack campaigns help security investigators trace their activities thus providing better security protections against future attacks. Existing Cyber Threat Intelligent (CTI) components mainly focus on malware family identification and behaviour characterization, which cannot solve the APT tracking problem: while APT tracking needs one to link malware binaries of multiple families to a single threat actor, these behavior or function-based techniques are tightened up to a specific attack technique and would fail on connecting different families. Binary Authorship Attribution (AA) solutions could discriminate against threat actors based on their stylometric traits. However, AA solutions assume that the author of a binary is within a fixed candidate author set. However, real-world malware binaries may be created by a new unknown threat actor.\u0000 To address this research gap, we propose VeriBin for the Binary Authorship Verification (BAV) problem. VeriBin is a novel adversarial neural network that extracts functionality-agnostic style representations from assembly code for the AV task. The extracted style representations can be visualized and are explainable with VeriBin’s multi-head attention mechanism. We benchmark VeriBin with state-of-the-art coding style representations on a standard dataset and a recent malware-APT dataset. Given two anonymous binaries of out-of-sample authors, VeriBin can accurately determine whether they belong to the same author or not. VeriBin is resilient to compiler optimizations and robust against malware family variants.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141820212","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
CBAs: Character-level Backdoor Attacks against Chinese Pre-trained Language Models CBAs:针对中文预训练语言模型的字符级后门攻击
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-12 DOI: 10.1145/3678007
Xinyu He, Fengrui Hao, Tianlong Gu, Liang Chang
The pre-trained language models (PLMs) aim to assist computers in various domains to provide natural and efficient language interaction and text processing capabilities. However, recent studies have shown that PLMs are highly vulnerable to malicious backdoor attacks, where triggers could be injected into the models to guide them to exhibit the expected behavior of the attackers. Unfortunately, existing researches on backdoor attacks have mainly focused on English PLMs, but paid less attention to the Chinese PLMs. Moreover, these extant backdoor attacks don’t work well against Chinese PLMs. In this paper, we disclose the limitations of English backdoor attacks against Chinese PLMs, and propose the character-level backdoor attacks (CBAs) against the Chinese PLMs. Specifically, we first design three Chinese trigger generation strategies to ensure the backdoor being effectively triggered while improving the effectiveness of the backdoor attacks. Then, based on the attacker’s capabilities of accessing the training dataset, we develop trigger injection mechanisms with either the target label similarity or the masked language model, which select the most influential position and insert the trigger to maximize the stealth of backdoor attacks. Extensive experiments on three major natural language processing tasks in various Chinese PLMs and English PLMs demonstrate the effectiveness and stealthiness of our method. Besides, CBAs also have very strong resistance against three state-of-the-art backdoor defense methods.
预训练语言模型(PLMs)旨在协助各领域的计算机提供自然、高效的语言交互和文本处理能力。然而,最近的研究表明,PLMs 非常容易受到恶意后门攻击的影响,恶意后门攻击可将触发器注入模型,引导模型表现出攻击者预期的行为。遗憾的是,现有的后门攻击研究主要集中在英文版 PLM 上,对中文版 PLM 关注较少。此外,这些现有的后门攻击对中文 PLM 也不起作用。本文揭示了针对中文 PLM 的英文后门攻击的局限性,并提出了针对中文 PLM 的字符级后门攻击(CBA)。具体来说,我们首先设计了三种中文触发生成策略,以确保后门被有效触发,同时提高后门攻击的有效性。然后,根据攻击者获取训练数据集的能力,我们开发了目标标签相似度或屏蔽语言模型的触发器注入机制,选择最有影响力的位置插入触发器,最大限度地提高后门攻击的隐蔽性。在各种中文 PLM 和英文 PLM 中进行的三大自然语言处理任务的广泛实验证明了我们的方法的有效性和隐蔽性。此外,CBA 对三种最先进的后门防御方法也有很强的抵御能力。
{"title":"CBAs: Character-level Backdoor Attacks against Chinese Pre-trained Language Models","authors":"Xinyu He, Fengrui Hao, Tianlong Gu, Liang Chang","doi":"10.1145/3678007","DOIUrl":"https://doi.org/10.1145/3678007","url":null,"abstract":"The pre-trained language models (PLMs) aim to assist computers in various domains to provide natural and efficient language interaction and text processing capabilities. However, recent studies have shown that PLMs are highly vulnerable to malicious backdoor attacks, where triggers could be injected into the models to guide them to exhibit the expected behavior of the attackers. Unfortunately, existing researches on backdoor attacks have mainly focused on English PLMs, but paid less attention to the Chinese PLMs. Moreover, these extant backdoor attacks don’t work well against Chinese PLMs. In this paper, we disclose the limitations of English backdoor attacks against Chinese PLMs, and propose the character-level backdoor attacks (CBAs) against the Chinese PLMs. Specifically, we first design three Chinese trigger generation strategies to ensure the backdoor being effectively triggered while improving the effectiveness of the backdoor attacks. Then, based on the attacker’s capabilities of accessing the training dataset, we develop trigger injection mechanisms with either the target label similarity or the masked language model, which select the most influential position and insert the trigger to maximize the stealth of backdoor attacks. Extensive experiments on three major natural language processing tasks in various Chinese PLMs and English PLMs demonstrate the effectiveness and stealthiness of our method. Besides, CBAs also have very strong resistance against three state-of-the-art backdoor defense methods.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141654574","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
PEBASI: A Privacy preserving, Efficient Biometric Authentication Scheme based on Irises PEBASI:基于虹膜的隐私保护、高效生物识别身份验证方案
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-11 DOI: 10.1145/3677017
Hasini Gunasinghe, Mikhail Atallah, Elisa Bertino
We introduce a novel privacy preserving biometric authentication scheme based on irises that allows a user to enroll once at a trusted biometric certification authority (BCA) and authenticate to online service providers (SPs) multiple times without involving the BCA during the authentication. Our scheme preserves the user’s biometric privacy from the SPs and transactional privacy from the BCA, while providing security against a malicious user. During the enrollment, the BCA issues a signed token which encrypts the user’s biometrics. We introduce techniques enabling the SP and the user to perform secure computation of biometric matching between such encrypted biometrics and the user’s biometrics captured at the authentication time. We provide a prototype implementation, a performance evaluation and a security analysis of the protocol.
我们介绍了一种基于虹膜的新型隐私保护生物识别身份验证方案,该方案允许用户在可信的生物识别认证机构(BCA)注册一次,并向在线服务提供商(SP)进行多次身份验证,而在身份验证过程中不涉及 BCA。我们的方案保护了用户的生物特征隐私,使其不受 SP 的影响,也保护了交易隐私,使其不受 BCA 的影响,同时还提供了针对恶意用户的安全保护。在注册过程中,BCA 会发出一个签名令牌,对用户的生物特征进行加密。我们引入了一些技术,使 SP 和用户能够在这些加密的生物特征与认证时捕获的用户生物特征之间进行安全的生物特征匹配计算。我们提供了协议的原型实现、性能评估和安全分析。
{"title":"PEBASI: A Privacy preserving, Efficient Biometric Authentication Scheme based on Irises","authors":"Hasini Gunasinghe, Mikhail Atallah, Elisa Bertino","doi":"10.1145/3677017","DOIUrl":"https://doi.org/10.1145/3677017","url":null,"abstract":"We introduce a novel privacy preserving biometric authentication scheme based on irises that allows a user to enroll once at a trusted biometric certification authority (BCA) and authenticate to online service providers (SPs) multiple times without involving the BCA during the authentication. Our scheme preserves the user’s biometric privacy from the SPs and transactional privacy from the BCA, while providing security against a malicious user. During the enrollment, the BCA issues a signed token which encrypts the user’s biometrics. We introduce techniques enabling the SP and the user to perform secure computation of biometric matching between such encrypted biometrics and the user’s biometrics captured at the authentication time. We provide a prototype implementation, a performance evaluation and a security analysis of the protocol.","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141657381","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
ZPredict: ML-Based IPID Side-channel Measurements ZPredict:基于 ML 的 IPID 侧信道测量
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-06-20 DOI: 10.1145/3672560
Haya Schulmann, Shujie Zhao

Network reconnaissance and measurements play a central role in improving Internet security and are important for understanding the current deployments and trends. Such measurements often require coordination with the measured target. This limits the scalability and the coverage of the existing proposals. IP Identification (IPID) provides a side channel for remote measurements without requiring the targets to install agents or visit the measurement infrastructure. However, current IPID-based techniques have technical limitations due to their reliance on the idealistic assumption of stable IPID changes or prior knowledge, making them challenging to adopt for practical measurements.

In this work, we aim to tackle the limitations of existing techniques by introducing a novel approach: predictive analysis of IPID counter behavior. This involves utilizing a machine learning (ML) model to understand the historical patterns of IPID counter changes and predict future IPID values. To validate our approach, we implement six ML models and evaluate them on realistic IPID data collected from 4,698 Internet sources. Our evaluations demonstrate that among the six models, the GP (Gaussian Process) model has superior accuracy in tracking and predicting IPID values.

Using the GP-based predictive analysis, we implement a tool, called ZPredict, to infer various favorable information about target networks or servers. Our evaluation on a large dataset of public servers demonstrates its effectiveness in idle port scanning, measuring Russian censorship, and inferring Source Address Validation (SAV).

Our study methodology is ethical and was developed to mitigate any potential harm, taking into account the concerns associated with measurements.

网络侦察和测量在提高互联网安全方面发挥着核心作用,对于了解当前的部署和趋势也非常重要。此类测量通常需要与被测目标进行协调。这限制了现有建议的可扩展性和覆盖范围。IP 识别(IPID)为远程测量提供了一个侧通道,而不需要目标安装代理或访问测量基础设施。然而,目前基于 IPID 的技术存在技术局限性,因为它们依赖于稳定的 IPID 变化或先验知识的理想化假设,这使它们在实际测量中的应用面临挑战。在这项工作中,我们旨在通过引入一种新方法来解决现有技术的局限性:对 IPID 计数器行为进行预测分析。这包括利用机器学习(ML)模型来理解 IPID 计数器变化的历史模式,并预测未来的 IPID 值。为了验证我们的方法,我们实施了六个 ML 模型,并在从 4,698 个互联网来源收集的实际 IPID 数据上对它们进行了评估。评估结果表明,在六个模型中,GP(高斯过程)模型在跟踪和预测 IPID 值方面具有更高的准确性。利用基于 GP 的预测分析,我们开发了一款名为 ZPredict 的工具,用于推断目标网络或服务器的各种有利信息。我们在一个大型公共服务器数据集上进行的评估证明了它在空闲端口扫描、衡量俄罗斯审查制度和推断源地址验证(SAV)方面的有效性。我们的研究方法符合道德规范,在开发过程中考虑到了与测量相关的问题,以减少任何潜在危害。
{"title":"ZPredict: ML-Based IPID Side-channel Measurements","authors":"Haya Schulmann, Shujie Zhao","doi":"10.1145/3672560","DOIUrl":"https://doi.org/10.1145/3672560","url":null,"abstract":"<p>Network reconnaissance and measurements play a central role in improving Internet security and are important for understanding the current deployments and trends. Such measurements often require coordination with the measured target. This limits the scalability and the coverage of the existing proposals. IP Identification (IPID) provides a side channel for remote measurements without requiring the targets to install agents or visit the measurement infrastructure. However, current IPID-based techniques have technical limitations due to their reliance on the idealistic assumption of stable IPID changes or prior knowledge, making them challenging to adopt for practical measurements. </p><p>In this work, we aim to tackle the limitations of existing techniques by introducing a novel approach: predictive analysis of IPID counter behavior. This involves utilizing a machine learning (ML) model to understand the historical patterns of IPID counter changes and predict future IPID values. To validate our approach, we implement six ML models and evaluate them on realistic IPID data collected from 4,698 Internet sources. Our evaluations demonstrate that among the six models, the GP (Gaussian Process) model has superior accuracy in tracking and predicting IPID values. </p><p>Using the GP-based predictive analysis, we implement a tool, called ZPredict, to infer various favorable information about target networks or servers. Our evaluation on a large dataset of public servers demonstrates its effectiveness in idle port scanning, measuring Russian censorship, and inferring Source Address Validation (SAV). </p><p>Our study methodology is ethical and was developed to mitigate any potential harm, taking into account the concerns associated with measurements.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141509945","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
ZTA-IoT: A Novel Architecture for Zero-Trust in IoT Systems and an Ensuing Usage Control Model ZTA-IoT:物联网系统零信任的新型架构及随之而来的使用控制模型
IF 2.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-06-17 DOI: 10.1145/3671147
Safwa Ameer, Lopamudra Praharaj, Ravi Sandhu, Smriti Bhatt, Maanak Gupta

Recently, several researchers motivated the need to integrate Zero Trust (ZT) principles when designing and implementing authentication and authorization systems for IoT. An integrated Zero Trust IoT system comprises the network infrastructure (physical and virtual) and operational policies in place for IoT as a product of a ZT architecture plan. This paper proposes a novel Zero Trust architecture for IoT systems called ZTA-IoT. Additionally, based on different types of interactions between various layers and components in this architecture, we present ZTA-IoT-ACF, an access control framework that recognizes different interactions that need to be controlled in IoT systems. Within this framework, the paper then refines its focus to object-level interactions, i.e., interactions where the target resource is a device (equivalently a thing) or an information file generated or stored by a device. Building on the recently proposed Zero Trust score-based authorization framework (ZT-SAF) we develop the object-level Zero Trust score-based authorization framework for IoT systems, denoted as ZTA-IoT-OL-SAF, to govern access requests in this context. With this machinery in place, we finally develop a novel usage control model for users-to-objects and devices-to-objects interactions, denoted as UCONIoT. We give formal definitions, illustrative use cases, and a proof-of-concept implementation of UCONIoT. This paper is a first step toward establishing a rigorous formally-defined score-based access control framework for Zero Trust IoT systems.

最近,一些研究人员提出,在设计和实施物联网身份验证和授权系统时,需要整合零信任(ZT)原则。一个集成的零信任物联网系统包括网络基础设施(物理和虚拟)以及作为 ZT 架构计划产物的物联网操作策略。本文为物联网系统提出了一种名为 ZTA-IoT 的新型零信任架构。此外,基于该架构中各层和组件之间不同类型的交互,我们提出了 ZTA-IoT-ACF 这一访问控制框架,该框架可识别物联网系统中需要控制的不同交互。在此框架内,本文将重点细化为对象级交互,即目标资源是设备(等同于事物)或设备生成或存储的信息文件的交互。在最近提出的基于零信任分值的授权框架(ZT-SAF)基础上,我们为物联网系统开发了对象级基于零信任分值的授权框架,称为 ZTA-IoT-OL-SAF,用于管理这种情况下的访问请求。有了这个机制,我们最终为用户到对象和设备到对象的交互开发了一种新的使用控制模型,称为 UCONIoT。我们给出了 UCONIoT 的正式定义、说明性用例和概念验证实现。本文是为零信任物联网系统建立严格的正式定义的基于分数的访问控制框架迈出的第一步。
{"title":"ZTA-IoT: A Novel Architecture for Zero-Trust in IoT Systems and an Ensuing Usage Control Model","authors":"Safwa Ameer, Lopamudra Praharaj, Ravi Sandhu, Smriti Bhatt, Maanak Gupta","doi":"10.1145/3671147","DOIUrl":"https://doi.org/10.1145/3671147","url":null,"abstract":"<p>Recently, several researchers motivated the need to integrate Zero Trust (ZT) principles when designing and implementing authentication and authorization systems for IoT. An integrated Zero Trust IoT system comprises the network infrastructure (physical and virtual) and operational policies in place for IoT as a product of a ZT architecture plan. This paper proposes a novel Zero Trust architecture for IoT systems called ZTA-IoT. Additionally, based on different types of interactions between various layers and components in this architecture, we present ZTA-IoT-ACF, an access control framework that recognizes different interactions that need to be controlled in IoT systems. Within this framework, the paper then refines its focus to object-level interactions, i.e., interactions where the target resource is a device (equivalently a thing) or an information file generated or stored by a device. Building on the recently proposed Zero Trust score-based authorization framework (ZT-SAF) we develop the object-level Zero Trust score-based authorization framework for IoT systems, denoted as ZTA-IoT-OL-SAF, to govern access requests in this context. With this machinery in place, we finally develop a novel usage control model for users-to-objects and devices-to-objects interactions, denoted as UCON<sub><i>IoT</i></sub>. We give formal definitions, illustrative use cases, and a proof-of-concept implementation of UCON<sub><i>IoT</i></sub>. This paper is a first step toward establishing a rigorous formally-defined score-based access control framework for Zero Trust IoT systems.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529973","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 Analysis of the Consumer Remote SIM Provisioning Protocol 消费者远程 SIM 卡供应协议的安全分析
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-05-06 DOI: 10.1145/3663761
Abu Shohel Ahmed, Aleksi Peltonen, Mohit Sethi, Tuomas Aura

Remote SIM provisioning (RSP) for consumer devices is the protocol specified by the GSM Association for downloading SIM profiles into a secure element in a mobile device. The process is commonly known as eSIM, and it is expected to replace removable SIM cards. The security of the protocol is critical because the profile includes the credentials with which the mobile device will authenticate to the mobile network. In this paper, we present a formal security analysis of the consumer RSP protocol. We model the multi-party protocol in applied pi calculus, define formal security goals, and verify them in ProVerif. The analysis shows that the consumer RSP protocol protects against a network adversary when all the intended participants are honest. However, we also model the protocol in realistic partial compromise scenarios where the adversary controls a legitimate participant or communication channel. The security failures in the partial compromise scenarios reveal weaknesses in the protocol design. The most important observation is that the security of RSP depends unnecessarily on it being encapsulated in a TLS tunnel. Also, the lack of pre-established identifiers means that a compromised download server anywhere in the world or a compromised secure element can be used for attacks against RSP between honest participants. Additionally, the lack of reliable methods for verifying user intent can lead to serious security failures. Based on the findings, we recommend practical improvements to RSP implementations, future versions of the specification, and mobile operator processes to increase the robustness of eSIM security.

消费类设备的远程 SIM 卡供应(RSP)是 GSM 协会指定的协议,用于将 SIM 卡配置文件下载到移动设备的安全元件中。这一过程通常被称为 eSIM,有望取代可移动 SIM 卡。该协议的安全性至关重要,因为配置文件包括移动设备验证移动网络的凭证。在本文中,我们对消费者 RSP 协议进行了正式的安全分析。我们用应用 pi 微积分为多方协议建模,定义了形式安全目标,并用 ProVerif 验证了这些目标。分析表明,当所有预期参与者都是诚实的时候,消费者 RSP 协议可以抵御网络对手。不过,我们也在现实的部分妥协场景中对该协议进行了建模,在这种场景中,对手控制了一个合法参与者或通信通道。部分妥协场景中的安全失效揭示了协议设计中的弱点。最重要的一点是,RSP 的安全性不必要地依赖于封装在 TLS 隧道中。而且,由于缺乏预先确定的标识符,世界上任何地方的被入侵下载服务器或被入侵的安全元件都可能被用来攻击诚实参与者之间的 RSP。此外,缺乏验证用户意图的可靠方法也会导致严重的安全故障。根据研究结果,我们建议对 RSP 实现、未来版本的规范和移动运营商流程进行实际改进,以提高 eSIM 安全的稳健性。
{"title":"Security Analysis of the Consumer Remote SIM Provisioning Protocol","authors":"Abu Shohel Ahmed, Aleksi Peltonen, Mohit Sethi, Tuomas Aura","doi":"10.1145/3663761","DOIUrl":"https://doi.org/10.1145/3663761","url":null,"abstract":"<p>Remote SIM provisioning (RSP) for consumer devices is the protocol specified by the GSM Association for downloading SIM profiles into a secure element in a mobile device. The process is commonly known as eSIM, and it is expected to replace removable SIM cards. The security of the protocol is critical because the profile includes the credentials with which the mobile device will authenticate to the mobile network. In this paper, we present a formal security analysis of the consumer RSP protocol. We model the multi-party protocol in applied pi calculus, define formal security goals, and verify them in ProVerif. The analysis shows that the consumer RSP protocol protects against a network adversary when all the intended participants are honest. However, we also model the protocol in realistic partial compromise scenarios where the adversary controls a legitimate participant or communication channel. The security failures in the partial compromise scenarios reveal weaknesses in the protocol design. The most important observation is that the security of RSP depends unnecessarily on it being encapsulated in a TLS tunnel. Also, the lack of pre-established identifiers means that a compromised download server anywhere in the world or a compromised secure element can be used for attacks against RSP between honest participants. Additionally, the lack of reliable methods for verifying user intent can lead to serious security failures. Based on the findings, we recommend practical improvements to RSP implementations, future versions of the specification, and mobile operator processes to increase the robustness of eSIM security.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140884538","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
X-squatter: AI Multilingual Generation of Cross-Language Sound-squatting X-squatter:人工智能多语种生成跨语言 "呷呷 "声
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-05-06 DOI: 10.1145/3663569
Rodolfo Vieira Valentim, Idilio Drago, Marco Mellia, Federico Cerutti

Sound-squatting is a squatting technique that exploits similarities in word pronunciation to trick users into accessing malicious resources. It is an understudied threat that has gained traction with the popularity of smart speakers and audio-only content, such as podcasts. The picture gets even more complex when multiple languages are involved. We here introduce X-squatter, a multi- and cross-language AI-based system that relies on a Transformer Neural Network for generating high-quality sound-squatting candidates. We illustrate the use of X-squatter by searching for domain name squatting abuse across hundreds of millions of issued TLS certificates, alongside other squatting types. Key findings unveil that approximately 15% of generated sound-squatting candidates have associated TLS certificates, well above the prevalence of other squatting types (7%). Furthermore, we employ X-squatter to assess the potential for abuse in PyPI packages, revealing the existence of hundreds of candidates within a three-year package history. Notably, our results suggest that the current platform checks cannot handle sound-squatting attacks, calling for better countermeasures. We believe X-squatter uncovers the usage of multilingual sound-squatting phenomenon on the Internet and it is a crucial asset for proactive protection against the threat.

声音蹲守是一种利用单词发音相似性诱骗用户访问恶意资源的蹲守技术。这是一种未被充分研究的威胁,随着智能扬声器和纯音频内容(如播客)的普及,这种威胁的影响力越来越大。如果涉及多种语言,情况就会变得更加复杂。我们在此介绍 X-squatter,它是一种基于多语言和跨语言的人工智能系统,依靠变形神经网络生成高质量的声音侵扰候选者。我们通过在数以亿计的已签发 TLS 证书中搜索域名抢注滥用以及其他抢注类型来说明 X-squatter 的用途。主要研究结果表明,在生成的恶意抢注候选域名中,约有 15%具有相关的 TLS 证书,远高于其他抢注类型的发生率(7%)。此外,我们还利用 X-squatter 评估了 PyPI 软件包的滥用潜力,发现在三年的软件包历史中存在数百个候选软件。值得注意的是,我们的结果表明,当前的平台检查无法处理声音剽窃攻击,因此需要更好的应对措施。我们认为,X-squatter 发现了互联网上多语言声音抢注现象的使用情况,是主动防范这种威胁的重要资产。
{"title":"X-squatter: AI Multilingual Generation of Cross-Language Sound-squatting","authors":"Rodolfo Vieira Valentim, Idilio Drago, Marco Mellia, Federico Cerutti","doi":"10.1145/3663569","DOIUrl":"https://doi.org/10.1145/3663569","url":null,"abstract":"<p>Sound-squatting is a squatting technique that exploits similarities in word pronunciation to trick users into accessing malicious resources. It is an understudied threat that has gained traction with the popularity of smart speakers and audio-only content, such as podcasts. The picture gets even more complex when multiple languages are involved. We here introduce X-squatter, a multi- and cross-language AI-based system that relies on a Transformer Neural Network for generating high-quality sound-squatting candidates. We illustrate the use of X-squatter by searching for domain name squatting abuse across hundreds of millions of issued TLS certificates, alongside other squatting types. Key findings unveil that approximately 15% of generated sound-squatting candidates have associated TLS certificates, well above the prevalence of other squatting types (7%). Furthermore, we employ X-squatter to assess the potential for abuse in PyPI packages, revealing the existence of hundreds of candidates within a three-year package history. Notably, our results suggest that the current platform checks cannot handle sound-squatting attacks, calling for better countermeasures. We believe X-squatter uncovers the usage of multilingual sound-squatting phenomenon on the Internet and it is a crucial asset for proactive protection against the threat.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140884684","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
Toward Robust ASR System against Audio Adversarial Examples using Agitated Logit 利用激动 Logit 实现针对音频对抗性示例的鲁棒 ASR 系统
IF 2.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-26 DOI: 10.1145/3661822
Namgyu Park, Jong Kim

Automatic speech recognition (ASR) systems are vulnerable to audio adversarial examples, which aim to deceive ASR systems by adding perturbations to benign speech signals. These audio adversarial examples appear indistinguishable from benign audio waves, but the ASR system decodes them as intentional malicious commands. Previous studies have demonstrated the feasibility of such attacks in simulated environments (over-line) and have further showcased the creation of robust physical audio adversarial examples (over-air). Various defense techniques have been proposed to counter these attacks. However, most of them have either failed to handle various types of attacks effectively or have resulted in significant time overhead.

In this paper, we propose a novel method for detecting audio adversarial examples. Our approach involves feeding both smoothed audio and original audio inputs into the ASR system. Subsequently, we introduce noise to the logits before providing them to the decoder of the ASR. We demonstrate that carefully selected noise can considerably influence the transcription results of audio adversarial examples while having minimal impact on the transcription of benign audio waves. Leveraging this characteristic, we detect audio adversarial examples by comparing the altered transcription, resulting from logit noising, with the original transcription. The proposed method can be easily applied to ASR systems without requiring any structural modifications or additional training. Experimental results indicate that the proposed method exhibits robustness against both over-line and over-air audio adversarial examples, outperforming state-of-the-art detection methods.

自动语音识别(ASR)系统容易受到音频对抗范例的影响,这些范例旨在通过在良性语音信号中添加扰动来欺骗 ASR 系统。这些音频对抗范例看起来与良性音频波无异,但 ASR 系统却能将其解码为故意的恶意指令。以前的研究已经证明了在模拟环境中进行此类攻击的可行性(在线),并进一步展示了创建鲁棒物理音频对抗示例的过程(空中)。为应对这些攻击,人们提出了各种防御技术。然而,其中大多数技术要么无法有效处理各种类型的攻击,要么导致大量时间开销。在本文中,我们提出了一种检测音频对抗示例的新方法。我们的方法是将平滑音频和原始音频输入 ASR 系统。随后,我们将噪声引入对数,然后再将其提供给 ASR 解码器。我们证明,经过精心挑选的噪声可以极大地影响对抗性音频示例的转录结果,而对良性音频波的转录影响却微乎其微。利用这一特点,我们通过比较因 logit 噪声而改变的转录结果和原始转录结果,来检测音频对抗示例。所提出的方法可轻松应用于 ASR 系统,无需进行任何结构修改或额外训练。实验结果表明,所提出的方法对过线和过空音频对抗示例都具有鲁棒性,优于最先进的检测方法。
{"title":"Toward Robust ASR System against Audio Adversarial Examples using Agitated Logit","authors":"Namgyu Park, Jong Kim","doi":"10.1145/3661822","DOIUrl":"https://doi.org/10.1145/3661822","url":null,"abstract":"<p>Automatic speech recognition (ASR) systems are vulnerable to audio adversarial examples, which aim to deceive ASR systems by adding perturbations to benign speech signals. These audio adversarial examples appear indistinguishable from benign audio waves, but the ASR system decodes them as intentional malicious commands. Previous studies have demonstrated the feasibility of such attacks in simulated environments (over-line) and have further showcased the creation of robust physical audio adversarial examples (over-air). Various defense techniques have been proposed to counter these attacks. However, most of them have either failed to handle various types of attacks effectively or have resulted in significant time overhead. </p><p>In this paper, we propose a novel method for detecting audio adversarial examples. Our approach involves feeding both smoothed audio and original audio inputs into the ASR system. Subsequently, we introduce noise to the logits before providing them to the decoder of the ASR. We demonstrate that carefully selected noise can considerably influence the transcription results of audio adversarial examples while having minimal impact on the transcription of benign audio waves. Leveraging this characteristic, we detect audio adversarial examples by comparing the altered transcription, resulting from logit noising, with the original transcription. The proposed method can be easily applied to ASR systems without requiring any structural modifications or additional training. Experimental results indicate that the proposed method exhibits robustness against both over-line and over-air audio adversarial examples, outperforming state-of-the-art detection methods.</p>","PeriodicalId":56050,"journal":{"name":"ACM Transactions on Privacy and Security","volume":null,"pages":null},"PeriodicalIF":2.3,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140800483","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
期刊
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