Verifiable Signcryption Scheme Based on Bilinear Pairs
Changshe Ma · Jisuanji gongcheng · 2010
In traditional signcryption scheme,signature can only be verified by the recipient,which implicates that signcryption can not be used to construct fair exchange protocols directly.Aiming at such problem,this paper presents a verifiable signcryption scheme and its security model.Based on bilinear pairs,an efficient verifiable signcryption algorithm is proposed.And the unforgeablity and security of the scheme in the random oracle model is proved.