基于双线性对的直接匿名认证方案  

Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing

作　　者：宋成[1] 李静[1] 彭维平[1] 贾宗璞[1] 刘志中[1] 

机构地区：[1]河南理工大学计算机科学与技术学院,河南焦作454000

出　　处：《北京邮电大学学报》2014年第6期72-76,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金青年科学基金项目(61300124;613002160);河南省基础与前沿技术研究计划项目(132300410332);河南省科技攻关计划项目(132102210123)

摘　　要：针对当前直接匿名认证(DAA)方案设计复杂度高、计算开销大,导致制约资源受限的嵌入式或移动可信智能设备的应用的现状,提出了一种改进DAA方案.采用双线性对密码体制,以双线性对为工具,以q强Diffie-Hellman、判定性Diffie-Hellman安全假设为基础.分析结果表明,该方案在确保正确、安全、匿名的基础上,计算开销得到了有效降低,解决了当前资源受限可信设备的计算瓶颈问题,加速推进了DAA方案在移动领域的应用.Considering the current directory anonymous attestation（ DAA） scheme complicated and timeconsuming,which makes it limited in resource-constrained devices such as embedded,an improved DAA scheme is proposed. This scheme is based on bilinear pairing under the assumption of q strong DiffieHellman and decisional Diffie-Hellman. The analysis shows that this scheme is not only correct,security and anonymous,but also efficiently relieves the computation cost. This scheme further solves the computation bottleneck and accelerate application for DAA in mobile field.

关 键 词：可信计算平台 直接匿名认证 双线性对 知识证明 

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