计算机科学与探索2026，Vol.20Issue(6)：1678-1687,10.DOI:10.3778/j.issn.1673-9418.2507085
基于格的可撤销身份加密方案
Lattice-Based Revocable Identity-Based Encryption Scheme
摘要
Abstract
In urban intelligent transportation management systems,the diversity of user identities and the sensitivity of data impose heightened requirements on identity management and data security.To address the shortcomings of existing identity-based encryption(IBE)schemes in terms of key-update efficiency,dynamic user revocation,and resistance to quantum attacks,this paper proposes a revocable identity-based encryption scheme built on lattice-based cryptography.The scheme integrates lattice-based cryptography with a binary-tree data structure and introduces a minimal-cover mechanism to reduce the computational complexity of key updates,thereby achieving an efficient key-refresh process.By monitoring system state and leveraging a global revocation list,it supports real-time,non-interactive dynamic revocation of user identities.From a security perspective,the construction is grounded in the learning with errors(LWE)problem,providing resistance against quantum-computing attacks;its indistinguishability under identity-based chosen-plaintext attacks(IND-ID-CPA)is rigorously proven in the random-oracle model.Extensive simulations demonstrate that the proposal excels at key updating,dynamic revocation,and real-time data processing within urban intelligent-transportation management systems,satisfying the demands of large-scale device management and highly dynamic user scenarios while guaranteeing strong system security.关键词
基于身份加密/格密码/二叉树/最小覆盖机制/动态撤销Key words
identity-based encryption/lattice cryptography/binary tree/minimal coverage mechanism/dynamic revocation分类
信息技术与安全科学引用本文复制引用
赵宗渠,张帆,汤永利,闫玺玺,谢文豪..基于格的可撤销身份加密方案[J].计算机科学与探索,2026,20(6):1678-1687,10.基金项目
国家自然科学基金(62472144) （62472144）
河南省自然科学基金(252300421512). This work was supported by the National Natural Science Foundation of China(62472144),and the Natural Science Foundation of Henan Province(252300421512). （252300421512）
