摘要
签密能够同时实现加密和认证的功能,并且计算代价小于传统的组合方式.本文提出了一个基于Paillier密码体制的签密方案,在不明显增加计算复杂性和密文长度的条件下,达到了签密的安全需求;文中详细描述了方案的加解密过程,定义了方案的安全模型,并在随机预言机模型下对方案的安全性进行了证明;通过与几个经典方案的对比,分析了方案的效率,从数据表中可以看出方案效率的提升效果;通过全文的论述,可以看出本文中的方案能够达到较高的保密性,满足不可伪造性和不可否认性,并且在实现上具有较高的效率.
Signcryption can realize encryption and signature at the same time. And its computational complexity is easier than the tra- ditional secure schemes that fulfill the functions both. This paper proposals a signcryption schemes based on Paillier＇s public-key cryp- tosystem without increasing the computational complexity and the length of the ciphertext. The details of the signcryption scheme are included in the paper. The paper defines the secure model and proves the security of the schemes under the random oracle model. The paper also analyses the efficiency through comparing with several typical schemes. The data table shows the improvement of the scheme. The consequence of the analysis indicates that the schemes have confidentiality, existential unforgeability and non-repudia- tion. And the schemes have relatively higher efficiency.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第10期2310-2314,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61103231
61272492)资助
陕西省自然科学基础研究计划项目(2011JM8012)资助
关键词
签密
Paillier密码体制
可证明安全
signcryption
paillier＇s cryptosystem
public verifiability
provable security
