An Efficient Signcryption Schemes Based from Bilinear Maps in the Standard Model

Abstract

Signcryption is an important crypto graphical primitive, it can realize encryption and authentication with less computational cost in a logic step. At present, for most of signcryption schemes, the security of their schemes is proven to be secure in the random oracle model. In fact, certain artificial protocols are known which are proven secure in the random oracle model, but which are trivially insecure when any real function is substituted for the random oracle. Thus, it is very important to construct a signcryption scheme in the standard security model. In this work, we propose a novel signcryption scheme from bilinear map. And we show the scheme is secure in the standard model and the security of the scheme is related to strong Diffie-Hellman problem.