面向车联网的PUF驱动安全匿名认证协议

伍麟珺; 丁林

doi:10.11999/JEIT260606

面向车联网的PUF驱动安全匿名认证协议

doi: 10.11999/JEIT260606 cstr: 32379.14.JEIT260606

伍麟珺,
丁林^,

1.
湖南工程学院信息科学与工程学院湘潭 411104
2.
北京大学集成电路学院北京 100871

基金项目: 湖南省自然科学基金(2026JJ90049)，湖南省教育厅科学研究项目(25A0527)

详细信息

作者简介:
伍麟珺：女，讲师，研究方向为硬件安全、信息安全、智能通信

丁林：男，助理研究员，研究方向为硬件安全、密码芯片、隐私保护计算

通讯作者:
丁林　dinglin@pku.edu.cn

中图分类号: TP
计量
- 文章访问数: 21
- HTML全文浏览量: 4
- PDF下载量: 0
- 被引次数: 0
出版历程
- 修回日期: 2026-09-14
- 录用日期: 2026-09-14
- 网络出版日期: 2026-09-20

PUF-driven Secure Anonymous Authentication Protocol for Internet of Vehicles

WU Linjun,
DING Lin^,

1.
¹College of Information Science and Engineering, Hunan Institute of Engineering, Xiangtan 411104, China
2.
College of Integrated Circuits, Peking University, Beijing 100871, China

Funds: Hunan Natural Science Foundation (2026JJ90049), Scientific Research Fund of Hunan Provincial Education Department (25A0527)

摘要

