摘要
为了抵抗适应性选择消息攻击、提高签名生成效率、加强秘密共享,提出一种新的RSA-TBOS广义签密方案.与韩益亮的广义签密方案相比,本方案是基于RSA大整数分解的困难性,且密钥长度的下限为160bits,能够实现短签密.其计算量大小介于韩益亮的方案和J.Malone-Lee的方案之间.同时,由于方案的签名是两部分消息经过随机化填充后的连接,因此,可以抵抗中间相遇攻击.经过证明,方案IND-CCA2是安全的.
To resist adaptive chosen ciphertext attack, improve efficiency of the signcryption generation and strengthen the possibility to share secret, a publicly verifiable generalized signcryption scheme is put forword. Compared with Han Yi-liang＇s our scheme ismainly based on the difficulty of the decomposition of RSA biginteger, and the length of the secret key in the scheme is not more than 160 bites and it can realize short signcryption. The computational complexity of our scheme is between that of Han yi-liang＇s and Malone-Lee＇s. Because the signature in the new scheme is the linkage of two information after padding at random, it can resist the middle meeting attack. Finally, parts of IND-CCA2 security of the new seheme is proved.
出处
《河北北方学院学报（自然科学版）》
2011年第6期20-28,共9页
Journal of Hebei North University:Natural Science Edition
基金
安徽省教育厅自然科学项目(KJ2010B059)
安徽科技学院安徽省自然科学基金预研项目(ZRC2011274)
关键词
签密
广义签密
数字签名
可公开验证
signcryption
generalized signcryption
digital signature
public verifiable
