Identity-based Signcryption Scheme
Jun Li · Jisuanji gongcheng · 2010
This paper proposes a new identity-based signcryption scheme using bilinear pairings and proves its security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman(BDH) problem.The scheme satisfies confidentiality,unforgeability,nonrepudiation,public verification and forward security.It only costs four pairing operations and two of them can be precomputed.Compared with the efficient schemes up to date,computation cost of the proposed scheme is less.