摘要: 车联网作为智能交通系统的重要组成部分，通过车车与车路信息交互提升交通运行效率，正逐步成为智慧城市建设的重要基础设施。车联网车辆通过周期性广播基本安全消息辅助协同感知与智能决策，但明文传输可能导致车辆身份和行驶轨迹泄露。针对现有匿名认证方案中计算与通信开销较高，以及长期密钥存储易受到物理提取和侧信道攻击等问题，本文提出一种面向车联网的物理不可克隆函数(Physical Unclonable Function, PUF)驱动安全匿名认证协议。该协议利用集成电路制造过程中形成的随机工艺偏差构建设备相关硬件指纹，并基于PUF激励–响应机制生成会话密钥，结合激励信息构造和更新车辆伪名。本方案利用PUF固有的物理不可克隆特性增强认证安全性，并结合密码学机制实现无需片内存储长期敏感密钥的硬件辅助认证，从而降低物理提取和侧信道攻击导致的密钥泄漏风险。在Dolev–Yao攻击模型下，本文采用BAN逻辑、ProVerif形式化验证和非形式化方法对协议安全性进行分析。分析结果表明，所提方案能够抵御重放攻击、伪装攻击和中间人攻击，并满足匿名性、可追溯性以及协议层身份不可链接性等安全需求。性能分析结果表明，所提方案在保证多项安全功能的同时具有较低的计算与通信开销，适用于资源受限的车联网环境。
- 物理不可克隆函数 /
- 车联网 /
- 匿名认证 /
- 伪名机制 /
- 轻量级安全协议
Abstract: Objective In the Internet of Vehicles (IoV), vehicles often send Basic Safety Messages through open wireless links to support road safety and traffic control. However, these messages may expose vehicle identity and travel data. An attacker may collect messages over time and link them to the same vehicle. Thus, vehicle authentication must protect both network security and user privacy. Many current anonymous authentication schemes use complex cryptographic operations, which may cause high computation and communication costs for on-board units (OBUs) with limited resources. Some schemes also store long-term secret keys in vehicle devices. Such keys may be exposed by physical access or side-channel attacks. A Physical Unclonable Function (PUF) uses small process changes formed during chip production to create a unique hardware feature. It can produce device-related responses without storing a secret key directly. Based on this feature, this paper proposes a PUF-driven secure anonymous authentication protocol for IoV. The main goal is to reduce the risk of long-term key storage, protect vehicle identity, and keep the cost of vehicle authentication low. Methods The proposed protocol uses a response-feedback-based lightweight anti-machine-learning-attack PUF (FLAM-PUF) as its hardware root of trust. FLAM-PUF combines an Arbiter PUF with a reconfigurable Linear Feedback Shift Register (LFSR). The PUF response is fed back to change the LFSR state, which hides the link between Challenge–Response Pairs (CRPs) and makes machine-learning modeling attacks more difficult (Fig. 1). The system includes a Center Management (CM), Local Management entities (LMs), Roadside Units (RSUs), and vehicle OBUs (Fig. 2). During setup, reliable CRPs are collected in a trusted environment and sent to the CM through a secure channel. The main protocol parameters are listed in Table 1. A PUF challenge is used to form a vehicle pseudonym, while its response is used as authentication or session-key data. The OBU can recover the response from its local PUF when needed, so it does not need to store a long-term secret key. The setup process is shown in Fig. 3. The protocol uses two types of pseudonyms. Long-term pseudonyms are used for network access and identity management, while temporary pseudonyms are used for communication within an LM area. The local access process is shown in Fig. 4. Temporary pseudonyms and session keys are updated with unused CRPs (Fig. 5), and long-term pseudonyms are renewed before they expire (Fig. 6). Security is studied under the Dolev–Yao model by using BAN logic, ProVerif formal verification and informal analysis. Results and Discussions The proposed protocol combines PUF-based key generation with dynamic pseudonym management. First, FLAM-PUF uses response feedback and a reconfigurable LFSR to hide the internal CRP relation, which raises the cost of machine-learning modeling attacks (Fig. 1). Second, the use of long-term and temporary pseudonyms separates network access from local vehicle communication. CRPs, pseudonyms, and session keys are updated together, which reduces the chance that an attacker can link vehicle identities across different authentication periods (Fig. 4; Fig. 5; Fig. 6). BAN logic analysis shows that the vehicle can confirm the link between the temporary pseudonym and the PUF-based session key, while the LM can confirm that this link is approved by the CM. ProVerif verification shows that the secrecy queries for the vehicle identity and PUF responses hold, and all three injective authentication correspondences are satisfied. Under the assumed freshness and one-time CRP usage conditions, the results also support the protocol's resistance to replay and impersonation attacks. Informal security analysis shows that the protocol supports mutual authentication, anonymity, traceability, revocability, and protocol-level identity unlinkability. It can also resist replay, impersonation, man-in-the-middle, and false-message attacks (Table 3). In addition, the OBU does not need to keep a long-term secret key in nonvolatile memory because the required PUF response can be recovered when needed. This reduces the risk of direct key extraction. For performance tests, the running times of the main cryptographic operations are measured (Table4), and the operations performed by the OBU, CM, and LM in each protocol stage are listed in Table 4. For one complete online authentication and session-key agreement, the OBU computation time of the proposed scheme is about 1365.99 μs, and its communication cost is 992 bits (Table 6). Under the same test rules, its computation time is close to that of Ref. [14] and lower than those of Refs. [15]-[17]. Its communication cost is also lower than those of all four compared schemes. These results show that the protocol can provide more security functions while keeping the vehicle-side cost low. Conclusions This paper proposes a PUF-driven secure anonymous authentication protocol for IoV. FLAM-PUF is used as a hardware root of trust to recover authentication and session-key data when needed, so long-term secret keys do not need to be stored directly in the OBU. The use of long-term and temporary pseudonyms supports anonymous access, identity tracing, revocation, and protocol-level unlinkability. BAN logic, ProVerif formal verification, and informal security analysis show that the protocol meets its main security goals and can resist common network attacks. Performance results show that one online authentication and session-key agreement needs about 1365.99 μs of OBU computation and 992 bits of communication (Table 6). The proposed protocol therefore provides a useful balance among security, privacy, and low cost, and is suitable for resource-limited IoV devices.
- Physical Unclonable Function /
- Internet of Vehicles /
- Anonymous Authentication /
- Pseudonym Mechanism /
- Lightweight Security Protocol

HTML全文

图 1 (a)FLAM-PUF结构图1(b)FLAM-PUF 响应反馈流程

