Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
