| 基于椭圆曲线的无可信中心(t,n)门限群签名 |
| |
| 引用本文： | 王化群,张力军,赵君喜.基于椭圆曲线的无可信中心(t,n)门限群签名[J].信号处理,2006,22(2):189-192. |
| |
| 作者姓名： | 王化群 张力军 赵君喜 |
| |
| 作者单位： | 1. 南京邮电学院信息工程系,江苏,南京,210003
2. 南京邮电学院应用数理系,江苏,南京,210003 |
| |
| 摘 要： | 基于有限域上椭圆曲线离散对数难解性,提出了无可信方的(t,n)门限签名方案和可验证的密钥协商方案。利用一个改进的椭圆曲线签名方程,我们得到一个从计算和安全上都比现有的椭圆曲线数字签名算法(ECDSA)更高效的签名方案。此方案具有更短的密钥,更快的计算和更好的安全性。
|
| 关 键 词： | 门限方案 数字签名 椭圆曲线离散对数 门限签名体制 |
| 修稿时间： | 2004年11月17 |
(t,n) Threshold Group Signature Based on Elliptic Curve Without Trusted Party |
| |
| Wang Huaqun,Zhang Lijun,Zhao Junxi.(t,n) Threshold Group Signature Based on Elliptic Curve Without Trusted Party[J].Signal Processing,2006,22(2):189-192. |
| |
| Authors: | Wang Huaqun Zhang Lijun Zhao Junxi |
| |
| Abstract: | 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. |
| |
| Keywords: | threshold scheme digital signature elliptic curve discrete logarithm threshold signature |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