下载: 全尺寸图片幻灯片

图 2 车辆伪名管理分发机制系统架构图

下载: 全尺寸图片幻灯片

图 3 初始化时序图

下载: 全尺寸图片幻灯片

图 4 本地入网认证时序图

下载: 全尺寸图片幻灯片

图 5 临时伪名更新时序图

下载: 全尺寸图片幻灯片

图 6 长期伪名更新时序图

下载: 全尺寸图片幻灯片

表 1 伪名管理方案参数表

符号	描述	符号	描述
V_h	第h辆车	PK_c	中心管理局CM公钥
CM	中心管理局	SK_c	中心管理局CM私钥
LM_i	第i个本地管理局	CRP	PUF的激励响应对集合
RSU	路侧单元	crp_x	第x个激励响应对
rid	车辆全网唯一永久标识	ch_x	crp_x的激励
lid	车辆长期伪名	res_x	crp_x的响应
pid	车辆临时伪名	Enckey{}	以key为密钥的加密操作
K_ch	车辆V_h与中心管理局CM之间基于PUF响应建立的认证密钥	Deckey{}	以key为密钥的解密操作
K_ih	车辆V_h与本地管理局LM_i之间的共享会话密钥	stamp	时间戳
LPK	本地管理局LM公钥	r	随机数
LSK	本地管理局LM私钥	time	伪名或者密钥使用有效期

下载: 导出CSV

表 2 ProVerif安全查询及验证结果

验证目标	ProVerif查询/对应关系	验证结果
永久身份机密性	query attacker(rid)	成立
当前PUF响应及认证密钥机密性	query attacker(res1)	成立
新PUF响应及会话密钥机密性	query attacker(res2)	成立
CM对车辆的认证	CM接受$\Rightarrow $车辆发起	注入对应关系成立
车辆对CM的认证	车辆接受$\Rightarrow $CM生成M2	注入对应关系成立
LMi对CM的认证	LM接受$\Rightarrow $CM生成并签署M3	注入对应关系成立

下载: 导出CSV

表 3 认证方案安全属性比较

安全属性	文献[14]	文献[15]	文献[16]	文献[17]	本文方案
双向认证	√	×	×	√	√
匿名性	√	√	√	√	√
可追溯性	√	√	×	×	√
可撤销性	√	√	×	×	√
身份不可链接性	√	√	√	×	√
抗伪装攻击	√	√	√	√	√
抗重放攻击	√	√	√	√	√
抗中间人攻击	√	√	√	√	√
虚假消息攻击	√	√	√	√	√
无需长期存储密钥(认证参数)	×	×	×	×	√
抗建模攻击	×	×	√	√	√
注释："√"表示具备相应安全属性或功能，"×"表示不具备相应安全属性或功能。

下载: 导出CSV

表 4 密码学操作运行时间

符号	定义	运行时间/μs	符号	定义	运行时间/μs
T_P	物理不可克隆函数(PUF)	682	T_AD	非对称解密	25282
T_h	哈希函数	0.172	T_EM	椭圆曲线点乘	1996
T_E	对称加密	0.947	T_EA	椭圆曲线点加	85.486
T_D	对称解密	0.699	T_X	按位异或	9.38
T_Sig	RSA数字签名生成	2183.71	T_Ver	RSA数字签名验证	410.09
T_AE	非对称加密	27122	TF	模糊提取	493.63

下载: 导出CSV

表 5 各阶段各实体计算运行情况

认证阶段	计算实体	计算开销
本地入网请求	车辆OBU	2T_P+2T_h+T_E+T_D
	中心管理局CM	2T_h+2T_E+T_D+3T_AE+T_Sig
	本地管理局LM	3T_AD+T_Ver
临时伪名更新	车辆OBU	T_P+T_D+T_h
	中心管理局CM	T_Ver+T_h+T_E+T_AE+T_Sig
	本地管理局LM	T_Ver+T_AE+T_Sig
长期伪名更新	车辆OBU	2T_P+2T_h+T_E+T_D
长期伪名更新	中心管理局CM	2T_h+T_E+T_D

