Research On Certificate-Based Multi-Receiver Signcryption Scheme

Multi-receiver signcryption mechanism can not only achieve encryption and signature in one logical operation,but also can utilize one ciphertext to send the same or different messages to multiple different receivers,so it can achieve secure multicast communication.Therefore,the research of multi-receiver signcryption mechanism has important theoretical value and practical significance and has become a hot topic in cryptography.In this paper,the multi-receiver signcryption mechanism is studied,mainly including:Aiming at the problem of the certificate management,key escrow,key distribution,identity privacy leakage,high computation and communication cost in the existing multi-receiver signcryption schemes,using the elliptic curve cryptography technology and certificate-based cryptography,this paper proposes an efficient anonymous certificate-based multi-receiver signcryption scheme.Through security analysis,in the random oracle model,based on decisional Diffie-Hellman assumption,it is proved that the proposed scheme satisfies the indistinguishability and anonymous indistinguishability under adaptive chosen ciphertext attack;based on elliptic curve discrete logarithm assumption,it is proved that the proposed scheme satisfies the unforgeability under adaptive chosen message attack.Through performance analysis,the proposed scheme has an efficient computation and communication cost compared with the existing schemes.Aiming at the problem of the certificate management,key escrow,key distribution,identity privacy leakage,high computation cost and high communication cost in the existing multi-message and multi-receiver signcryption schemes,integrating the elliptic curve cryptography technology and certificate-based cryptography,this paper proposes an efficient anonymous certificate-based multi-message and multi-receiver signcryption scheme,respectively.Through security analysis,in the random oracle model,under the decisional Diffie-Hellman assumption,the proposed scheme satisfies the indistinguishability and anonymous indistinguishability under adaptive chosen ciphertext attack;under the elliptic curve discrete logarithm assumption,the proposed scheme satisfies the unforgeability under adaptive chosen message attack.Through performance analysis,the proposed scheme has the more efficient computation and communication cost than the existing schemes.