Public Verifiability Signcryption Scheme Based on Hess’s Signature
Bin Kang · Jisuanji gongcheng · 2008
Utilizing Hess’s identity-based signature scheme, this paper proposes a public verifiability signcryption scheme. In the random oracle model, the proposed scheme is proved to be secure assuming the bilinear Diffle-Hellman problem is hard. As the authentication and recovery are separated in this scheme, anyone can identify the source of the ciphertext without the plaintext. What’s more, the proposed scheme has forward security. Even if the secret key is compromised, the attackers can not recover the signcryption of the past time. As compared with the most efficient Chen Malone-Lee scheme to date, the proposed scheme decreases one pairing operation and only requires two pairing operations.