摘要
基于Diffie-Hellman问题的困难假设和Hash函数,提出了相关双线性对的代理盲签名方案,并对所提方案进行了安全性分析。该方案通过设计简单易计算的签名密钥λ和盲化因子K,使得计算更加简便,运行更加高效,同时更好地保护用户的隐私。
Aiming at the assumption of the difficult Diffie-Hellman problems and Hash functions,a novel proxy blind signature scheme based on bilinear pairings was proposed,and its security was analyzed.In this scheme,the proxy signature key λ and the blind factor Kwere simpler compared to the up-to-date schemes.The new scheme not only achieves the security requirements of proxy blind signature,but also reduces computation complexity and improves the efficiency.
出处
《桂林电子科技大学学报》
2011年第4期319-321,共3页
Journal of Guilin University of Electronic Technology
基金
国家自然科学基金(60963024)
关键词
代理盲签名
双线性对
盲性
不可链接性
proxy blind signature
bilinear pairings
blindness
unlinkability