首页 > 最新文献

IET Information Security最新文献

英文 中文
MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes MS-LW-TI:基于基元的 4 × 4 S-box 一阶阈值实现方法
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-11 DOI: 10.1049/2024/8851878
Botao Liu, Ming Tang

Threshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-threshold implementation (MS-LW-TI). First, we use MiniSat to optimally decompose an S-box into the least number of three different logic gate operations, AND, OR, and XOR. Among these operations, we define two primitives and the extension of two primitives for TI design. Furthermore, we prove that the primitives and their extensions strictly comply with the security properties. Finally, we implement MS-LW-TI on Xilinx Spartan-6 Field Programmable Gate Array (FPGA) to show that the S-boxes of PRESENT, GIFT, and PICCOLO consume only 17, 15, and 13 look-up-tables (LUTs), 16, 9, and 16 flip-flops (FFs), 6, 5, and 6 slices, respectively. Compared with the existing lightweight TI design, our TI for PRESENT S-box has a 22%, 38%, and 25% reduction of LUTs, FFs, and slices to the design by Shahmirzadi and Moradi at IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021, and our TI for GIFT S-box has a 6%, 25%, and 28% reduction of LUTs, FFs, and slices to the design by Jati et al., which is the smallest.

阈值实现(TI)是一种轻型对策,可在发生故障时抵御侧信道攻击。对于掩码方案来说,S-box 是保护的关键部分。本文提出了一种适用于 4 × 4 S-box 的通用一阶轻量级阈值实现方案,并将其命名为 MiniSat-轻量级阈值实现(MS-LW-TI)。首先,我们利用 MiniSat 将 S-box 分解为最少的三种不同逻辑门操作:AND、OR 和 XOR。在这些操作中,我们为 TI 设计定义了两个基元和两个基元的扩展。此外,我们还证明了这些基元及其扩展严格符合安全属性。最后,我们在 Xilinx Spartan-6 现场可编程门阵列(FPGA)上实现了 MS-LW-TI,结果表明 PRESENT、GIFT 和 PICCOLO 的 S-box 只分别消耗了 17、15 和 13 个查找表(LUT)、16、9 和 16 个触发器(FF)、6、5 和 6 个切片。与现有的轻量级 TI 设计相比,我们为 PRESENT S-box 设计的 TI 与 Shahmirzadi 和 Moradi 在 IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021 会议上的设计相比,LUT、FF 和切片分别减少了 22%、38% 和 25%,而我们为 GIFT S-box 设计的 TI 与 Jati 等人的设计相比,LUT、FF 和切片分别减少了 6%、25% 和 28%,是最小的。
{"title":"MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes","authors":"Botao Liu,&nbsp;Ming Tang","doi":"10.1049/2024/8851878","DOIUrl":"10.1049/2024/8851878","url":null,"abstract":"<div>\u0000 <p>Threshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-threshold implementation (MS-LW-TI). First, we use MiniSat to optimally decompose an S-box into the least number of three different logic gate operations, AND, OR, and XOR. Among these operations, we define two primitives and the extension of two primitives for TI design. Furthermore, we prove that the primitives and their extensions strictly comply with the security properties. Finally, we implement MS-LW-TI on Xilinx Spartan-6 Field Programmable Gate Array (FPGA) to show that the S-boxes of PRESENT, GIFT, and PICCOLO consume only 17, 15, and 13 look-up-tables (LUTs), 16, 9, and 16 flip-flops (FFs), 6, 5, and 6 slices, respectively. Compared with the existing lightweight TI design, our TI for PRESENT S-box has a 22%, 38%, and 25% reduction of LUTs, FFs, and slices to the design by Shahmirzadi and Moradi at IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021, and our TI for GIFT S-box has a 6%, 25%, and 28% reduction of LUTs, FFs, and slices to the design by Jati et al., which is the smallest.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/8851878","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140989800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Boosting the Transferability of Ensemble Adversarial Attack via Stochastic Average Variance Descent 通过随机平均方差下降提高组合对抗攻击的可转移性
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-11 DOI: 10.1049/2024/7983842
Lei Zhao, Zhizhi Liu, Sixing Wu, Wei Chen, Liwen Wu, Bin Pu, Shaowen Yao

Adversarial examples have the property of transferring across models, which has created a great threat for deep learning models. To reveal the shortcomings in the existing deep learning models, the method of the ensemble has been introduced to the generating of transferable adversarial examples. However, most of the model ensemble attacks directly combine the different models’ output but ignore the large differences in optimization direction of them, which severely limits the transfer attack ability. In this work, we propose a new kind of ensemble attack method called stochastic average ensemble attack. Unlike the existing approach of averaging the outputs of each model as an integrated output, we continuously optimize the ensemble gradient in an internal loop using the model history gradient and the average gradient of different models. In this way, the adversarial examples can be updated in a more appropriate direction and make the crafted adversarial examples more transferable. Experimental results on ImageNet show that our method generates highly transferable adversarial examples and outperforms existing methods.

对抗范例具有跨模型转移的特性,这给深度学习模型带来了巨大威胁。为了揭示现有深度学习模型的缺陷,人们将集合方法引入到可转移对抗范例的生成中。然而,大多数模型集合攻击直接将不同模型的输出进行组合,却忽略了它们在优化方向上的巨大差异,严重限制了转移攻击能力。在这项工作中,我们提出了一种新的集合攻击方法--随机平均集合攻击。与现有的将每个模型的输出平均为一个综合输出的方法不同,我们利用模型历史梯度和不同模型的平均梯度,在内部循环中不断优化集合梯度。这样,对抗示例就能朝着更合适的方向更新,并使精心制作的对抗示例更具可移植性。在 ImageNet 上的实验结果表明,我们的方法生成的对抗示例具有很强的可移植性,优于现有方法。
{"title":"Boosting the Transferability of Ensemble Adversarial Attack via Stochastic Average Variance Descent","authors":"Lei Zhao,&nbsp;Zhizhi Liu,&nbsp;Sixing Wu,&nbsp;Wei Chen,&nbsp;Liwen Wu,&nbsp;Bin Pu,&nbsp;Shaowen Yao","doi":"10.1049/2024/7983842","DOIUrl":"10.1049/2024/7983842","url":null,"abstract":"<div>\u0000 <p>Adversarial examples have the property of transferring across models, which has created a great threat for deep learning models. To reveal the shortcomings in the existing deep learning models, the method of the ensemble has been introduced to the generating of transferable adversarial examples. However, most of the model ensemble attacks directly combine the different models’ output but ignore the large differences in optimization direction of them, which severely limits the transfer attack ability. In this work, we propose a new kind of ensemble attack method called stochastic average ensemble attack. Unlike the existing approach of averaging the outputs of each model as an integrated output, we continuously optimize the ensemble gradient in an internal loop using the model history gradient and the average gradient of different models. In this way, the adversarial examples can be updated in a more appropriate direction and make the crafted adversarial examples more transferable. Experimental results on ImageNet show that our method generates highly transferable adversarial examples and outperforms existing methods.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/7983842","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140989001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
HA-Med: A Blockchain-Based Solution for Sharing Medical Data with Hidden Policies and Attributes HA-Med:基于区块链的隐藏政策和属性医疗数据共享解决方案
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-04-26 DOI: 10.1049/2024/2498245
Xiaohui Yang, Jing Liu

Existing healthcare data-sharing solutions often combine attribute-based encryption techniques with blockchain technology to achieve fine-grained access control. However, the transparency of blockchain technology may introduce potential risks of exposing access structures and user attributes. To address these concerns, this paper proposes a novel healthcare data-sharing scheme called HA-Med. By leveraging blockchain technology, HA-Med ensures the concealment of access policies and attributes, providing a secure solution for fine-grained access control of medical data. Furthermore, the scheme supports attribute revocation and forward secrecy to enhance user privacy. The security of HA-Med is rigorously verified through theoretical analysis, and its feasibility is demonstrated through experiments conducted using the Java-based JPBC library.

现有的医疗保健数据共享解决方案通常将基于属性的加密技术与区块链技术相结合,以实现细粒度访问控制。然而,区块链技术的透明性可能会带来访问结构和用户属性暴露的潜在风险。为了解决这些问题,本文提出了一种名为 HA-Med 的新型医疗数据共享方案。通过利用区块链技术,HA-Med 确保了访问策略和属性的隐蔽性,为医疗数据的细粒度访问控制提供了一个安全的解决方案。此外,该方案还支持属性撤销和前向保密,以增强用户隐私。HA-Med 的安全性通过理论分析得到了严格验证,其可行性通过使用基于 Java 的 JPBC 库进行的实验得到了证明。
{"title":"HA-Med: A Blockchain-Based Solution for Sharing Medical Data with Hidden Policies and Attributes","authors":"Xiaohui Yang,&nbsp;Jing Liu","doi":"10.1049/2024/2498245","DOIUrl":"https://doi.org/10.1049/2024/2498245","url":null,"abstract":"<div>\u0000 <p>Existing healthcare data-sharing solutions often combine attribute-based encryption techniques with blockchain technology to achieve fine-grained access control. However, the transparency of blockchain technology may introduce potential risks of exposing access structures and user attributes. To address these concerns, this paper proposes a novel healthcare data-sharing scheme called HA-Med. By leveraging blockchain technology, HA-Med ensures the concealment of access policies and attributes, providing a secure solution for fine-grained access control of medical data. Furthermore, the scheme supports attribute revocation and forward secrecy to enhance user privacy. The security of HA-Med is rigorously verified through theoretical analysis, and its feasibility is demonstrated through experiments conducted using the Java-based JPBC library.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/2498245","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DHRCA: A Design of Security Architecture Based on Dynamic Heterogeneous Redundant for System on Wafer DHRCA:基于晶圆上系统动态异构冗余的安全架构设计
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-04-12 DOI: 10.1049/2024/2023349
Bo Mei, Zhengbin Zhu, Peijie Li, Bo Zhao

System on Wafer (SoW) based on chiplets may be implanted with hardware Trojans (HTs) by untrustworthy third-party chiplet vendors. However, traditional HTs protection techniques cannot guarantee complete protection against HTs, which poses a great challenge to the hardware security of SoW. In this paper, we propose a computing architecture based on endogenous security theory—dynamic heterogeneous redundant computing architecture (DHRCA) that can tolerate and detect HTs at runtime. The security of our approach is analyzed by building a generalized stochastic coloring petri net (GSCPN) model of DHRCA. The simulation results based on the GSCPN model show that our method can improve the system security probability to 0.8690 and the system availability probability to 0.9750 in the steady state compared with typical triple-mode redundancy and runtime monitoring methods. Furthermore, the impact of different attack and defense strategies on system security of different methods is simulated and analyzed in this paper.

基于芯片的片上系统(SoW)可能会被不可信的第三方芯片供应商植入硬件木马(HTs)。然而,传统的 HTs 防护技术无法保证对 HTs 的完全防护,这给 SoW 的硬件安全带来了巨大挑战。本文提出了一种基于内生安全理论的计算架构--动态异构冗余计算架构(DHRCA),它可以在运行时容忍和检测 HT。通过建立 DHRCA 的广义随机着色 petri 网(GSCPN)模型,分析了我们方法的安全性。基于 GSCPN 模型的仿真结果表明,与典型的三重模式冗余和运行时监控方法相比,我们的方法可以将系统安全概率提高到 0.8690,将系统在稳定状态下的可用性概率提高到 0.9750。此外,本文还模拟和分析了不同攻击和防御策略对不同方法的系统安全性的影响。
{"title":"DHRCA: A Design of Security Architecture Based on Dynamic Heterogeneous Redundant for System on Wafer","authors":"Bo Mei,&nbsp;Zhengbin Zhu,&nbsp;Peijie Li,&nbsp;Bo Zhao","doi":"10.1049/2024/2023349","DOIUrl":"10.1049/2024/2023349","url":null,"abstract":"<div>\u0000 <p>System on Wafer (SoW) based on chiplets may be implanted with hardware Trojans (HTs) by untrustworthy third-party chiplet vendors. However, traditional HTs protection techniques cannot guarantee complete protection against HTs, which poses a great challenge to the hardware security of SoW. In this paper, we propose a computing architecture based on endogenous security theory—dynamic heterogeneous redundant computing architecture (DHRCA) that can tolerate and detect HTs at runtime. The security of our approach is analyzed by building a generalized stochastic coloring petri net (GSCPN) model of DHRCA. The simulation results based on the GSCPN model show that our method can improve the system security probability to 0.8690 and the system availability probability to 0.9750 in the steady state compared with typical triple-mode redundancy and runtime monitoring methods. Furthermore, the impact of different attack and defense strategies on system security of different methods is simulated and analyzed in this paper.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/2023349","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140710592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep Learning in Cybersecurity: A Hybrid BERT–LSTM Network for SQL Injection Attack Detection 网络安全中的深度学习:用于 SQL 注入攻击检测的混合 BERT-LSTM 网络
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-04-05 DOI: 10.1049/2024/5565950
Yixian Liu, Yupeng Dai

In the past decade, cybersecurity has become increasingly significant, driven largely by the increase in cybersecurity threats. Among these threats, SQL injection attacks stand out as a particularly common method of cyber attack. Traditional methods for detecting these attacks mainly rely on manually defined features, making these detection outcomes highly dependent on the precision of feature extraction. Unfortunately, these approaches struggle to adapt to the increasingly sophisticated nature of these attack techniques, thereby necessitating the development of more robust detection strategies. This paper presents a novel deep learning framework that integrates Bidirectional Encoder Representations from Transformers (BERT) and Long Short-Term Memory (LSTM) networks, enhancing the detection of SQL injection attacks. Leveraging the advanced contextual encoding capabilities of BERT and the sequential data processing ability of LSTM networks, the proposed model dynamically extracts word and sentence-level features, subsequently generating embedding vectors that effectively identify malicious SQL query patterns. Experimental results indicate that our method achieves accuracy, precision, recall, and F1 scores of 0.973, 0.963, 0.962, and 0.958, respectively, while ensuring high computational efficiency.

在过去十年中,网络安全变得越来越重要,这主要是由于网络安全威胁的增加。在这些威胁中,SQL 注入攻击是一种特别常见的网络攻击方法。检测这些攻击的传统方法主要依赖于人工定义的特征,因此这些检测结果高度依赖于特征提取的精度。遗憾的是,这些方法难以适应这些攻击技术日益复杂的性质,因此需要开发更强大的检测策略。本文提出了一种新颖的深度学习框架,该框架集成了来自变换器的双向编码器表征(BERT)和长短期记忆(LSTM)网络,从而提高了对 SQL 注入攻击的检测能力。利用 BERT 先进的上下文编码能力和 LSTM 网络的顺序数据处理能力,所提出的模型可动态提取单词和句子级特征,随后生成嵌入向量,从而有效识别恶意 SQL 查询模式。实验结果表明,我们的方法在保证高计算效率的同时,准确度、精确度、召回率和 F1 分数分别达到了 0.973、0.963、0.962 和 0.958。
{"title":"Deep Learning in Cybersecurity: A Hybrid BERT–LSTM Network for SQL Injection Attack Detection","authors":"Yixian Liu,&nbsp;Yupeng Dai","doi":"10.1049/2024/5565950","DOIUrl":"10.1049/2024/5565950","url":null,"abstract":"<div>\u0000 <p>In the past decade, cybersecurity has become increasingly significant, driven largely by the increase in cybersecurity threats. Among these threats, SQL injection attacks stand out as a particularly common method of cyber attack. Traditional methods for detecting these attacks mainly rely on manually defined features, making these detection outcomes highly dependent on the precision of feature extraction. Unfortunately, these approaches struggle to adapt to the increasingly sophisticated nature of these attack techniques, thereby necessitating the development of more robust detection strategies. This paper presents a novel deep learning framework that integrates Bidirectional Encoder Representations from Transformers (BERT) and Long Short-Term Memory (LSTM) networks, enhancing the detection of SQL injection attacks. Leveraging the advanced contextual encoding capabilities of BERT and the sequential data processing ability of LSTM networks, the proposed model dynamically extracts word and sentence-level features, subsequently generating embedding vectors that effectively identify malicious SQL query patterns. Experimental results indicate that our method achieves accuracy, precision, recall, and F1 scores of 0.973, 0.963, 0.962, and 0.958, respectively, while ensuring high computational efficiency.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/5565950","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140736257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential Fault Attacks on Privacy Protocols Friendly Symmetric-Key Primitives: RAIN and HERA 对友好对称密钥原语隐私协议的差分故障攻击:RAIN 和 HERA
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-27 DOI: 10.1049/2024/7457517
Lin Jiao, Yongqiang Li, Yonglin Hao, Xinxin Gong

As the practical applications of fully homomorphic encryption (FHE), secure multi-party computation (MPC) and zero-knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric-key primitives that can adapt to these privacy-preserving protocols. These designs typically have low multiplicative complexity and depth with the parameter domain adapted to their application protocols, aiming to minimize the cost associated with the number of nonlinear operations or the multiplicative depth of their representation as circuits. In this paper, we propose two differential fault attacks against a one-way function RAIN used for Rainier (CCS 2022), a signature scheme based on the MPC-in-the-head approach and an FHE-friendly cipher HERA used for the RtF framework (Eurocrypt 2022), respectively. We show that our attacks can recover the keys for both ciphers by only injecting a fault into the internal state and requiring only one normal and one faulty ciphertext blocks. Thus, we can use only the practical complexity of 226.6/228.8/230.4 bit operations to break the full-round RAIN with 128/192/256-bit keys. For full-round HERA with 80/128-bit key, our attack is practical with complexity the complexity of 220 encryptions with about 216 memory.

随着全同态加密(FHE)、安全多方计算(MPC)和零知识(ZK)证明的实际应用不断增加,设计和分析能够适应这些隐私保护协议的新对称密钥基元的需求也在不断增加。这些设计通常具有较低的乘法复杂度和深度,其参数域适应其应用协议,旨在最大限度地降低与非线性运算数量或其电路表示的乘法深度相关的成本。在本文中,我们针对 Rainier 使用的单向函数 RAIN(CCS 2022)、基于 MPC-in-thehead 方法的签名方案和 RtF 框架使用的 FHE 友好密码 HERA(Eurocrypt 2022)分别提出了两种差分故障攻击。我们的研究表明,我们的攻击只需向内部状态注入故障,只需一个正常和一个故障密码文本块,就能恢复这两种密码的密钥。因此,我们只需使用 226.6/228.8/230.4 位运算的实际复杂度,就能破解 128/192/256 位密钥的全圆 RAIN。对于使用 80/128 位密钥的全圆 HERA,我们的攻击只需约 216 个内存,即可实现 220 次加密的实际复杂度。
{"title":"Differential Fault Attacks on Privacy Protocols Friendly Symmetric-Key Primitives: RAIN and HERA","authors":"Lin Jiao,&nbsp;Yongqiang Li,&nbsp;Yonglin Hao,&nbsp;Xinxin Gong","doi":"10.1049/2024/7457517","DOIUrl":"https://doi.org/10.1049/2024/7457517","url":null,"abstract":"<div>\u0000 <p>As the practical applications of fully homomorphic encryption (FHE), secure multi-party computation (MPC) and zero-knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric-key primitives that can adapt to these privacy-preserving protocols. These designs typically have low multiplicative complexity and depth with the parameter domain adapted to their application protocols, aiming to minimize the cost associated with the number of nonlinear operations or the multiplicative depth of their representation as circuits. In this paper, we propose two differential fault attacks against a one-way function RAIN used for Rainier (CCS 2022), a signature scheme based on the MPC-in-the-head approach and an FHE-friendly cipher HERA used for the RtF framework (Eurocrypt 2022), respectively. We show that our attacks can recover the keys for both ciphers by only injecting a fault into the internal state and requiring only one normal and one faulty ciphertext blocks. Thus, we can use only the practical complexity of 2<sup>26.6</sup>/2<sup>28.8</sup>/2<sup>30.4</sup> bit operations to break the full-round RAIN with 128/192/256-bit keys. For full-round HERA with 80/128-bit key, our attack is practical with complexity the complexity of 2<sup>20</sup> encryptions with about 2<sup>16</sup> memory.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/7457517","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Second Preimage Attack on the XOR Hash Combiner 针对 XOR 哈希组合器的第二种前图像攻击
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-22 DOI: 10.1049/2024/1230891
Shiwei Chen, Ting Cui, Chenhui Jin, Congjun Wang

The exclusive-or (XOR) hash combiner is a classical hash function combiner, which is well known as a good PRF and MAC combiner, and is used in practice in TLS versions 1.0 and 1.1. In this work, we analyze the second preimage resistance of the XOR combiner underlying two different narrow-pipe hash functions with weak ideal compression functions. To control simultaneously the behavior of the two different hash functions, we develop a new structure called multicollision-and-double-diamond. Multicollision-and-double-diamond structure is constructed using the idea of meet-in-the-middle technique, combined with Joux’s multicollision and Chen’s inverse-diamond structure. Then based on the multicollision-and-double-diamond structure, we present a second preimage attack on the XOR hash combiner with the time complexity of about O((2n + 1)2n/2 + (nl)2nl + (nk)2nk + 2l+1 + 2k+1) (n is the size of the XOR hash combiner and l and k are respectively the depths of the two inverse-diamond structures), less than the ideal time complexity O(2n), and memory of about O(2k + 2l).

排他(XOR)散列组合器是一种经典的散列函数组合器,众所周知,它是一种良好的 PRF 和 MAC 组合器,并在 TLS 1.0 和 1.1 版本中得到了实际应用。在这项工作中,我们分析了 XOR 组合器在两种不同的窄管道哈希函数基础上的第二前像抗性,以及弱理想压缩函数。为了同时控制两种不同哈希函数的行为,我们开发了一种名为 "多碰撞双钻石 "的新结构。多碰撞和双钻石结构是利用中间相遇技术的思想,结合 Joux 的多碰撞和 Chen 的反钻石结构构建的。然后,基于多碰撞和双钻石结构,我们提出了针对 XOR 哈希组合器的第二种预映像攻击,其时间复杂度约为 O((2n+1)2n/2+(n-l)2n-l+(n-k)2n-k+2l+1+2k+1)(n 为 XOR 哈希组合器的大小,l 和 k 分别为两个反钻石结构的深度)、小于理想的时间复杂度 O(2n),内存约为 O(2k+2l)。
{"title":"A Second Preimage Attack on the XOR Hash Combiner","authors":"Shiwei Chen,&nbsp;Ting Cui,&nbsp;Chenhui Jin,&nbsp;Congjun Wang","doi":"10.1049/2024/1230891","DOIUrl":"https://doi.org/10.1049/2024/1230891","url":null,"abstract":"<div>\u0000 <p>The exclusive-or (XOR) hash combiner is a classical hash function combiner, which is well known as a good PRF and MAC combiner, and is used in practice in TLS versions 1.0 and 1.1. In this work, we analyze the second preimage resistance of the XOR combiner underlying two different narrow-pipe hash functions with weak ideal compression functions. To control simultaneously the behavior of the two different hash functions, we develop a new structure called multicollision-and-double-diamond. Multicollision-and-double-diamond structure is constructed using the idea of meet-in-the-middle technique, combined with Joux’s multicollision and Chen’s inverse-diamond structure. Then based on the multicollision-and-double-diamond structure, we present a second preimage attack on the XOR hash combiner with the time complexity of about <i>O</i>((2<i>n</i> + 1)2<sup><i>n</i>/2</sup> + (<i>n</i> − <i>l</i>)2<sup><i>n</i>−<i>l</i></sup> + (<i>n</i> − <i>k</i>)2<sup><i>n</i>−<i>k</i></sup> + 2<sup><i>l</i>+1</sup> + 2<sup><i>k</i>+1</sup>) (<i>n</i> is the size of the XOR hash combiner and <i>l</i> and <i>k</i> are respectively the depths of the two inverse-diamond structures), less than the ideal time complexity <i>O</i>(2<sup><i>n</i></sup>), and memory of about <i>O</i>(2<sup><i>k</i></sup> + 2<sup><i>l</i></sup>).</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/1230891","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
VulMPFF: A Vulnerability Detection Method for Fusing Code Features in Multiple Perspectives VulMPFF:多角度融合代码特征的漏洞检测方法
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-22 DOI: 10.1049/2024/4313185
Xiansheng Cao, Junfeng Wang, Peng Wu, Zhiyang Fang

Source code vulnerabilities are one of the significant threats to software security. Existing deep learning-based detection methods have proven their effectiveness. However, most of them extract code information on a single intermediate representation of code (IRC), which often fails to extract multiple information hidden in the code fully, significantly limiting their performance. To address this problem, we propose VulMPFF, a vulnerability detection method that fuses code features under multiple perspectives. It extracts IRC from three perspectives: code sequence, lexical and syntactic relations, and graph structure to capture the vulnerability information in the code, which effectively realizes the complementary information of multiple IRCs and improves vulnerability detection performance. Specifically, VulMPFF extracts serialized abstract syntax tree as IRC from code sequence, lexical and syntactic relation perspective, and code property graph as IRC from graph structure perspective, and uses Bi-LSTM model with attention mechanism and graph neural network with attention mechanism to learn the code features from multiple perspectives and fuse them to detect the vulnerabilities in the code, respectively. We design a dual-attention mechanism to highlight critical code information for vulnerability triggering and better accomplish the vulnerability detection task. We evaluate our approach on three datasets. Experiments show that VulMPFF outperforms existing state-of-the-art vulnerability detection methods (i.e., Rats, FlawFinder, VulDeePecker, SySeVR, Devign, and Reveal) in Acc and F1 score, with improvements ranging from 14.71% to 145.78% and 152.08% to 344.77%, respectively. Meanwhile, experiments in the open-source project demonstrate that VulMPFF has the potential to detect vulnerabilities in real-world environments.

源代码漏洞是软件安全的重大威胁之一。现有的基于深度学习的检测方法已经证明了其有效性。然而,大多数方法都是在单一的代码中间表示(IRC)上提取代码信息,往往不能完全提取隐藏在代码中的多种信息,大大限制了其性能。为了解决这个问题,我们提出了 VulMPFF,一种在多个视角下融合代码特征的漏洞检测方法。它从代码序列、词法和句法关系、图结构三个角度提取 IRC,捕捉代码中的漏洞信息,有效实现了多个 IRC 信息的互补,提高了漏洞检测性能。具体来说,VulMPFF 从代码序列、词法和句法关系角度提取序列化抽象语法树作为 IRC,从图结构角度提取代码属性图作为 IRC,并分别使用具有注意机制的 Bi-LSTM 模型和具有注意机制的图神经网络来学习多个角度的代码特征,并将其融合在一起检测代码中的漏洞。我们设计了一种双重关注机制,以突出用于触发漏洞的关键代码信息,从而更好地完成漏洞检测任务。我们在三个数据集上评估了我们的方法。实验表明,VulMPFF 在 Acc 和 F1 分数上优于现有的一流漏洞检测方法(即 Rats、FlawFinder、VulDeePecker、SySeVR、Devign 和 Reveal),分别提高了 14.71% 到 145.78%,以及 152.08% 到 344.77%。同时,开源项目的实验证明,VulMPFF 具有在真实世界环境中检测漏洞的潜力。
{"title":"VulMPFF: A Vulnerability Detection Method for Fusing Code Features in Multiple Perspectives","authors":"Xiansheng Cao,&nbsp;Junfeng Wang,&nbsp;Peng Wu,&nbsp;Zhiyang Fang","doi":"10.1049/2024/4313185","DOIUrl":"10.1049/2024/4313185","url":null,"abstract":"<div>\u0000 <p>Source code vulnerabilities are one of the significant threats to software security. Existing deep learning-based detection methods have proven their effectiveness. However, most of them extract code information on a single intermediate representation of code (IRC), which often fails to extract multiple information hidden in the code fully, significantly limiting their performance. To address this problem, we propose VulMPFF, a vulnerability detection method that fuses code features under multiple perspectives. It extracts IRC from three perspectives: code sequence, lexical and syntactic relations, and graph structure to capture the vulnerability information in the code, which effectively realizes the complementary information of multiple IRCs and improves vulnerability detection performance. Specifically, VulMPFF extracts serialized abstract syntax tree as IRC from code sequence, lexical and syntactic relation perspective, and code property graph as IRC from graph structure perspective, and uses Bi-LSTM model with attention mechanism and graph neural network with attention mechanism to learn the code features from multiple perspectives and fuse them to detect the vulnerabilities in the code, respectively. We design a dual-attention mechanism to highlight critical code information for vulnerability triggering and better accomplish the vulnerability detection task. We evaluate our approach on three datasets. Experiments show that VulMPFF outperforms existing state-of-the-art vulnerability detection methods (i.e., Rats, FlawFinder, VulDeePecker, SySeVR, Devign, and Reveal) in Acc and F1 score, with improvements ranging from 14.71% to 145.78% and 152.08% to 344.77%, respectively. Meanwhile, experiments in the open-source project demonstrate that VulMPFF has the potential to detect vulnerabilities in real-world environments.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/4313185","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140211821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Novel Security Scheme Supported by Certificateless Digital Signature and Blockchain in Named Data Networking 命名数据网络中由无证书数字签名和区块链支持的新型安全方案
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-12 DOI: 10.1049/2024/6616095
Bing Li, Mingxuan Zheng, Maode Ma

Named Data Networking (NDN) is a promising network architecture that differs from the traditional TCP/IP network, as it focuses on data rather than the host. A new secure model is required to provide the data-oriented trust instead of the host-oriented trust. This paper proposes a new secure solution in the NDNs named Secure Mechanism supported by Certificateless Digital Signature and Blockchain (CLDS-B). The CLDS-B scheme employs a certificateless digital signature to guarantee the authentication and integrity of data. On the one hand, the key escrow problem has been solved to eliminate the risks of compromised private key generators; on the other hand, the data name has been bound to the public key to prevent the false public key. Moreover, the blockchain is used to manage cryptographic information. Each domain designates an information service entity to join the blockchain so that the consumer could retrieve the cryptographic information public parameter in the local domain if necessary. Furthermore, due to the decentralization of the blockchain, the CLDS-B would be robust to resist the single-node failure. Simulation results show that the CLDS-B scheme outperforms a classic NDN scheme, although it shows slightly inferior to the other secure NDN scheme. The security verification and analysis show that the CLDS-B would resist the key escrow attack. The CLDS-B would be a competitive solution in scenarios with a high-security level.

命名数据网络(NDN)是一种很有前途的网络架构,它不同于传统的 TCP/IP 网络,因为它关注的是数据而不是主机。需要一种新的安全模式来提供面向数据的信任,而不是面向主机的信任。本文提出了一种新的 NDN 安全解决方案,名为 "无证书数字签名和区块链支持的安全机制"(CLDS-B)。CLDS-B 方案采用无证书数字签名来保证数据的认证和完整性。一方面,解决了密钥托管问题,消除了私钥生成器泄露的风险;另一方面,将数据名称与公钥绑定,防止虚假公钥。此外,区块链还用于管理加密信息。每个域指定一个信息服务实体加入区块链,以便消费者在必要时检索本域的加密信息公共参数。此外,由于区块链的去中心化,CLDS-B 具有很强的鲁棒性,可以抵御单节点故障。仿真结果表明,CLDS-B 方案的性能优于经典 NDN 方案,但略逊于其他安全 NDN 方案。安全验证和分析表明,CLDS-B 可以抵御密钥托管攻击。在安全等级较高的情况下,CLDS-B 将是一种有竞争力的解决方案。
{"title":"A Novel Security Scheme Supported by Certificateless Digital Signature and Blockchain in Named Data Networking","authors":"Bing Li,&nbsp;Mingxuan Zheng,&nbsp;Maode Ma","doi":"10.1049/2024/6616095","DOIUrl":"10.1049/2024/6616095","url":null,"abstract":"<div>\u0000 <p>Named Data Networking (NDN) is a promising network architecture that differs from the traditional TCP/IP network, as it focuses on data rather than the host. A new secure model is required to provide the data-oriented trust instead of the host-oriented trust. This paper proposes a new secure solution in the NDNs named Secure Mechanism supported by Certificateless Digital Signature and Blockchain (CLDS-B). The CLDS-B scheme employs a certificateless digital signature to guarantee the authentication and integrity of data. On the one hand, the key escrow problem has been solved to eliminate the risks of compromised private key generators; on the other hand, the data name has been bound to the public key to prevent the false public key. Moreover, the blockchain is used to manage cryptographic information. Each domain designates an information service entity to join the blockchain so that the consumer could retrieve the cryptographic information public parameter in the local domain if necessary. Furthermore, due to the decentralization of the blockchain, the CLDS-B would be robust to resist the single-node failure. Simulation results show that the CLDS-B scheme outperforms a classic NDN scheme, although it shows slightly inferior to the other secure NDN scheme. The security verification and analysis show that the CLDS-B would resist the key escrow attack. The CLDS-B would be a competitive solution in scenarios with a high-security level.</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/6616095","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140249364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP-Hard 决定反馈移位寄存器的不可重复性/不可分性是 NP-困难的
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-07 DOI: 10.1049/2024/3219604
Lin Wang

Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f. A FSR is said to be decomposable if it has the same set of output sequences as a cascade connection of two FSRs. Two polynomial-time computable transformations from Boolean circuits to FSRs are proposed such that the output FSR of the first (resp. second) transformation is irreducible (resp. indecomposable) if and only if the input Boolean circuit is satisfiable. Through the two transformations, it is proved that deciding irreducibility (indecomposability) of FSRs is NP-hard. Additionally, FSRs are constructed to show that there exist infinitely many irreducible (resp. indecomposable) FSRs which are decomposable (resp. reducible).

反馈移位寄存器(FSR)是电子和保密通信中的基本组件。如果另一个 FSR g 的所有输出序列也能由 f 生成,且 FSR g 的内存消耗低于 f,则称 FSR f 是可还原的。本文提出了两种从布尔电路到 FSR 的多项式时间可计算变换,当且仅当输入布尔电路是可满足的时,第一种(或第二种)变换的输出 FSR 是不可还原的(或不可分解的)。通过这两种变换,证明了判定 FSR 的不可还原性(不可分解性)是 NP-困难的。此外,通过构建 FSR 还可以证明,存在无限多的不可还原(或不可分解)的 FSR,这些 FSR 都是可分解(或可还原)的。
{"title":"Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP-Hard","authors":"Lin Wang","doi":"10.1049/2024/3219604","DOIUrl":"https://doi.org/10.1049/2024/3219604","url":null,"abstract":"<div>\u0000 <p>Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR <i>f</i> is said to be reducible if all the output sequences of another FSR <i>g</i> can also be generated by <i>f</i> and the FSR <i>g</i> costs less memory than <i>f</i>. A FSR is said to be decomposable if it has the same set of output sequences as a cascade connection of two FSRs. Two polynomial-time computable transformations from Boolean circuits to FSRs are proposed such that the output FSR of the first (resp. second) transformation is irreducible (resp. indecomposable) if and only if the input Boolean circuit is satisfiable. Through the two transformations, it is proved that deciding irreducibility (indecomposability) of FSRs is <b>NP</b>-hard. Additionally, FSRs are constructed to show that there exist infinitely many irreducible (resp. indecomposable) FSRs which are decomposable (resp. reducible).</p>\u0000 </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/3219604","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
IET Information 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