Efficient Identity-based Ring Signcryption Scheme in the Standard Model

Abstract

According to most existing identity-based ring signcryption schemes are based on random oracle model and have too many pairings, a new efficient identity-based ring signcryption scheme is proposed. It can satisfy the unconditional anonymity of the sender by using symmetric encryption algorithm and reduce the pairings by skillfully setting public parameters. Its indistinguishability under adaptive chosen ciphertext attack is proofed by the intractability of the DBDH problem and the unforgeability under adaptive chosen message attack is proved by the intractability of the CDH problem.