摘要
为了保护原始签名者的个人隐私,同时更好地确保代理签名的强不可否认性,在代理授权阶段引入指定验证者的思想,构造了一个基于离散对数难题的强不可否认的指定验证者代理签名方案。新方案不仅实现了只有代理签名者才能验证原始签名者的授权签名,而且确保了当代理签名者否认代理签名时,指定验证者可以在不造成安全隐患的前提下,向公众验证签名,指认代理签名者的身份。性能分析表明,该方案具有较高的效率,且满足代理签名的各种安全性要求。
To protect the original signer＇ s personal privacy and at the same time better ensure the proxy signature ＇ s strong undeniability, integrated the designated-verifier thought into proxy delegation phase, this paper proposed a strongly undeniable proxy signature scheme based on the discrete logarithm problem. The new scheme not only realized that only the proxy signer could verify the delegation signature generated by the original signer, but also ensured that when the proxy signer denied his proxy signature, the designated verifier could verify the proxy signature to the public, and pointed out the proxy signer without any hidden danger. Performance analysis shows that the scheme has higher efficiency and satisfies all the secure properties of proxy signature.
出处
《计算机应用研究》
CSCD
北大核心
2011年第12期4629-4630,4634,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(60873247)
山东省高新自主创新专项工程(2008ZZ28)
山东省自然科学基金资助项目(ZR2009GZ007)
关键词
数字签名
代理签名
指定验证者
离散对数
强不可否认性
digital signature
proxy signature
designated verifier
discrete logarithms
strong undeniability
