摘要
现有的有向数字签名方案均采用了增加签名方和验证方的指数运算来实现接收者直接验证签名。提出了一个基于复合离散对数的有向数字签名方案,其运算量、签名的长度等效于离散对数的数字签名。相对于现有的有向数字签名方案,该方案在计算量和通信成本等方面有显著提高。
Directed signature is a special signature in which signature can be verified only under the help of the receiver. A new efficient directed signature scheme based on the composite discrete logarithm in domain was presented. The new scheme requires less computational costs and communication overhead than the schemes proposed before.
出处
《计算机应用研究》
CSCD
北大核心
2007年第6期136-138,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(60273049
60303026)
关键词
有向数字签名
复合离散对数
有向验证性
不可否认性
directed signature
composite discrete logarithm
directed verifiability
unforge-ability