摘要

A formal model of certificateless aggregate signcryption is proposed, which allows n different users to signcrypt n different messages. Then we propose a concrete certificateless aggregate signcryption scheme. Based on the Bilinear Diffie-Hellman Problem and Computational Diffie-Hellam Problem, the proposed scheme captures indistinguishability of encryptions under adaptively chosen ciphertext attacks (IND-CCA2) and existential unforgeability against chosen message attacks (EUF-CMA) in the random oracle model.