An Efficient Signcryption Algorithm with Shortened Ciphertext Based on Bilinear Pairing

Signcryption is a novel cryptographic system which can prove confidentiality and authenticity simultaneously.While the known signcryption schemes with low communication performance is the bottleneck which influenced the broad application of sigcryption.An efficient signcryption algorithm with shortened ciphertext based on BLS signature is proposed in this paper.It is provable security in random oracle model under GDH assumption.With present secure parameters,the data rate of proposed algorithm is 76%.It has the highest communication performance in all of known schemes.The algorithm is suitable for resource constrained applications.