计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (2): 148-148.

• 网络、通信与安全 • 上一篇    下一篇

一个新的离散对数有序多重签名方案

杜海涛,张青坡,钮心忻,杨义先   

  1. 北京邮电大学信息安全中心
  • 收稿日期:2006-05-17 修回日期:1900-01-01 出版日期:2007-01-11 发布日期:2007-01-11
  • 通讯作者: 杜海涛 博士 博士

A New Sequential Multisignature Scheme Based on Discrete Logarithm Problem

,,,   

  1. 北京邮电大学信息安全中心
  • Received:2006-05-17 Revised:1900-01-01 Online:2007-01-11 Published:2007-01-11

摘要: 目前所有的离散对数有序多重签名方案中, 多重签名的长度和验证签名的时间都随着签名人数的增加而增加. 该文给出了一种新的离散对数有序多重数字签名方案. 新方案中, 多重签名的长度和签名的验证时间与签名人数无关, 因此具有更高的实用性和安全性.

关键词: 数字签名, 多重签名, 有序, 离散对数

Abstract: All of the existing sequential multisignature schemes based on discrete logarithm problem have the following problem: the size of the multisignature and the time for verifying the signature are dependent on the number of the signers. A new sequential multisignature scheme based on discrete logarithm problem without the mentioned problem is proposed. The new scheme are highly applicable and secure.

Key words: digital signature, multisignatur, sequential, discrete logarithm