车联网中高效的群签名方案研究

发布时间：2018-05-20 07:05

本文选题：车联网 + 群签名　；参考：《西安电子科技大学》2015年硕士论文

【摘要】：群签名被广泛的应用在车联网中来保障车辆用户的隐私安全。由于在车联网中,车辆的高速行驶使得群组中群成员的加入撤销十分频繁,故车联网上的群签名方案应该能够对群成员进行高效的加入撤销。在现有方案中,成员的动态加入已经得到了很好的解决。群组中有新成员加入时,只需要为新成员生成公私钥对,并相应的更新群公钥即可。但是关于车联网群成员的动态撤销一直是一个难题,在大部分可实现成员撤销的群签名方案中,一个成员的撤销会影响未撤销成员的密钥对,当方案应用在动态变化频繁的车联网中时,所造成的计算负载和通信延迟是巨大的。针对此问题,论文基于中国剩余定理,提出了一个车联网中高效撤销的群签名方案。方案中,利用中国剩余定理的特点,实现了群成员的高效撤销,即当一个成员撤销时,不会影响未撤销成员的密钥对,只需要相应的更新群公钥即可,大大的减小了计算负载,同时,方案也能实现群成员的高效加入。论文对提出的方案进行了安全性分析,证明了此方案是抗共谋攻击的,同时与两个现有的可撤销的方案进行了性能比较,证明了此方案是非常高效的。在车流量较大的道路上,熙攘的车辆在每秒内接收到要验证的信息量是非常大的,因此,高效的验证方案受到了广泛的关注。基于批量验证,论文对上一个方案作出了改进,提出了一个车联网中基于Schnorr签名算法的高效撤销的批量验证群签名方案,该方案相较于上一方案,对签名消息的验证效率有了很大提升。虽然提出的车联网中基于Schnorr签名算法的高效撤销的批量验证群签名方案对车联网中高效撤销的群签名方案进行了改进,但是在性能分析中我们得到,在计算负载中主要消耗时间的幂运算的执行次数与批量验证中的消息数量成线性比。针对这一问题,论文提出了一个车联网中基于DSA签名算法的高效撤销的批量验证群签名方案,方案中,幂运算的执行次数与批量验证中的消息数无关,是一个常数,从而使计算负载有了大幅度的降低。论文对这两个方案都进行了安全性分析和性能比较,证明了这两个方案都是安全又高效的。
[Abstract]:Group signatures are widely used in vehicle networking to protect the privacy of vehicle users. Due to the high speed driving of the vehicle in the vehicle network, the group members in the group are joined and revoked frequently, so the group signature scheme on the vehicle network should be able to join the group members efficiently. In the existing scheme, the dynamic membership has been well solved. When a new member is added to the group, only a public and private key pair is generated for the new member and the public key of the group is updated accordingly. However, the dynamic revocation of group members is always a difficult problem. In most group signature schemes that can be implemented, the revocation of a member will affect the key pair of unrevoked members. The computational load and communication delay caused by the scheme are huge when it is applied to the frequently dynamic vehicle network. In order to solve this problem, based on the Chinese residue theorem, a group signature scheme for efficient cancellation in vehicle networking is proposed. In the scheme, the characteristics of Chinese residue theorem are used to realize the efficient revocation of group members, that is, when a member cancels, it will not affect the key pair of unrevoked members, but only need to update the group public key, which greatly reduces the computational load. At the same time, the scheme can also achieve the group members to join efficiently. This paper analyzes the security of the proposed scheme, and proves that the scheme is anti-collusion attack. At the same time, the performance of the proposed scheme is compared with two existing revocable schemes. It is proved that this scheme is very efficient. On the road with high traffic, the amount of information to be verified by the vehicle is very large within a second, so the efficient verification scheme has been paid more and more attention. Based on batch verification, this paper improves the previous scheme and proposes an efficient mass verification group signature scheme based on Schnorr signature algorithm in vehicle networking, which is compared with the previous scheme. The verification efficiency of signed messages has been greatly improved. Although the proposed mass verification group signature scheme based on Schnorr signature algorithm improves the efficient group signature scheme in vehicle networking, we get the results in the performance analysis. There is a linear ratio between the number of power operations and the number of messages in batch validation. In order to solve this problem, this paper proposes an efficient batch verification group signature scheme based on DSA signature algorithm in vehicle networking. In the scheme, the number of power operations is independent of the number of messages in batch verification and is a constant. As a result, the computational load has been greatly reduced. The security analysis and performance comparison of the two schemes show that the two schemes are both safe and efficient.
【学位授予单位】：西安电子科技大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN918;U495;TN929.5

【参考文献】