Title :
An efficient certificateless aggregate signcryption scheme from pairings
Author :
Lu, Haijun ; Xie, Qi
Author_Institution :
Sch. of Inf. Sci. & Eng., Hangzhou Normal Univ., Hangzhou, China
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.
Keywords :
digital signatures; public key cryptography; bilinear Diffie-Hellman problem; chosen ciphertext attacks; chosen message attacks; computational Diffie-Hellam problem; concrete certificateless aggregate signcryption scheme; encryption indistinguishability; existential unforgeability; formal model; pairings; random oracle model; Adaptation models; Aggregates; Computational modeling; Games; Public key; aggregate signcryption; bilinear pairing; certificateless signcryption;
Conference_Titel :
Electronics, Communications and Control (ICECC), 2011 International Conference on
Conference_Location :
Ningbo
Print_ISBN :
978-1-4577-0320-1
DOI :
10.1109/ICECC.2011.6067635
