2010Unpublished venueRequires access

An efficient signcryption scheme with shortened ciphertext

Junru Hu, Yi Ding

Open publisher page 3 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 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

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.

Key concepts: Signcryption, Random oracle, Ciphertext, Computer science, Semantic security, Provable security, Discrete logarithm, Scheme (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient signcryption scheme with shortened ciphertext — Research Paper | ScholarLens