一种新的基于椭圆曲线的门限群签名方案  

A New Threshold Signature Scheme Based on Elliptic Curve Cryptosystem

作　　者：谢冬[1] 李佳佳[1] 沈忠华[1] 

机构地区：[1]杭州师范大学理学院,浙江杭州310036

出　　处：《杭州师范大学学报（自然科学版）》2013年第1期57-60,共4页Journal of Hangzhou Normal University(Natural Science Edition)

基　　金：浙江省自然科学基金项目(Y6110782)

摘　　要：在门限群签名体制中,任何t或多于t个成员合作就可以产生一个有效的群签名.基于椭圆曲线离散对数问题的难解性,提出了一个安全、有效的门限签名方案.与现有的基于椭圆曲线离散对数问题的门限签名方案相比,提出的方案具有以下优势:在可信中心TC的帮助下能够追踪到签名者的身份;t个成员合谋攻击不能伪造其他成员的签名也无法获取系统的全部秘密;系统具有一定的稳定性.In the threshold group signature cryptosystem, any t or more than t members can cooperate to produce a valid group signature. Based on the difficulty of solving the ECDLP（elliptic curve discrete logarithm problem）, a secure and efficient threshold scheme was proposed. Comparing to the existing threshold signature scheme based on the ECDLP, this scheme has some advantages ,it is able to track the signer＇s identity with the assistance of the trusted center TC, t members in the group can not forge other members＇ partial signature and can not obtain all the system＇s secrets, and the system has certainly stability.

关 键 词：数字签名 门限签名 秘密共享 椭圆曲线离散对数 

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