下载: 导出CSV

表 6 OBU侧计算时延开销与通信开销比较

安全协议方案	OBU认证计算时延开销μs	OBU认证通信开销bit
文献[14]	2T_P +5T_X+5T_h≈1411.76	1088
文献[15]	2T_EM+3T_h+T_E+T_D≈3994.16	1664
文献[16]	6T_EM+2T_EA+6T_h+T_X+T_P+T_F≈13333.01	3584
文献[17]	2T_P+3T_h+T_F+T_E≈1859.09	1008
本文方案	2T_P+2T_h+T_E+T_D≈1365.99	992
注释：表中开销均按车辆OBU完成一次在线认证与会话密钥协商统计；计算时延仅计OBU侧密码学操作，通信开销为OBU发送与接收的认证消息总长度，不含注册阶段、其他实体计算及认证后的业务数据。

下载: 导出CSV

参考文献(22)

[1]	CVE. 特斯拉TCU<v2025.14认证绕过漏洞[EB/OL]. https://cve.imfht.com/detail/CVE-2025-34251, 2026. (查阅网上资料,未找到对应的英文翻译,请补充).
[2]	张晓均, 唐浩宇, 张楠, 等. 分布式智能车载网联系统的匿名认证与密钥协商协议[J]. 电子与信息学报, 2024, 46(4): 1333–1342. doi: 10.11999/JEIT230394. ZHANG Xiaojun, TANG Haoyu, ZHANG Nan, et al. Anonymous authentication and key agreement protocol based on distributed intelligent vehicle networking system[J]. Journal of Electronics & Information Technology, 2024, 46(4): 1333–1342. doi: 10.11999/JEIT230394.
[3]	张应辉, 李国腾, 韩刚, 等. 5G车联网中安全高效的组播服务认证与密钥协商方案[J]. 电子与信息学报, 2024, 46(7): 3026–3035. doi: 10.11999/JEIT231118. ZHANG Yinghui, LI Guoteng, HAN Gang, et al. Secure and efficient authentication and key agreement scheme for multicast services in 5G vehicular to everything[J]. Journal of Electronics & Information Technology, 2024, 46(7): 3026–3035. doi: 10.11999/JEIT231118.
[4]	MANASRAH A, YASEEN Q, AL-AQRABI H, et al. Identity-based authentication in VANETs: A review[J]. IEEE Transactions on Intelligent Transportation Systems, 2025, 26(4): 4260–4282. doi: 10.1109/TITS.2025.3528932.
[5]	VERMA G K, RANA S, TIWARI A, et al. Dynamic anonymous hierarchical edge-assisted batch verifiable authentication for VANETs[J]. IEEE Transactions on Vehicular Technology, 2025, 74(9): 14735–14744. doi: 10.1109/TVT.2025.3566415.
[6]	WANG Yahui, JIA Xiaoying, BAO Yingying, et al. Efficient and provably secure offline/online heterogeneous signcryption scheme for VANETs[J]. IEEE Internet of Things Journal, 2024, 11(24): 41248–41260. doi: 10.1109/JIOT.2024.3458077.
[7]	LI Kang, AU M H, HO W H, et al. An efficient conditional privacy-preserving authentication scheme for vehicular ad hoc networks using online/offline certificateless aggregate signature[C]. Proceedings of the 13th International Conference on Provable Security, Cairns, Australia, 2019: 59–76. doi: 10.1007/978-3-030-31919-9_4.
[8]	ZHOU Ziyu, WANG Pengjun, LI Gang, et al. Improving the stability of APUF to 100% without extra hardware overhead for enhancing the performance of security authentication protocols[J]. IEEE Internet of Things Journal, 2025, 12(12): 19818–19832. doi: 10.1109/JIOT.2025.3541434.
[9]	NI Li, WU Siyuan, PU Jinwei, et al. Highly reliable RRAM-based physical unclonable function with auto-write technique[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2026, 34(6): 2000–2004. doi: 10.1109/TVLSI.2026.3670888.
[10]	WU Linjun, HU Yupeng, ZHANG Kehuan, et al. FLAM-PUF: A response–feedback-based lightweight anti-machine-learning-attack PUF[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022, 41(11): 4433–4444. doi: 10.1109/TCAD.2022.3197696.
[11]	CHOI J, KWON D, SON S, et al. A PUF-based lightweight authentication scheme for UAV-assisted internet of vehicles[J]. IEEE Transactions on Intelligent Transportation Systems, 2025, 26(9): 13782–13798. doi: 10.1109/TITS.2025.3564581.
[12]	JIA Chunzhi, TAN Weijie, SHEN Ao, et al. A PUF-enhanced fog-enabled hierarchical authentication protocol for internet of vehicles[J]. IEEE Internet of Things Journal, 2025, 12(18): 37629–37644. doi: 10.1109/JIOT.2025.3583822.
[13]	SHEN Ao, TAN Weijie, JIA Chunzhi, et al. CUBE-PUF-based anonymous mutual authentication protocol for internet of vehicles[J]. IEEE Internet of Things Journal, 2025, 12(18): 38697–38709. doi: 10.1109/JIOT.2025.3586869.
[14]	LI Jiping, CHEN Jing, LIU Yining, et al. An efficient and revocable PUF-based authentication scheme for secure V2R mutual communication in VANETs[J]. IEEE Internet of Things Journal, 2025, 12(18): 37974–37987. doi: 10.1109/JIOT.2025.3585643.
[15]	夏卓群, 苏潮, 徐梓桑, 等. 基于物理不可克隆函数的轻量级可证明安全车联网认证协议[J]. 电子与信息学报, 2024, 46(9): 3788–3796. doi: 10.11999/JEIT240141. XIA Zhuoqun, SU Chao, XU Zisang, et al. A lightweight and provably secure authentication protocol for internet of vehicles using physical unclonable function[J]. Journal of Electronics & Information Technology, 2024, 46(9): 3788–3796. doi: 10.11999/JEIT240141.
[16]	VIJAYAKUMAR P, RAJASEKARAN A S, AZEES M, et al. Probably secure PUF-based anonymous mutual and batch authentication for inter-vehicular communications in VANET[J]. IEEE Transactions on Vehicular Technology, 2026, 75(2): 2516–2526. doi: 10.1109/TVT.2025.3600097.
[17]	YANG Yuting, TAN Weijie, LI Zhen, et al. Mutual authentication protocols based on PUF and multitrusted authority for internet of vehicles[J]. IEEE Internet of Things Journal, 2024, 11(24): 40086–40099. doi: 10.1109/JIOT.2024.3449901.
[18]	CHAUHDARY S H, MA Tengfei, JIANG Linhua, et al. PUF-ILM: A PUF-enabled authentication scheme for internet of vehicles using improved logical mapping[J]. IEEE Internet of Things Journal, 2026, 13(7): 13787–13800. doi: 10.1109/JIOT.2026.3656432.
[19]	ZHOU Ziyu, LI Gang, ZHANG Yuejun, et al. A strong PUF-based security protocol to protect AI model parameters against privacy information leakage[J]. IEEE Internet of Things Journal, 2025, 12(12): 20815–20827. doi: 10.1109/JIOT.2025.3544555.
[20]	XIE Yuanfeng, JIANG Weiwei, LUO Hanqing, et al. A lightweight and efficient authentication protocol based on AST PUF and Schnorr for IoT[J]. IEEE Internet of Things Journal, 2026, 13(1): 1606–1621. doi: 10.1109/JIOT.2025.3629693.
[21]	DOLEV D and YAO A. On the security of public key protocols[J]. IEEE Transactions on Information Theory, 1983, 29(2): 198–208. doi: 10.1109/TIT.1983.1056650.
[22]	BLANCHET B. An efficient cryptographic protocol verifier based on Prolog rules[C]. Proceedings of the 14th IEEE Computer Security Foundations Workshop, Cape Breton, Canada, 2001: 82–96. doi: 10.1109/CSFW.2001.930138.