ScholarLens Back to search
2009•Unpublished venueRequires access

BPGSC: Bilinear Paring Based Genearlized SignCryption Scheme

Yliang Han, Xiaolin Gui

Open publisher page 4 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Signcryption, Random oracle, Ciphertext, Computer science, Key encapsulation, Cryptographic primitive, Encryption, Bilinear interpolation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
BPGSC: Bilinear Paring Based Genearlized SignCryption Scheme — Research Paper | ScholarLens