基于离散对数问题的自认证签密方案  

SELF-CERTIFIED SIGNCRYPTION SCHEME BASED ON DISCRETE LOGARITHM PROBLEM

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

机构地区：[1]青海师范大学计算机系,青海西宁810008

出　　处：《计算机应用与软件》2010年第10期138-139,224,共3页Computer Applications and Software

基　　金：青海省科技厅软课题项目(2008-Z-620)

摘　　要：现有的自认证签名方案大多都是基于椭圆曲线或双线性对的。文章集成自认证公钥技术和签密体制,提出了一种新的基于离散对数问题的自认证签密方案。在有限域上离散对数问题的困难性假设下,新构造的方案被证明是安全的。方案消除了证书管理问题和密钥托管问题,通信成本和计算量远远低于传统的"先签名后加密"的方案,而且效率高、易于实现,适合于在实际中应用。As most of existing self-certified signature schemes are based on elliptic curve or bilinear pairings,we propose a new self-certified signcryption scheme based on discrete logarithm problem in the paper by integrating the self-certified public key technique and signcryption system.Under the hardness hypothesis of discrete logarithm problem in finite field,the new constructed scheme is proved secure.The scheme overcomes certificate management problem and key escrow problem;there are lower computational costs and communication overheads than the traditional signature-then-encryption schemes;moreover,it has high efficiency and is convenient to implement,so it is more propitious to applications in practice.

关 键 词：自认证公钥密码学 自认证签密 离散对数问题(DLP) 签密技术 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]