Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 105-106.DOI: 10.3778/j.issn.1002-8331.2009.27.032

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

Proxy-multi-signature scheme based on factor polynomials

HU Mao-yin,JIA Zhen-hong   

  1. College of Information Science and Technology,Xinjiang University,Urumqi 830046,China
  • Received:2008-05-26 Revised:2008-08-11 Online:2009-09-21 Published:2009-09-21
  • Contact: HU Mao-yin

基于因式分解的代理群签名方案

胡茂银,贾振红   

  1. 新疆大学 信息科学与工程学院,乌鲁木齐 830046
  • 通讯作者: 胡茂银

Abstract: Currently,most of the proxy-multi-signature schemes are based on discrete logarithm(such as Elgamal or Schnorr) with low efficiency because of the complexity of module exponential computation,and the situation will become even worse when there are plenty of users.According to some useful characteristics of the 2-orders equation in finite scopes,a new type of proxy-multi-signature scheme based on factor polynomials is proposed in this paper,using the computation forms such as multiply and reversion,etc.Its efficiency can be enhanced considerably,and can be utilized in the circumstance with plenty of users.

Key words: factor polynomials, proxy-signature, multi-signature

摘要: 目前基于离散对数问题(如ElGamal或Schnorr)的代理群签名算法都要进行大数的模指数运算,效率一般不高,尤其是当群用户数目很多时问题将更加严重。利用有限域中二次方程的一些特性,提出了一种基于因式分解的代理群签名方案,该算法以乘法或求逆等简单运算形式为基础,计算效率有显著提高,能够满足群用户较多时对群签名的需求。

关键词: 因式分解, 代理签名, 群签名

CLC Number: