首页 > 最新文献

Journal of Systems Architecture最新文献

英文 中文
RUnQuant: High-resolution weight quantization via unanchored weight decomposition in column-wise granularity for CIM accelerators RUnQuant:通过对CIM加速器按列粒度进行无锚定权重分解,实现高分辨率权重量化
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-04 DOI: 10.1016/j.sysarc.2026.103703
Jiyoon Kim , Kang Eun Jeon , Yulhwa Kim , Jong Hwan Ko
Compute-in-memory (CIM) enables efficient deep neural network (DNN) implementation, but suffers from area and energy overhead from analog-to-digital converters (ADCs) and crossbar arrays of limited cell precisions. Low-precision ADCs mitigate these overheads, but introduce partial-sum quantization errors, degrading accuracy. Cell precision limitations impose low-bit weight constraints that further challenge network accuracy. Although prior work has focused on fine-grained partial-sum quantization to reduce ADC resolution, weight granularity remains underexplored, which is crucial for achieving high accuracy. Utilizing low-precision cells, weight decomposition is commonly employed to represent signed weights, but conventional zero-anchored schemes restrict resolution. We address these issues by integrating unanchored weight decomposition with column-wise alignment of weight and partial-sum quantization. Our method improves accuracy while maintaining dequantization overhead, simplifies training by removing two-stage processes, and maximizes representable weight quantization levels. We also introduce an open-source CIM-oriented convolution framework that manages fine-grained weights and partial-sums through novel tiling and group convolution. Experimental results demonstrate accuracy improvements up to 4.05% in comparison with state-of-the-art methods, highlighting the effectiveness of our quantization scheme in enhancing accuracy while maintaining hardware efficiency in CIM accelerators. Our code is available at https://github.com/jiyoonkm/ColumnQuant.
内存计算(CIM)能够实现高效的深度神经网络(DNN),但受到模数转换器(adc)和有限单元精度的交叉棒阵列的面积和能量开销的影响。低精度adc减轻了这些开销,但引入了部分和量化误差,降低了精度。小区精度限制施加了低比特权重约束,进一步挑战了网络精度。虽然之前的工作主要集中在细粒度的部分和量化上,以降低ADC分辨率,但权重粒度仍然没有得到充分的探索,这对于实现高精度至关重要。利用低精度单元,权重分解通常用于表示带符号的权重,但传统的零锚定方案限制了分辨率。我们通过将非锚定权重分解与权重的列对齐和部分和量化相结合来解决这些问题。我们的方法在保持去量化开销的同时提高了准确性,通过消除两阶段过程简化了训练,并最大限度地提高了可表示的权重量化水平。我们还介绍了一个开源的面向cim的卷积框架,该框架通过新颖的平铺和群卷积来管理细粒度的权重和部分和。实验结果表明,与最先进的方法相比,该方法的精度提高了4.05%,突出了我们的量化方案在保持CIM加速器硬件效率的同时提高精度的有效性。我们的代码可在https://github.com/jiyoonkm/ColumnQuant上获得。
{"title":"RUnQuant: High-resolution weight quantization via unanchored weight decomposition in column-wise granularity for CIM accelerators","authors":"Jiyoon Kim ,&nbsp;Kang Eun Jeon ,&nbsp;Yulhwa Kim ,&nbsp;Jong Hwan Ko","doi":"10.1016/j.sysarc.2026.103703","DOIUrl":"10.1016/j.sysarc.2026.103703","url":null,"abstract":"<div><div>Compute-in-memory (CIM) enables efficient deep neural network (DNN) implementation, but suffers from area and energy overhead from analog-to-digital converters (ADCs) and crossbar arrays of limited cell precisions. Low-precision ADCs mitigate these overheads, but introduce partial-sum quantization errors, degrading accuracy. Cell precision limitations impose low-bit weight constraints that further challenge network accuracy. Although prior work has focused on fine-grained partial-sum quantization to reduce ADC resolution, weight granularity remains underexplored, which is crucial for achieving high accuracy. Utilizing low-precision cells, weight decomposition is commonly employed to represent signed weights, but conventional zero-anchored schemes restrict resolution. We address these issues by integrating unanchored weight decomposition with column-wise alignment of weight and partial-sum quantization. Our method improves accuracy while maintaining dequantization overhead, simplifies training by removing two-stage processes, and maximizes representable weight quantization levels. We also introduce an open-source CIM-oriented convolution framework that manages fine-grained weights and partial-sums through novel tiling and group convolution. Experimental results demonstrate accuracy improvements up to 4.05% in comparison with state-of-the-art methods, highlighting the effectiveness of our quantization scheme in enhancing accuracy while maintaining hardware efficiency in CIM accelerators. Our code is available at <span><span>https://github.com/jiyoonkm/ColumnQuant</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103703"},"PeriodicalIF":4.1,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Formal semantics for hierarchical Simulink diagrams in Isabelle/HOL Isabelle/HOL中分层Simulink图的形式语义
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-04 DOI: 10.1016/j.sysarc.2026.103724
Yuzhen Qi , Shuling Wang , Xing Li , Bohua Zhan , Naijun Zhan
Simulink is widely used in the design of safety-critical embedded systems, including avionics and automotive applications. While it offers simulation for model validation, formal verification remains essential to rigorously ensure system correctness. Existing approaches often translate Simulink diagrams into third-party formal models, however, the lack of a rigorously defined semantics for Simulink can lead to inconsistencies between the original diagrams and their translated formal counterparts. In this paper, we present a formal semantic foundation for a core subset of Simulink by defining both denotational and operational semantics. The denotational semantics offers a mathematical interpretation of the diagram’s input–output behavior, faithfully capturing its hierarchical structure. In contrast, the operational semantics specifies the concrete execution of Simulink diagrams, resolving block execution order, solving continuous dynamics, and coordinating hybrid discrete-continuous interactions. Both semantics have been fully formalized in Isabelle/HOL, and we have established their consistency by proving the existence and uniqueness of the timed state trajectories defined by the denotational semantics. Furthermore, to facilitate application, we developed a translator that automatically converts Simulink graphical diagrams into their Isabelle representation. Our formal semantics supports the rigorous analysis of Simulink diagram properties, as demonstrated through a PID control example. The semantics also establishes a foundation for validating simulation results and ensuring consistency between Simulink models and other formal models, thus enabling sound verification.
Simulink广泛用于安全关键型嵌入式系统的设计,包括航空电子设备和汽车应用。虽然它为模型验证提供了模拟,但形式验证仍然是严格确保系统正确性的必要条件。现有的方法经常将Simulink图转换为第三方的形式化模型,然而,缺乏严格定义的Simulink语义会导致原始图与其翻译的形式化对应图之间的不一致。在本文中,我们通过定义表意语义和操作语义为Simulink的核心子集提供了一个形式化的语义基础。指称语义提供了图的输入-输出行为的数学解释,忠实地捕获了它的层次结构。相比之下,操作语义指定了Simulink图的具体执行,解决块执行顺序,解决连续动力学,协调混合离散-连续交互。这两种语义在Isabelle/HOL中都得到了充分的形式化,我们通过证明由指称语义定义的时间状态轨迹的存在性和唯一性,建立了它们的一致性。此外,为了方便应用程序,我们开发了一个转换器,可以自动将Simulink图形图表转换为它们的Isabelle表示。我们的形式化语义支持对Simulink图属性的严格分析,如PID控制示例所示。语义还为验证仿真结果和确保Simulink模型与其他正式模型之间的一致性建立了基础,从而实现了可靠的验证。
{"title":"Formal semantics for hierarchical Simulink diagrams in Isabelle/HOL","authors":"Yuzhen Qi ,&nbsp;Shuling Wang ,&nbsp;Xing Li ,&nbsp;Bohua Zhan ,&nbsp;Naijun Zhan","doi":"10.1016/j.sysarc.2026.103724","DOIUrl":"10.1016/j.sysarc.2026.103724","url":null,"abstract":"<div><div>Simulink is widely used in the design of safety-critical embedded systems, including avionics and automotive applications. While it offers simulation for model validation, formal verification remains essential to rigorously ensure system correctness. Existing approaches often translate Simulink diagrams into third-party formal models, however, the lack of a rigorously defined semantics for Simulink can lead to inconsistencies between the original diagrams and their translated formal counterparts. In this paper, we present a formal semantic foundation for a core subset of Simulink by defining both denotational and operational semantics. The denotational semantics offers a mathematical interpretation of the diagram’s input–output behavior, faithfully capturing its hierarchical structure. In contrast, the operational semantics specifies the concrete execution of Simulink diagrams, resolving block execution order, solving continuous dynamics, and coordinating hybrid discrete-continuous interactions. Both semantics have been fully formalized in Isabelle/HOL, and we have established their consistency by proving the existence and uniqueness of the timed state trajectories defined by the denotational semantics. Furthermore, to facilitate application, we developed a translator that automatically converts Simulink graphical diagrams into their Isabelle representation. Our formal semantics supports the rigorous analysis of Simulink diagram properties, as demonstrated through a PID control example. The semantics also establishes a foundation for validating simulation results and ensuring consistency between Simulink models and other formal models, thus enabling sound verification.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103724"},"PeriodicalIF":4.1,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Series–parallel-loop decompositions of control-flow graphs 控制流图的串联-并行-循环分解
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-03 DOI: 10.1016/j.sysarc.2026.103732
Xuran Cai , Amir Kafshdar Goharshady , S. Hitarth , Chun Kit Lam
Control-flow graphs (CFGs) of structured programs are well known to exhibit strong sparsity properties. Traditionally, this sparsity has been modeled using graph parameters such as treewidth and pathwidth, enabling the development of faster parameterized algorithms for tasks in compiler optimization, model checking, and program analysis. However, these parameters only approximate the structural constraints of CFGs: although every structured CFG has treewidth at most 7, many graphs with treewidth at most 7 cannot arise as CFGs. As a result, existing parameterized techniques are optimized for a substantially broader class of graphs than those encountered in practice.
In this work, we introduce a new grammar-based decomposition framework that characterizes exactly the class of control-flow graphs generated by structured programs. Our decomposition is intuitive, mirrors the syntactic structure of programs, and remains fully compatible with the dynamic-programming paradigm of treewidth-based methods. Using this framework, we design improved algorithms for two classical compiler optimization problems: Register Allocation and Lifetime-Optimal Speculative Partial Redundancy Elimination (LOSPRE). Extensive experimental evaluation demonstrates significant performance improvements over previous state-of-the-art approaches, highlighting the benefits of using decompositions tailored specifically to CFGs.
众所周知,结构化程序的控制流图(CFGs)具有很强的稀疏性。传统上,这种稀疏性是使用图参数(如treewidth和pathwidth)建模的,从而可以为编译器优化、模型检查和程序分析中的任务开发更快的参数化算法。然而,这些参数只是近似CFG的结构约束:尽管每个结构化CFG的树宽最多为7,但许多树宽最多为7的图不能作为CFG出现。因此,现有的参数化技术比在实践中遇到的更广泛的图类进行了优化。在这项工作中,我们引入了一个新的基于语法的分解框架,该框架精确地描述了结构化程序生成的控制流图的类别。我们的分解是直观的,反映了程序的语法结构,并且与基于树宽度的方法的动态规划范例保持完全兼容。利用该框架,我们设计了两个经典编译器优化问题的改进算法:寄存器分配和生命周期最优推测部分冗余消除(LOSPRE)。大量的实验评估表明,与以前最先进的方法相比,性能有了显著提高,突出了使用专门针对CFGs的分解方法的好处。
{"title":"Series–parallel-loop decompositions of control-flow graphs","authors":"Xuran Cai ,&nbsp;Amir Kafshdar Goharshady ,&nbsp;S. Hitarth ,&nbsp;Chun Kit Lam","doi":"10.1016/j.sysarc.2026.103732","DOIUrl":"10.1016/j.sysarc.2026.103732","url":null,"abstract":"<div><div>Control-flow graphs (CFGs) of structured programs are well known to exhibit strong sparsity properties. Traditionally, this sparsity has been modeled using graph parameters such as treewidth and pathwidth, enabling the development of faster parameterized algorithms for tasks in compiler optimization, model checking, and program analysis. However, these parameters only approximate the structural constraints of CFGs: although every structured CFG has treewidth at most 7, many graphs with treewidth at most 7 cannot arise as CFGs. As a result, existing parameterized techniques are optimized for a substantially broader class of graphs than those encountered in practice.</div><div>In this work, we introduce a new grammar-based decomposition framework that characterizes <em>exactly</em> the class of control-flow graphs generated by structured programs. Our decomposition is intuitive, mirrors the syntactic structure of programs, and remains fully compatible with the dynamic-programming paradigm of treewidth-based methods. Using this framework, we design improved algorithms for two classical compiler optimization problems: <em>Register Allocation</em> and <em>Lifetime-Optimal Speculative Partial Redundancy Elimination (LOSPRE)</em>. Extensive experimental evaluation demonstrates significant performance improvements over previous state-of-the-art approaches, highlighting the benefits of using decompositions tailored specifically to CFGs.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103732"},"PeriodicalIF":4.1,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CXL shared coherent memory simulation and cross-host synchronization mechanisms design for data sharing CXL共享一致内存模拟和跨主机同步机制设计,用于数据共享
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-03 DOI: 10.1016/j.sysarc.2026.103723
Ting Wu , Qingyuan Song , Xihong Huang , Linbo Long , Zhulin Ma , Weichen Liu
Compute Express Link (CXL) is an emerging interconnect standard for connecting CPU, memory, and devices. A key advancement in CXL 3.x is the introduction of shared coherent memory among multiple hosts, enabling low-latency data sharing and synchronization through load-store operations. However, CXL 3.x remains at an early stage and currently lacks commodity products. Existing simulation studies primarily focus on memory expansion devices without supporting shared coherent memory among multiple hosts. In this paper, we simulate the CXL shared coherent memory with cross-host synchronization mechanisms for data sharing among multiple hosts. The proposed simulation models the functional behavior of shared coherent memory by implementing shared memory among co-resident virtual machines, abstracting low-level hardware coherence transactions. Based on the simulated shared memory, two synchronization mechanisms, including shared spin_locks and semaphores, are designed to support concurrent access across hosts in both kernel and user space, respectively. Two use cases, data sharing and file sharing, are implemented to demonstrate the efficiency of inter-host communication via the simulated shared memory. Experimental results show that data sharing via the simulated shared memory is 202.8 and 41.5 times faster than LAN and VirtIO, respectively. The average file-sharing throughput of SPMFS-Remote is 108.1 and 22.4 times higher than that of Samba-LAN and Samba-VirtIO, respectively. Moreover, SPMFS-Remote achieves 82.8% of the average throughput of SPMFS-Local. While the simulation abstracts certain hardware-level coherence details and uses remote NUMA memory as the shared device, it captures the function and approximate latency of CXL shared coherent memory.
CXL (Compute Express Link)是一种新兴的CPU、内存和设备互连标准。cxl3的一个关键改进。X是在多个主机之间引入共享一致内存,通过负载存储操作实现低延迟数据共享和同步。但是,cxl3。X仍处于早期阶段,目前缺乏商品产品。现有的仿真研究主要集中在不支持多主机间共享相干内存的内存扩展设备上。本文采用跨主机同步机制模拟了CXL共享一致内存,实现了多主机间的数据共享。该仿真通过在共同驻留的虚拟机之间实现共享内存,抽象底层硬件一致性事务来模拟共享一致性内存的功能行为。基于模拟的共享内存,设计了两种同步机制,包括共享spin_locks和信号量,分别在内核和用户空间支持跨主机的并发访问。通过数据共享和文件共享两个用例,演示了通过模拟共享内存实现主机间通信的效率。实验结果表明,通过模拟共享内存进行数据共享的速度分别比LAN和VirtIO快202.8倍和41.5倍。SPMFS-Remote的平均文件共享吞吐量分别是Samba-LAN和Samba-VirtIO的108.1倍和22.4倍。此外,SPMFS-Remote的平均吞吐量是SPMFS-Local的82.8%。虽然仿真抽象了某些硬件级相干细节,并使用远程NUMA内存作为共享设备,但它捕获了CXL共享相干内存的功能和近似延迟。
{"title":"CXL shared coherent memory simulation and cross-host synchronization mechanisms design for data sharing","authors":"Ting Wu ,&nbsp;Qingyuan Song ,&nbsp;Xihong Huang ,&nbsp;Linbo Long ,&nbsp;Zhulin Ma ,&nbsp;Weichen Liu","doi":"10.1016/j.sysarc.2026.103723","DOIUrl":"10.1016/j.sysarc.2026.103723","url":null,"abstract":"<div><div>Compute Express Link (CXL) is an emerging interconnect standard for connecting CPU, memory, and devices. A key advancement in CXL 3.x is the introduction of shared coherent memory among multiple hosts, enabling low-latency data sharing and synchronization through load-store operations. However, CXL 3.x remains at an early stage and currently lacks commodity products. Existing simulation studies primarily focus on memory expansion devices without supporting shared coherent memory among multiple hosts. In this paper, we simulate the CXL shared coherent memory with cross-host synchronization mechanisms for data sharing among multiple hosts. The proposed simulation models the functional behavior of shared coherent memory by implementing shared memory among co-resident virtual machines, abstracting low-level hardware coherence transactions. Based on the simulated shared memory, two synchronization mechanisms, including shared spin_locks and semaphores, are designed to support concurrent access across hosts in both kernel and user space, respectively. Two use cases, data sharing and file sharing, are implemented to demonstrate the efficiency of inter-host communication via the simulated shared memory. Experimental results show that data sharing via the simulated shared memory is 202.8 and 41.5 times faster than LAN and VirtIO, respectively. The average file-sharing throughput of SPMFS-Remote is 108.1 and 22.4 times higher than that of Samba-LAN and Samba-VirtIO, respectively. Moreover, SPMFS-Remote achieves 82.8% of the average throughput of SPMFS-Local. While the simulation abstracts certain hardware-level coherence details and uses remote NUMA memory as the shared device, it captures the function and approximate latency of CXL shared coherent memory.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103723"},"PeriodicalIF":4.1,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distilling knowledge for low-energy AIoT 为低能量AIoT提炼知识
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-02 DOI: 10.1016/j.sysarc.2026.103692
Franca Rocco di Torrepadula, Vincenzo Maisto, Alessandro Cilardo, Nicola Mazzocca
The Artificial Intelligence of Things (AIoT) empowers IoT devices to leverage the advantages of AI near data-sources, reducing data movement, latency, and mitigating privacy issues. However, AI workloads are notoriously energy-intensive, posing significant challenges for energy-constrained IoT devices. Since such devices are often deployed in thousands of instances, even minor inefficiencies can significantly increase carbon emissions and energy consumptions. Model compression techniques have been employed to enable AI inference in resource-constrained environments. For example, Knowledge Distillation (KD) is an elaborate approach targeting low-footprint and high-accuracy models, although introducing further complexity during training due to inefficient grid searches of additional hyperparameters. The emerging wave of AIoT, however, calls for prioritizing energy-awareness both in inference and training. To address this shortcoming, this work proposes a three-stage design workflow for low-energy AIoT applications, driven primarily by an input energy budget characterizing the target IoT scenario. Given a specific CNN architecture and IoT platform, our workflow identifies the most effective student under the imposed energy constrained and derives an efficient configuration of the KD hyperparameters that maximizes student accuracy, while avoiding inefficient and expensive grid-search. Hence, this approach enable energy-efficient CNN inference while substantially reducing overall training costs. We validate our workflow with a systematic experimental campaign using ResNets and DenseNets on CIFAR-10, CIFAR-100,and Tiny Imagenet datasets, on an AMD Xilinx Zynq Ultrascale+ ZCU102 MPSoC. Our proposal maintains high accuracy while lowering energy consumption by up to 80%, highlighting the potential of our flow for real-world AIoT applications.
物联网人工智能(AIoT)使物联网设备能够利用人工智能在数据源附近的优势,减少数据移动、延迟并减轻隐私问题。然而,人工智能工作负载是出了名的能源密集型,对能源受限的物联网设备构成了重大挑战。由于此类设备通常部署在数千个实例中,因此即使是很小的效率低下也会显著增加碳排放和能源消耗。模型压缩技术已被用于在资源受限的环境中实现人工智能推理。例如,知识蒸馏(Knowledge Distillation, KD)是一种针对低占用空间和高精度模型的精细方法,但由于对额外超参数的网格搜索效率低下,在训练过程中引入了进一步的复杂性。然而,正在兴起的AIoT浪潮要求在推理和训练中优先考虑能源意识。为了解决这一缺点,本工作提出了一个低能耗AIoT应用的三阶段设计工作流,主要由目标物联网场景的输入能量预算驱动。给定特定的CNN架构和物联网平台,我们的工作流程在施加的能量约束下识别最有效的学生,并推导出KD超参数的有效配置,从而最大限度地提高学生的准确性,同时避免低效和昂贵的网格搜索。因此,该方法在大大降低总体训练成本的同时实现了高效的CNN推理。我们在AMD Xilinx Zynq Ultrascale+ ZCU102 MPSoC上,在CIFAR-10、CIFAR-100和Tiny Imagenet数据集上使用ResNets和DenseNets进行了系统的实验活动,验证了我们的工作流程。我们的方案保持了高精度,同时降低了高达80%的能耗,突出了我们的流程在实际AIoT应用中的潜力。
{"title":"Distilling knowledge for low-energy AIoT","authors":"Franca Rocco di Torrepadula,&nbsp;Vincenzo Maisto,&nbsp;Alessandro Cilardo,&nbsp;Nicola Mazzocca","doi":"10.1016/j.sysarc.2026.103692","DOIUrl":"10.1016/j.sysarc.2026.103692","url":null,"abstract":"<div><div>The Artificial Intelligence of Things (AIoT) empowers IoT devices to leverage the advantages of AI near data-sources, reducing data movement, latency, and mitigating privacy issues. However, AI workloads are notoriously energy-intensive, posing significant challenges for energy-constrained IoT devices. Since such devices are often deployed in thousands of instances, even minor inefficiencies can significantly increase carbon emissions and energy consumptions. Model compression techniques have been employed to enable AI inference in resource-constrained environments. For example, Knowledge Distillation (KD) is an elaborate approach targeting low-footprint and high-accuracy models, although introducing further complexity during training due to inefficient grid searches of additional hyperparameters. The emerging wave of AIoT, however, calls for prioritizing energy-awareness both in inference and training. To address this shortcoming, this work proposes a three-stage design workflow for low-energy AIoT applications, driven primarily by an input energy budget characterizing the target IoT scenario. Given a specific CNN architecture and IoT platform, our workflow identifies the most effective student under the imposed energy constrained and derives an efficient configuration of the KD hyperparameters that maximizes student accuracy, while avoiding inefficient and expensive grid-search. Hence, this approach enable energy-efficient CNN inference while substantially reducing overall training costs. We validate our workflow with a systematic experimental campaign using ResNets and DenseNets on CIFAR-10, CIFAR-100,and Tiny Imagenet datasets, on an AMD Xilinx Zynq Ultrascale+ ZCU102 MPSoC. Our proposal maintains high accuracy while lowering energy consumption by up to 80%, highlighting the potential of our flow for real-world AIoT applications.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103692"},"PeriodicalIF":4.1,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Formal design of safety-critical systems with MARS MARS安全关键系统的正式设计
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-30 DOI: 10.1016/j.sysarc.2026.103711
Yihao Yin , Hao Wu , Wan Liu , Shuling Wang , Xiong Xu , Wang Lin , Fanjiang Xu , Naijun Zhan
MARS is a toolchain, supporting model-based design of cyber–physical systems (CPS), which integrates informal and formal design. With MARS, a system under development can be graphically modeled by the combination of AADL and Simulink/Stateflow, then the analysis of the graphical model can be conducted via simulation. Furthermore, the graphical model can be automatically transformed to Hybrid Communicating Sequential Processes (HCSP) for formal verification with HHLProver. Within HHLProver, both interactive and automated theorem proving of HCSP processes are supported, with the help of an invariant generator, which is used for automated synthesis of differential invariants of ordinary differential equations based on both numerical methods and neural networks. Finally, ANSI-C code or SystemC code can be generated from the verified HCSP formal model with the guarantee of correctness. As a case study of CPS, this paper applies the MARS toolchain to the design of an intelligent temperature control system, including its modeling, simulation, verification and code generation. This case study demonstrates the advantages of the design of CPS with MARS, including the integration of modeling, simulation, verification and code generation; the integration of informal and formal design, thus providing balance between efficiency and rigidity and enabling a correct-by-construction design flow.
MARS是一个工具链,支持基于模型的网络物理系统(CPS)设计,它集成了非正式和正式设计。利用MARS,可以将AADL和Simulink/Stateflow相结合,对正在开发的系统进行图形化建模,然后通过仿真对图形化模型进行分析。此外,图形模型可以自动转换为混合通信顺序过程(HCSP),并通过hlprover进行形式化验证。在hlprover中,支持HCSP过程的交互式和自动定理证明,并借助一个不变量生成器,该生成器用于基于数值方法和神经网络的常微分方程微分不变量的自动合成。最后,在保证正确性的前提下,通过验证的HCSP形式化模型生成ANSI-C代码或SystemC代码。本文以CPS为例,将MARS工具链应用于智能温控系统的设计,包括建模、仿真、验证和代码生成。本案例研究展示了利用MARS设计CPS的优势,包括建模、仿真、验证和代码生成的集成;非正式和正式设计的整合,从而提供了效率和刚性之间的平衡,并实现了正确的建筑设计流程。
{"title":"Formal design of safety-critical systems with MARS","authors":"Yihao Yin ,&nbsp;Hao Wu ,&nbsp;Wan Liu ,&nbsp;Shuling Wang ,&nbsp;Xiong Xu ,&nbsp;Wang Lin ,&nbsp;Fanjiang Xu ,&nbsp;Naijun Zhan","doi":"10.1016/j.sysarc.2026.103711","DOIUrl":"10.1016/j.sysarc.2026.103711","url":null,"abstract":"<div><div>MARS is a toolchain, supporting model-based design of cyber–physical systems (CPS), which integrates informal and formal design. With MARS, a system under development can be graphically modeled by the combination of AADL and Simulink/Stateflow, then the analysis of the graphical model can be conducted via simulation. Furthermore, the graphical model can be automatically transformed to Hybrid Communicating Sequential Processes (HCSP) for formal verification with HHLProver. Within HHLProver, both interactive and automated theorem proving of HCSP processes are supported, with the help of an invariant generator, which is used for automated synthesis of differential invariants of ordinary differential equations based on both numerical methods and neural networks. Finally, ANSI-C code or SystemC code can be generated from the verified HCSP formal model with the guarantee of correctness. As a case study of CPS, this paper applies the MARS toolchain to the design of an intelligent temperature control system, including its modeling, simulation, verification and code generation. This case study demonstrates the advantages of the design of CPS with MARS, including the integration of modeling, simulation, verification and code generation; the integration of informal and formal design, thus providing balance between efficiency and rigidity and enabling a <strong>correct-by-construction</strong> design flow.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103711"},"PeriodicalIF":4.1,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Post quantum secure and efficient data sharing scheme from attribute based encryption for VANETs over lattices 基于属性加密的栅格VANETs后量子安全高效数据共享方案
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-29 DOI: 10.1016/j.sysarc.2026.103718
Fenghe Wang, Meijiao Wang, Junquan Wang, Mengqi Gu
Data sharing plays a significant role for C2V communication in VANETs. To achieve the data confidentiality, access control, data authentication and efficiency in data sharing simultaneously, this paper proposes a post quantum secure and efficient data sharing scheme by designing an attribute-based encryption (ABE) over lattices for VANETs. The proposed scheme is secure under the selective attribute and chosen-plaintexts attack (IND-sAtt-CPA) and the security is proven under the hardness of the Learning With Errors (LWE) problem in the random oracle model. Thanks to the characters of the ABE concept which is the design foundation of the proposed scheme, we also achieve the fine-grained access control of the sharing data in this paper. Furthermore, the signature of the shared ciphertext is also generated before the data is shared. Hence the proposed scheme can efficiently resist several normal network attacks such as replay attack and impersonation attack etc. The space and computation analysis of the proposed scheme show that the proposed data sharing scheme is with shorter ciphertext length and lower encryption/decryption costs which have been checked by using Java language on a personal computer with Intel (R) Core (TM) i9-14900HX processor (2.20 GHz) and 32GB RAM. At last, using NS3 software, a network simulation is given to verify the communication effects. Simulation results show that the response latency of the proposed scheme is lower than that of several known ABE schemes in VANETs. And the average message loss rate of the proposed scheme is also controlled within an acceptable interval (much less than 5%) even in high-intensity communication scenarios.
在VANETs中,数据共享对C2V通信起着重要的作用。为了在数据共享中同时实现数据保密性、访问控制、数据认证和效率,本文提出了一种后量子安全、高效的数据共享方案,通过对VANETs设计基于格的属性加密(ABE)。该方案在选择性属性和选择明文攻击(ind - sat - cpa)下是安全的,并在随机oracle模型中的有错误学习(LWE)问题的困难下证明了该方案的安全性。本文还利用ABE概念的特点,实现了对共享数据的细粒度访问控制。ABE概念是本方案的设计基础。此外,在数据共享之前,还会生成共享密文的签名。因此,该方案能够有效抵御几种常见的网络攻击,如重放攻击和冒充攻击等。对所提方案的空间和计算分析表明,所提数据共享方案具有较短的密文长度和较低的加解密成本,并在Intel (R) Core (TM) i9-14900HX处理器(2.20 GHz)和32GB RAM的个人计算机上使用Java语言进行了验证。最后,利用NS3软件进行了网络仿真,验证了通信效果。仿真结果表明,该方案的响应延迟低于几种已知的VANETs中ABE方案的响应延迟。即使在高强度通信场景下,所提方案的平均消息丢失率也被控制在可接受的间隔内(远小于5%)。
{"title":"Post quantum secure and efficient data sharing scheme from attribute based encryption for VANETs over lattices","authors":"Fenghe Wang,&nbsp;Meijiao Wang,&nbsp;Junquan Wang,&nbsp;Mengqi Gu","doi":"10.1016/j.sysarc.2026.103718","DOIUrl":"10.1016/j.sysarc.2026.103718","url":null,"abstract":"<div><div>Data sharing plays a significant role for C2V communication in VANETs. To achieve the data confidentiality, access control, data authentication and efficiency in data sharing simultaneously, this paper proposes a post quantum secure and efficient data sharing scheme by designing an attribute-based encryption (ABE) over lattices for VANETs. The proposed scheme is secure under the selective attribute and chosen-plaintexts attack (IND-sAtt-CPA) and the security is proven under the hardness of the Learning With Errors (LWE) problem in the random oracle model. Thanks to the characters of the ABE concept which is the design foundation of the proposed scheme, we also achieve the fine-grained access control of the sharing data in this paper. Furthermore, the signature of the shared ciphertext is also generated before the data is shared. Hence the proposed scheme can efficiently resist several normal network attacks such as replay attack and impersonation attack etc. The space and computation analysis of the proposed scheme show that the proposed data sharing scheme is with shorter ciphertext length and lower encryption/decryption costs which have been checked by using Java language on a personal computer with Intel (R) Core (TM) i9-14900HX processor (2.20 GHz) and 32GB RAM. At last, using NS3 software, a network simulation is given to verify the communication effects. Simulation results show that the response latency of the proposed scheme is lower than that of several known ABE schemes in VANETs. And the average message loss rate of the proposed scheme is also controlled within an acceptable interval (much less than 5%) even in high-intensity communication scenarios.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"174 ","pages":"Article 103718"},"PeriodicalIF":4.1,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146098574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data poisoning-based backdoor attacks against supervised learning rules of Spiking Neural Networks 基于数据中毒的脉冲神经网络监督学习规则后门攻击
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-29 DOI: 10.1016/j.sysarc.2026.103731
Lingxin Jin , Wei Jiang , Jinyu Zhan , Meiyu Lin , Letian Chen , Boran Quan , Lin Zuo , Xingzhi Zhou , Maregu Assefa Habtie , Naoufel Werghi
Spiking Neural Networks (SNNs), known as the third generation neural networks, are developing rapidly and can compete with Artificial Neural Networks (ANNs) in many fields. However, the training environment of SNNs is similar to that of ANNs, which are highly dependent on open-source datasets, pre-trained models, and intelligent service platforms. Therefore, SNNs exposed to such an unregulated training environment are extremely vulnerable to backdoor attacks. Motivated by this, we investigate the feasibility of backdoor attacks on different supervised learning rules of SNNs and propose a universal attack framework based on data poisoning. The malicious operations only target the learnable stages in each learning rule, which rely on a data-driven method to inject backdoor information. Furthermore, we extended the backbone of the testing SNNs from a single-layer structure to deeper structures. Extensive experiments are conducted to evaluate the effectiveness of the attack framework, robustness, and backdoor migration phenomenon in SNN learning rules. Finally, we discuss potential countermeasures against backdoor attacks, corresponding technical challenges, and possible solutions.
脉冲神经网络(SNNs)被称为第三代神经网络,发展迅速,在许多领域可以与人工神经网络(ann)相抗衡。然而,snn的训练环境与人工神经网络相似,高度依赖于开源数据集、预训练模型和智能服务平台。因此,暴露在这种不受监管的训练环境中的snn极易受到后门攻击。基于此,我们研究了snn不同监督学习规则下后门攻击的可行性,提出了一种基于数据中毒的通用攻击框架。恶意操作只针对每条学习规则中的可学习阶段,依赖数据驱动的方法注入后门信息。此外,我们将测试snn的骨干从单层结构扩展到更深的结构。进行了大量的实验来评估攻击框架的有效性、鲁棒性和SNN学习规则中的后门迁移现象。最后,我们讨论了针对后门攻击的潜在对策、相应的技术挑战和可能的解决方案。
{"title":"Data poisoning-based backdoor attacks against supervised learning rules of Spiking Neural Networks","authors":"Lingxin Jin ,&nbsp;Wei Jiang ,&nbsp;Jinyu Zhan ,&nbsp;Meiyu Lin ,&nbsp;Letian Chen ,&nbsp;Boran Quan ,&nbsp;Lin Zuo ,&nbsp;Xingzhi Zhou ,&nbsp;Maregu Assefa Habtie ,&nbsp;Naoufel Werghi","doi":"10.1016/j.sysarc.2026.103731","DOIUrl":"10.1016/j.sysarc.2026.103731","url":null,"abstract":"<div><div>Spiking Neural Networks (SNNs), known as the third generation neural networks, are developing rapidly and can compete with Artificial Neural Networks (ANNs) in many fields. However, the training environment of SNNs is similar to that of ANNs, which are highly dependent on open-source datasets, pre-trained models, and intelligent service platforms. Therefore, SNNs exposed to such an unregulated training environment are extremely vulnerable to backdoor attacks. Motivated by this, we investigate the feasibility of backdoor attacks on different supervised learning rules of SNNs and propose a universal attack framework based on data poisoning. The malicious operations only target the learnable stages in each learning rule, which rely on a data-driven method to inject backdoor information. Furthermore, we extended the backbone of the testing SNNs from a single-layer structure to deeper structures. Extensive experiments are conducted to evaluate the effectiveness of the attack framework, robustness, and backdoor migration phenomenon in SNN learning rules. Finally, we discuss potential countermeasures against backdoor attacks, corresponding technical challenges, and possible solutions.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"173 ","pages":"Article 103731"},"PeriodicalIF":4.1,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact constrained-training neural networks for confidential 8-bit arithmetic primitives in code obfuscation 代码混淆中机密8位算术原语的精确约束训练神经网络
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-29 DOI: 10.1016/j.sysarc.2026.103729
Ning Shi , Lei Xu , Tianqing Zhu , WanLei Zhou , Weizhi Meng , Yu-an Tan
Neural networks are rarely utilized for exact arithmetic computations. However, we aim to leverage them as accurate computing units in code obfuscation scenarios. The effectiveness of traditional code obfuscation methods is increasingly compromised by advanced reverse-engineering tools, which exploit the semantic transparency of arithmetic operations. To address this, we propose constrained-training neural networks tailored to 8-bit integer addition and multiplication, the most common operations in security-critical software. For addition, we introduce a constrained training algorithm that integrates weight clipping, linearity-enforcing loss terms, and boundary-case oversampling, enabling convergence to 100% accuracy across the entire domain. For multiplication, we design the adaptive symbol-gated NALU (ASG-NALU), an improved 4-bit multiplier that achieves exact results with reduced complexity. Combined with a cascade decomposition strategy, it extends to 8-bit multiplication with guaranteed correctness. Experiments confirm 100% in-domain accuracy, while out-of-domain inputs trigger catastrophic failures that act as natural traps, providing hidden security checks against dynamic analysis. These results establish exact constrained-training neural networks as confidential arithmetic primitives and firmly position neural arithmetic as a promising approach for advancing code obfuscation techniques.
神经网络很少用于精确的算术计算。然而,我们的目标是利用它们作为代码混淆场景中的精确计算单元。传统代码混淆方法的有效性越来越受到先进的逆向工程工具的影响,这些工具利用了算术运算的语义透明性。为了解决这个问题,我们提出了针对8位整数加法和乘法的约束训练神经网络,这是安全关键软件中最常见的操作。此外,我们引入了一种约束训练算法,该算法集成了权重裁剪、线性强化损失项和边界情况过采样,使整个域的收敛精度达到100%。对于乘法,我们设计了自适应符号门控NALU (ASG-NALU),这是一种改进的4位乘法器,可以在降低复杂度的情况下获得精确的结果。结合级联分解策略,它扩展到具有保证正确性的8位乘法。实验证实了100%的域内准确性,而域外输入触发灾难性故障,充当自然陷阱,为动态分析提供隐藏的安全检查。这些结果建立了精确的约束训练神经网络作为机密的算术原语,并坚定地将神经算法作为一种有前途的方法来推进代码混淆技术。
{"title":"Exact constrained-training neural networks for confidential 8-bit arithmetic primitives in code obfuscation","authors":"Ning Shi ,&nbsp;Lei Xu ,&nbsp;Tianqing Zhu ,&nbsp;WanLei Zhou ,&nbsp;Weizhi Meng ,&nbsp;Yu-an Tan","doi":"10.1016/j.sysarc.2026.103729","DOIUrl":"10.1016/j.sysarc.2026.103729","url":null,"abstract":"<div><div>Neural networks are rarely utilized for exact arithmetic computations. However, we aim to leverage them as accurate computing units in code obfuscation scenarios. The effectiveness of traditional code obfuscation methods is increasingly compromised by advanced reverse-engineering tools, which exploit the semantic transparency of arithmetic operations. To address this, we propose constrained-training neural networks tailored to 8-bit integer addition and multiplication, the most common operations in security-critical software. For addition, we introduce a constrained training algorithm that integrates weight clipping, linearity-enforcing loss terms, and boundary-case oversampling, enabling convergence to 100% accuracy across the entire domain. For multiplication, we design the adaptive symbol-gated NALU (ASG-NALU), an improved 4-bit multiplier that achieves exact results with reduced complexity. Combined with a cascade decomposition strategy, it extends to 8-bit multiplication with guaranteed correctness. Experiments confirm 100% in-domain accuracy, while out-of-domain inputs trigger catastrophic failures that act as natural traps, providing hidden security checks against dynamic analysis. These results establish exact constrained-training neural networks as confidential arithmetic primitives and firmly position neural arithmetic as a promising approach for advancing code obfuscation techniques.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"173 ","pages":"Article 103729"},"PeriodicalIF":4.1,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146090353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CAAS-DMSK: A Certificateless Anonymous Authentication Scheme with Dynamic Master Secret Keys in VANETs 基于动态主密钥的无证书匿名认证方案
IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-29 DOI: 10.1016/j.sysarc.2026.103720
Yan Xu, Huilan Zhang, Jie Cui, Hong Zhong
Anonymous authentication can protect the communication security and vehicles’ identity privacy in Vehicular Ad Hoc Networks (VANETs). Certificateless authentication schemes eliminate the certificate management and key escrow problem, and several certificateless anonymous authentication schemes have been proposed for VANETs. In these schemes, the key generation center (KGC) and vehicles collaborate to generate the public/private key pairs. Although collaborative key generation between KGC and vehicles enhances security, both sides introduce critical vulnerabilities: vehicles independently generating public keys remain vulnerable to public key replacement (PKR) attacks, while KGC’s reliance on a static master secret key (MSK) in most schemes increases the risk of MSK leakage. Therefore, we propose a certificateless anonymous authentication scheme in VANETs, which is resistant to PKR attacks and supports dynamic MSK updating. The security analysis shows that the proposed scheme satisfies the security and privacy requirements of VANETs. Experimental results demonstrate that CAAS-DMSK reduces the computational costs by 41.53% in MSK updating.
在车载自组网(VANETs)中,匿名认证可以保护通信安全和车辆的身份隐私。无证书认证方案消除了证书管理和密钥托管问题,针对vanet提出了几种无证书匿名认证方案。在这些方案中,密钥生成中心(KGC)和车辆合作生成公钥/私钥对。虽然KGC和车辆之间的协作密钥生成增强了安全性,但双方都引入了关键漏洞:车辆独立生成公钥仍然容易受到公钥替换(PKR)攻击,而KGC在大多数方案中依赖静态主密钥(MSK)增加了MSK泄漏的风险。因此,我们提出了一种VANETs中的无证书匿名认证方案,该方案既能抵抗PKR攻击,又支持MSK动态更新。安全性分析表明,该方案满足VANETs的安全性和隐私性要求。实验结果表明,CAAS-DMSK算法使MSK更新的计算成本降低了41.53%。
{"title":"CAAS-DMSK: A Certificateless Anonymous Authentication Scheme with Dynamic Master Secret Keys in VANETs","authors":"Yan Xu,&nbsp;Huilan Zhang,&nbsp;Jie Cui,&nbsp;Hong Zhong","doi":"10.1016/j.sysarc.2026.103720","DOIUrl":"10.1016/j.sysarc.2026.103720","url":null,"abstract":"<div><div>Anonymous authentication can protect the communication security and vehicles’ identity privacy in Vehicular Ad Hoc Networks (VANETs). Certificateless authentication schemes eliminate the certificate management and key escrow problem, and several certificateless anonymous authentication schemes have been proposed for VANETs. In these schemes, the key generation center (KGC) and vehicles collaborate to generate the public/private key pairs. Although collaborative key generation between KGC and vehicles enhances security, both sides introduce critical vulnerabilities: vehicles independently generating public keys remain vulnerable to public key replacement (PKR) attacks, while KGC’s reliance on a static master secret key (MSK) in most schemes increases the risk of MSK leakage. Therefore, we propose a certificateless anonymous authentication scheme in VANETs, which is resistant to PKR attacks and supports dynamic MSK updating. The security analysis shows that the proposed scheme satisfies the security and privacy requirements of VANETs. Experimental results demonstrate that CAAS-DMSK reduces the computational costs by 41.53% in MSK updating.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"173 ","pages":"Article 103720"},"PeriodicalIF":4.1,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146090395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Systems Architecture
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1