一种基于有限域上的多项式分解定理的群签名方案  

An Efficient Group Signature Scheme Based on Factorial Decompose Theorem of Polynomial with Factors in Finite Field

作　　者：张兴兰[1] 

机构地区：[1]北京工业大学计算机学院,北京100124

出　　处：《微电子学与计算机》2010年第3期163-165,169,共4页Microelectronics & Computer

基　　金：国家"八六三"计划项目(2006AA01Z440);国家"九七三"计划项目(2007CB311100);北京市科技计划项目(Z07000100720706)

摘　　要：基于有限域上的多项式分解定理,给出一种新的群成员撤销方案.新方案的特点是:不需要群管理员和成员的交互;在成员增加和撤销过程中不改变成员的密钥;签名算法等同于一个普通签名,验证算法与撤销成员的个数无关.并分析了提出方案的安全性和性能.Based the factorial decompose theorem of polynornaial with factors in a finite field, a new group signature schemes is propined. The solution is efficient in that it needs no communication between group manager and member, and the member＇s key is not need to change when the group manager adds or excludes the group members. The signing is same as a normal signature, and the computational cost of verifying is independent of the number of the revoked members. At last, the security is analyzed under factorial decompose theorem of polynomial and discrete logarithm problem assumption.

关 键 词：因子分解定理 群签名 成员撤销 

分 类 号：TN918[电子电信—通信与信息系统]