Multi-recipient Signcryption Algorithm for Communication of Mobile Ad Hoc Networks

Since more and more applications of mobile ad hoc networks have been proposed, its communication security has become one of the biggest research challenges nowadays. In this paper, a new signcryption scheme was proposed which has multiple recipients. The proposed scheme is based on bilinear pairing and identity cryptography. The analysis results show that the scheme is provable secure in the random oracle model. Furthermore, it is significantly efficient as this scheme has less computation and storage requirements.