本文選題：車聯(lián)網(wǎng) + 群簽名　； 參考：《西安電子科技大學(xué)》2015年碩士論文

【摘要】：群簽名被廣泛的應(yīng)用在車聯(lián)網(wǎng)中來保障車輛用戶的隱私安全。由于在車聯(lián)網(wǎng)中,車輛的高速行駛使得群組中群成員的加入撤銷十分頻繁,故車聯(lián)網(wǎng)上的群簽名方案應(yīng)該能夠?qū)θ撼蓡T進(jìn)行高效的加入撤銷。在現(xiàn)有方案中,成員的動(dòng)態(tài)加入已經(jīng)得到了很好的解決。群組中有新成員加入時(shí),只需要為新成員生成公私鑰對(duì),并相應(yīng)的更新群公鑰即可。但是關(guān)于車聯(lián)網(wǎng)群成員的動(dòng)態(tài)撤銷一直是一個(gè)難題,在大部分可實(shí)現(xiàn)成員撤銷的群簽名方案中,一個(gè)成員的撤銷會(huì)影響未撤銷成員的密鑰對(duì),當(dāng)方案應(yīng)用在動(dòng)態(tài)變化頻繁的車聯(lián)網(wǎng)中時(shí),所造成的計(jì)算負(fù)載和通信延遲是巨大的。針對(duì)此問題,論文基于中國剩余定理,提出了一個(gè)車聯(lián)網(wǎng)中高效撤銷的群簽名方案。方案中,利用中國剩余定理的特點(diǎn),實(shí)現(xiàn)了群成員的高效撤銷,即當(dāng)一個(gè)成員撤銷時(shí),不會(huì)影響未撤銷成員的密鑰對(duì),只需要相應(yīng)的更新群公鑰即可,大大的減小了計(jì)算負(fù)載,同時(shí),方案也能實(shí)現(xiàn)群成員的高效加入。論文對(duì)提出的方案進(jìn)行了安全性分析,證明了此方案是抗共謀攻擊的,同時(shí)與兩個(gè)現(xiàn)有的可撤銷的方案進(jìn)行了性能比較,證明了此方案是非常高效的。在車流量較大的道路上,熙攘的車輛在每秒內(nèi)接收到要驗(yàn)證的信息量是非常大的,因此,高效的驗(yàn)證方案受到了廣泛的關(guān)注�；谂框�(yàn)證,論文對(duì)上一個(gè)方案作出了改進(jìn),提出了一個(gè)車聯(lián)網(wǎng)中基于Schnorr簽名算法的高效撤銷的批量驗(yàn)證群簽名方案,該方案相較于上一方案,對(duì)簽名消息的驗(yàn)證效率有了很大提升。雖然提出的車聯(lián)網(wǎng)中基于Schnorr簽名算法的高效撤銷的批量驗(yàn)證群簽名方案對(duì)車聯(lián)網(wǎng)中高效撤銷的群簽名方案進(jìn)行了改進(jìn),但是在性能分析中我們得到,在計(jì)算負(fù)載中主要消耗時(shí)間的冪運(yùn)算的執(zhí)行次數(shù)與批量驗(yàn)證中的消息數(shù)量成線性比。針對(duì)這一問題,論文提出了一個(gè)車聯(lián)網(wǎng)中基于DSA簽名算法的高效撤銷的批量驗(yàn)證群簽名方案,方案中,冪運(yùn)算的執(zhí)行次數(shù)與批量驗(yàn)證中的消息數(shù)無關(guān),是一個(gè)常數(shù),從而使計(jì)算負(fù)載有了大幅度的降低。論文對(duì)這兩個(gè)方案都進(jìn)行了安全性分析和性能比較,證明了這兩個(gè)方案都是安全又高效的。
[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.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN918;U495;TN929.5

【參考文獻(xiàn)】

相關(guān)期刊論文 前6條

1 魯飛;張亞平;馬建軍;;一個(gè)基于中國剩余定理的群簽名方案的密碼學(xué)分析與改進(jìn)[J];計(jì)算機(jī)應(yīng)用研究;2011年06期

2 李俊;崔國華;劉志遠(yuǎn);;一個(gè)群簽名方案的密碼學(xué)分析與改進(jìn)[J];電子學(xué)報(bào);2007年04期

3 王鳳和;胡予濮;王春曉;;一個(gè)基于中國剩余定理的群簽名方案的攻擊及其改進(jìn)方案[J];電子與信息學(xué)報(bào);2007年01期

4 Kwangjo Kim;;NEW ID-BASED GROUP SIGNATURE FROM PAIRINGS[J];Journal of Electronics;2006年06期

5 胡斌;施榮華;婁悅;;一種改進(jìn)的基于中國剩余定理的群簽名方案[J];計(jì)算機(jī)工程與應(yīng)用;2006年24期

6 陳澤文,張龍軍,王育民,黃繼武,黃達(dá)人;一種基于中國剩余定理的群簽名方案[J];電子學(xué)報(bào);2004年07期

，

本文編號(hào)：1913649