摘要
为了解决盲签名中由于签名者无法控制签名内容以及已有半签名方案由于计算复杂度高而不实用的问题,提出了一种低计算复杂度的半盲签名方案,并给出了随机预言机模型下的安全性证明.新方案简化了交互过程中请求方和签名方之间的交互轮次,降低了在签名过程中的计算复杂度.与Masayuki Abe和Tatsuaki Okamoto的方案相比,新方案具有更高的效率.低计算复杂度的特性使得新方案非常适用于移动终端和智能卡环境.
To solve the issues that a signer couldn't predominate the contents when he signs a blind signature and the unpractical efficiency of the existing partially blind signature for high computation, a model of simple partially blind signature with low computation is presented. A detail formal security proof in the random oracle model is given. The new algorithm simplifies the process of the interaction between the signer and requestor, reduces the signature process in computational complexity. Com- pared with the scheme due to Masayuki Abe and Tatsuaki Okamoto, the new scheme is more efficient. The low-computation property will make the new scheme very attractive for mobile client and smartcard implementation.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2009年第3期123-126,共4页
Journal of Beijing University of Posts and Telecommunications
基金
高等学校学科创新引智计划项目(B08038)
国家自然科学基金项目(60702060)
国家重点实验室专项基金项目(ISN03080005)