首页 | 本学科首页   官方微博 | 高级检索  
     

一个基于CPK的高效签密方案
引用本文:陈永刚,贾春福,吕述望.一个基于CPK的高效签密方案[J].电子与信息学报,2009,31(7):1753-1757.
作者姓名:陈永刚  贾春福  吕述望
作者单位:1. 南开大学信息技术科学学院,天津,300071
2. 信息安全国家重点实验室,北京,100049
基金项目:天津市应用基础及前沿技术研究计划项目(09JCBJC00300);;天津市科技发展计划项目基金(05YFGZGX24200)资助课题
摘    要:基于组合公钥原理,该文提出一个新的签密方案CPK-SC,抛弃了传统基于身份签密方案中的配对运算,并通过使用对称密码算法解决了传统基于身份签密方案只能处理定长消息的限制。与已有的基于双线性对的签密方案相比,CPK-SC方案计算量小、生成密文短,适用于计算和通信资源受限环境,具有广泛的应用前景。在判定性Diffie-Hellman(DDH)假设下,论文通过随机预言模型证明了CPK-SC的安全性。

关 键 词:签密  组合公钥  随机预言模型  Decisional  Diffie-Hellman(DDH)
收稿时间:2008-9-8
修稿时间:2009-1-12

An Efficient Signcryption Scheme Based on CPK
Chen Yong-gang,Jia Chun-fu,Lü Shu-wang.An Efficient Signcryption Scheme Based on CPK[J].Journal of Electronics & Information Technology,2009,31(7):1753-1757.
Authors:Chen Yong-gang  Jia Chun-fu  Lü Shu-wang
Affiliation:College of Information Technical Science, Nankai University, Tianjin 300071, China; State Key Laboratory of Information Security, Beijing 100049, China
Abstract:In this paper, a new signcryption scheme called CPK-SC is proposed based on Combined Public Key (CPK) to resolve the authentication and non-repudiation problem. CPK-SC discards the pairings and solves the restriction that the traditional identity-based signcryption schemes can only deal with fixed length messages by introduction symmetric cryptography algorithm. CPK-SC spends fewer computations and produces shorter ciphertext, which can be widely used in the environment of computation and communication resource constrained, such as mobile ad-hoc network. In the random oracle model, the security of CPK-SC is tightly related to the Decision Diffie-Hellman (DDH) assumption.
Keywords:Signcryption  Combined Public Key (CPK)  Random oracle model  Decisional Diffie-Hellman (DDH)
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号