基于DLP的自认证盲签密方案  

Self-certified blind signcryption scheme based on Discrete Logarithm Problem

作　　者：俞惠芳[1] 王彩芬[2] 王之仓[1] 

机构地区：[1]青海师范大学计算机系,西宁810008 [2]西北师范大学数学与信息科学学院,兰州730070

出　　处：《计算机工程与应用》2010年第23期119-121,共3页Computer Engineering and Applications

基　　金：教育部科学技术研究重点项目No.208148;甘肃省科技攻关计划No.2GS064-AS2-035-03~~

摘　　要：盲签密指盲签密者对其所签署的信息是不可见的,而且签密消息不可跟踪。有机集成自认证公钥密码系统和盲签密思想,提出了一个新的基于离散对数问题(DLP)的自认证盲签密方案。所提方案具有盲签密的各种安全特性;权威机构不知道用户私钥;不需要对用户的公钥进行单独认证;具有计算效率高、通信成本低、安全性强和算法简单等优点,适合于在电子商务和电子政务中应用。Blind signcryption is that the blind signcrypter sees nothing about the signed message and can not trace the blind signcryption.By applying the concept of self-certified public key to blind signcryption,a new self-certified blind signcryption scheme based on Discrete Logarithm Problem（DLP）is presented.The new scheme keeps all kinds of security properties of blind signcryption;the system authority does not know the private key of the user;no certificate is required to verify the authenticity of public key;it has higher computational efficiency,lower communication overheads and better security,however,the algorithm is simple,so it is more suitable for applications in E-commerce and E-government.

关 键 词：自认证密码学 盲签密 离散对数问题 DIFFIE-HELLMAN问题 

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