By Topic

BPGSC: Bilinear Paring Based Genearlized SignCryption Scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yiliang Han ; Dept. of Comput. Sci. & Technol., Xi''an Jiaotong Univ., Xi''an, China ; Xiaolin Gui

Generalized signcryption is a novel cryptographic primitive, which provides encryption and authenticity services simultaneously or separately. The known schemes have the low communication performance and fail to deliver data stream. Based on bilinear pairing, an efficient generalized signcryption scheme with the shortened ciphertext called BPGSC is proposed. Combined with the hash-chained mechanism and KEM/DEM (key encapsulation mechanism/data encapsulation mechanism), the hybrid BPGSC is proposed also. Formal security analysis showed that BPGSC is a provable secure scheme in random oracle model under GDH (Gap Diffie-Hellman) assumption. With present secure parameters, the data rate of proposed scheme is 76%. It has the highest communication performance in all of known schemes.

Published in:

Grid and Cooperative Computing, 2009. GCC '09. Eighth International Conference on

Date of Conference:

27-29 Aug. 2009