一种基于离散对数的指名强代理签名方案  

A Strong Proxy Nominative Signature Scheme Based on Discrete Logarithm

作　　者：王晚[1] 杜伟章[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,湖南长沙410004

出　　处：《微计算机信息》2011年第9期181-182,203,共3页Control & Automation

摘　　要：对黄振杰提出的指定验证人的代理签名方案进行了安全分析,发现该方案容易受到代理授权人伪造攻击和代理签名人伪造攻击;在此基础上改进了签名方程,使得方案具备一定的强代理特性。经分析,新方案避免了前述两种攻击,改进的指定验证人特性也较好地克服了KPW与PL算法中"签名人可验证签名"这一缺陷。A nominative proxy signature scheme proposed by Huang Zhenjie is analyzed on its security feature,the scheme is vulnerable to original signer forgery attack and proxy signer forgery attack.An improved signature equation is proposed that has the feature of strong proxy.The new scheme can prevent the two attacks,the improved nominative feature can overcome the problem existed in KPW and PL schemes which could be described as ＂signer can verify the signature＂.

关 键 词：数字签名 指名代理签名 强代理签名 离散对数 

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