检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周楠 杜红珍 ZHOU Nan;DU Hongzhen(Department of Mathematics and Information Science,Baoji University of Arts and Sciences,Baoji 721013,China)
机构地区:[1]宝鸡文理学院数学与信息科学学院,陕西宝鸡721013
出 处:《电子设计工程》2023年第5期55-60,共6页Electronic Design Engineering
基 金:教育部人文社会科学研究规划基金(19YJA790007);陕西省科技厅工业攻关一般项目(2020GY-041)。
摘 要:传统车载网系统基于中心化构造,存在无线网技术的脆弱性等缺陷,一旦遭受攻击,后果不堪设想。此外,现有签名方案大都采用大量双线性对运算,导致计算成本过高、效率低下。通过将区块链技术与车载网相结合,在传统车载网系统模型的基础上进行改进,并提出一个新的适用于车载网的无证书签名方案。在随机预言机模型下,将方案的安全性归约到计算性Diffie-Hellman问题上,证明了文中方案在两类敌手的适应性选择消息攻击下是不可伪造的,满足认证性、匿名性和可追踪性。与同类方案相比,仅在验证过程中使用了双线性对运算,在安全性与计算量上具有一定优势。The traditional Vehicle Ad hoc Network system is based on centralized structure,which has some defects such as the vulnerability of wireless network technology. Once attacked,the consequences are unimaginable.In addition,most existing signature schemes use a large number of bilinear pairings,which leads to high computational cost and low efficiency. By combining blockchain technology with Vehicle Ad hoc Network,the traditional vehicular network system model is improved,and a new certificateless signature scheme suitable for vehicular network is proposed. Under the random oracle model,the security of the scheme is reduced to the computational Diffie-Hellman problem,which proves that the scheme in this paper is unforgeable under the attack of adaptive selection messages of two kinds of adversaries,and satisfies the authentication,anonymity and traceability.Compared with similar schemes,only bilinear pairings are used in the verification process,which has certain advantages in security and computation.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222