无可信中心的门限匿名认证方案  

THRESHOLD ANONYMOUS AUTHENTICATION SCHEME WITHOUT TRUSTED CENTER

作　　者：殷凤梅[1] 濮光宁[2] 胡玉娟[1] 侯整风[3] 

机构地区：[1]合肥师范学院,安徽合肥230601 [2]安徽财贸职业学院,安徽合肥230601 [3]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《井冈山大学学报（自然科学版）》2014年第5期63-67,共5页Journal of Jinggangshan University (Natural Science)

基　　金：安徽省高等学校省级优秀青年人才基金重点项目(2013SQRL063ZD);安徽省自然科学基金项目(090412051);安徽省高等学校省级质量工程教学研究项目(2013jyxm174)

摘　　要：现有的匿名认证方案中,大多存在可信中心,匿名的可控性比较随意,而采用基于离散对数方法求解困难。针对这个问题,提出了一个新的无可信中心的门限匿名认证方案。该方案不需要可信中心,借助群签名的思想,实现示证者身份的认证;采用安全多方计算协议,实现示证者身份的门限匿名追踪。方案中认证者的匿名性、示证者的可追踪性和身份的不可冒充性满足了匿名认证的安全需求,避免了可信中心存在时的权威欺骗。Among the present anonymous authentication schemes, most of them existed in a trusted center and the anonymous controllability is optional. To solve these two problems, a new threshold anonymous authentication scheme based on the intractability of the discrete logarithm is presented. Because the proposed scheme doesn＇t have a trusted party, it can prevent the trusted party from active or authoritative cheating. With the help of the method of group signature, the prover identity can be authenticated. On the basis of secure multi-party computation protocol, the prover identity can carry out the threshold anonymous tracking. The authenticator is anonymous, the prover is the traceable and the identity can＇t be simulated, all of which can make the scheme well satisfy the security of anonymous authentication.

关 键 词：匿名认证 群签名 安全多方计算 无可信中心 追踪性 门限性 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]