New RSA-TBOS Generalized Signcryption Scheme
Feng Shen · Journal of Hebei North University · 2011
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.