计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2015年
5期
149-152,158
,共5页
殷凤梅%侯整风%濮光宁%陈鸿
慇鳳梅%侯整風%濮光寧%陳鴻
은봉매%후정풍%복광저%진홍
匿名认证%追踪性%门限%1/n签名%线性方程组%离散对数
匿名認證%追蹤性%門限%1/n籤名%線性方程組%離散對數
닉명인증%추종성%문한%1/n첨명%선성방정조%리산대수
anonymous authentication%traceability%threshold%1/n signature%linear equations%discrete logarithm
现有匿名认证方案的匿名认证过程较复杂,匿名追踪要求的成员数量较少,导致匿名认证时间增加,隐私安全性降低。为此,结合门限秘密共享思想,提出一种新的匿名认证方案。该方案借助线性方程组秘密共享理论,获取成员的私钥和群公钥,基于1/n签名思想,使示证者从集合U中主动选择匿名集,从而完成匿名认证,为提高匿名的安全性,使用t个成员联合实现门限追踪,且验证者可以验证追踪到公钥身份的真实性。分析结果表明,与无可信中心的匿名认证方案相比,该方案不仅满足匿名认证的安全性需求,且运算耗费较小。
現有匿名認證方案的匿名認證過程較複雜,匿名追蹤要求的成員數量較少,導緻匿名認證時間增加,隱私安全性降低。為此,結閤門限祕密共享思想,提齣一種新的匿名認證方案。該方案藉助線性方程組祕密共享理論,穫取成員的私鑰和群公鑰,基于1/n籤名思想,使示證者從集閤U中主動選擇匿名集,從而完成匿名認證,為提高匿名的安全性,使用t箇成員聯閤實現門限追蹤,且驗證者可以驗證追蹤到公鑰身份的真實性。分析結果錶明,與無可信中心的匿名認證方案相比,該方案不僅滿足匿名認證的安全性需求,且運算耗費較小。
현유닉명인증방안적닉명인증과정교복잡,닉명추종요구적성원수량교소,도치닉명인증시간증가,은사안전성강저。위차,결합문한비밀공향사상,제출일충신적닉명인증방안。해방안차조선성방정조비밀공향이론,획취성원적사약화군공약,기우1/n첨명사상,사시증자종집합U중주동선택닉명집,종이완성닉명인증,위제고닉명적안전성,사용t개성원연합실현문한추종,차험증자가이험증추종도공약신빈적진실성。분석결과표명,여무가신중심적닉명인증방안상비,해방안불부만족닉명인증적안전성수구,차운산모비교소。
Among the present anonymous authentication schemes,anonymous authentication process is more complex, and the number of anonymous tracing members requires less,which can increase the time of anonymous authentication, and reduces the security of privacy. A new anonymous authentication scheme is presented combined with the threshold secret sharing scheme. Every member’ s secret share and the group’ s public key can be obtained with the help of the theory of linear equations secret sharing. The anonymous authentication can be achieved based on the idea of 1/n signatures,with which the prover can unrestrictedly choose anonymity set from the group U. In order to improve the safety of anonymity,only t members can trace the identity of the prover,which can be verified by the verifier whether is real or not. Analysis results show that, compared with anonymous authentication scheme without trusted center, this scheme can satisfy the security requirements of anonymous authentication,and the computational cost is smaller.