首页|期刊导航|计算机科学与探索|基于格的可撤销身份加密方案

基于格的可撤销身份加密方案OA

Lattice-Based Revocable Identity-Based Encryption Scheme

中文摘要英文摘要

在城市智能交通管理系统中,用户身份的多样性与数据的敏感性对身份管理与数据安全方面提出了更高要求.针对现有基于身份加密(IBE)方案在密钥更新效率、用户动态撤销及抗量子计算方面存在的不足,提出一种基于格密码学的可撤销身份加密方案.该方案将格密码学与二叉树数据结构相结合,引入最小覆盖机制降低密钥更新的计算复杂度,以实现高效的密钥更新过程;并结合系统状态,通过利用撤销列表支持用户身份的实时动态撤销,以实现非交互式动态撤销.在安全性方面,方案基于格上容错学习(LWE)问题,具备抗量子计算攻击的能力;并在随机预言机模型下,证明了方案基于身份选择明文攻击下的不可区分性(IND-ID-CPA)安全.通过仿真实验,结果表明方案在城市智能交通管理系统中的密钥更新、动态撤销以及数据实时处理方面均表现出色,能够在保障系统安全性的同时,适应大规模设备管理和高动态用户场景需求.

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.

赵宗渠;张帆;汤永利;闫玺玺;谢文豪

河南理工大学 软件学院,河南 焦作 454000河南理工大学 软件学院,河南 焦作 454000河南理工大学 软件学院,河南 焦作 454000河南理工大学 软件学院,河南 焦作 454000河南理工大学 软件学院,河南 焦作 454000

信息技术与安全科学

基于身份加密格密码二叉树最小覆盖机制动态撤销

identity-based encryptionlattice cryptographybinary treeminimal coverage mechanismdynamic revocation

《计算机科学与探索》 2026 (6)

1678-1687,10

国家自然科学基金(62472144)河南省自然科学基金(252300421512). This work was supported by the National Natural Science Foundation of China(62472144),and the Natural Science Foundation of Henan Province(252300421512).

10.3778/j.issn.1673-9418.2507085

评论