Title :
An efficient signcryption scheme with shortened ciphertext
Author :
Junru, Hu ; Yi, Ding
Author_Institution :
Key Lab. of Network & Inf. Security of APF, Eng. Coll. of APF, Xi´´an, China
Abstract :
Signcryption is a novel cryptographic primitive that prove confidentiality and authenticity simultaneously. In bandwidth-constrained environments, the data mount of ciphertext is the crucial factor that holds back its broad application. While most of the known schemes based on discrete logarithm problem and RSA problem, have the low communication performance. Based on BLS signature scheme, an efficient signcryption scheme with shortened ciphertext is proposed in this paper. It is provable secure in random oracle model under GDH (Gap Diffie-Hellman) assumption. With the present secure parameters, the data rate of proposed scheme is 76%. With the long term secure parameters, the data rate is 73%. It has the highest communication performance in all of the known schemes.
Keywords :
cryptography; digital signatures; BLS signature scheme; Gap Diffie-Hellman assumption; RSA problem; bandwidth-constrained environments; cryptographic primitive; discrete logarithm problem; random oracle model; shortened ciphertext; signcryption scheme; bilinear paring; digital signaturentroduction; signcryption;
Conference_Titel :
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-7235-2
Electronic_ISBN :
978-1-4244-7237-6
DOI :
10.1109/ICCASM.2010.5622329