一种基于离散对数的强代理签名方案的分析与改进  

ANALYSING A DISCRETE LOGARITHM-BASED STRONG PROXY SIGNATURE SCHEME AND ITS IMPROVEMENT

作　　者：张兴华[1] 

机构地区：[1]廊坊师范学院数学与信息科学学院,河北廊坊065000

出　　处：《计算机应用与软件》2014年第10期318-320,333,共4页Computer Applications and Software

基　　金：河北省高等学校科学技术研究青年基金项目(Q2012020;QN20131047);廊坊师范学院科学研究项目(LSZQ201303);廊坊市科学技术研究与发展计划项目(2013011047)

摘　　要：详细分析现有的基于离散对数问题的强代理签名方案,发现方案存在不能抵抗公钥替换攻击的缺陷,并给出攻击方法。基于离散对数的困难性和Schnorr体制,通过签名算法的改进,给出一种新的强代理签名方案。重点分析新方案可以抵抗公钥替换攻击,可以对代理签名的范围和签名时间进行限制等。该方案的实用性及安全性更强。In this paper we analyse in detail the existing discrete logarithm problem-based strong proxy signature schemes, and find that these schemes have the defects of not being able to resist the public key substitution attack, and we provide the attacking methods as well. Based on the difficulty of discrete logarithm and Schnorr system, we present a new strong proxy signature scheme by improving the signature algorithm. We elaborately analyse the new scheme in its capabilities of resisting the public key substitution attack and limiting the range of proxy signature and the signature time. The new scheme has stronger practicability and security.

关 键 词：代理签名 强代理签名 离散对数 公钥替换 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]