Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (23): 116-118.

• 网络、通信与安全 • Previous Articles     Next Articles

Sequential digital multi-signature scheme without using Hash and Redundancy functions

LIU Zhen,YU Zhao-ping,DONG Tao   

  1. Institute of Electronic Technology,the PLA Information Engineering University,Zhengzhou 450004,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-11 Published:2007-08-11
  • Contact: LIU Zhen

不使用Hash和Redundancy函数的有序多重数字签名方案

刘 振,余昭平,董 涛   

  1. 解放军信息工程大学 电子技术学院,郑州 450004
  • 通讯作者: 刘 振

Abstract: All the existed sequential digital multi-signature schemes use Hash and Redundancy functions,so it will take a risk of using Hash functions and Redundancy functions.This paper points out the insecurity problem in Shi’s scheme(reference[1]),and constructs a new sequential digital multi-signature scheme based on ECC.This scheme doesn’t use Hash functions or Redundancy functions and cancels the signature centre in reference [1].All the messages in the scheme will be public,signers can validate the signatures to discover fake signature and avoid the cheating by inner users.The scheme can solve the insecurity problem in reference [1],and has lower computation,higher safety,simpler structure and more applied value than Shi’s scheme.

Key words: sequential, multi-signature, Hash functions, Redundancy functions

摘要: 现有的有序多重数字签名方案都使用了Hash函数和消息冗余函数,这必将承受由Hash函数和消息冗余函数带来的安全威胁。首先指出了施方案(文献[1])中存在的安全性问题,随后利用椭圆曲线密码算法设计了一个新的有序多重数字签名方案,该方案不使用Hash函数和消息冗余函数,减少了这方面所带来的安全威胁;取消了施方案里的签名中心,避免了该签名中心的参与导致计算瓶颈的产生;所有消息均公开,签名者可以共同通过验证来发现伪签名和成员内部的欺诈行为。该文方案能够克服施方案的安全问题,并且计算量小,结构简单,具有一定的实用价值。

关键词: 有序, 多重数字签名, Hash函数, 冗余函数