基于椭圆曲线的无可信中心(t,n)门限群签名  

(t,n) Threshold Group Signature Based on Elliptic Curve Without Trusted Party

作　　者：王化群[1] 张力军[1] 赵君喜[2] 

机构地区：[1]南京邮电学院信息工程系,江苏南京210003 [2]南京邮电学院应用数理系,江苏南京210003

出　　处：《信号处理》2006年第2期189-192,共4页Journal of Signal Processing

摘　　要：基于有限域上椭圆曲线离散对数难解性,提出了无可信方的(t,n)门限签名方案和可验证的密钥协商方案。利用一个改进的椭圆曲线签名方程,我们得到一个从计算和安全上都比现有的椭圆曲线数字签名算法(ECDSA)更高效的签名方案。此方案具有更短的密钥,更快的计算和更好的安全性。Based on the difficulty of solving the ECDLP（elliptic curve discrete logarithm problem）on the finite field, presenting the（ t, n ）threshold signature scheme and giving verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA（ elliptic curve digital signature algorithm） from the computability and security view. Our scheme has a shorter key, faster computation, and better security.

关 键 词：门限方案 数字签名 椭圆曲线离散对数 门限签名体制 

分 类 号：TN918.1[电子电信—通信与信息系统] TP309[电子电信—信息与通信工程]