2011Unpublished venueRequires access

Self-Certified Proxy Blind Signcryption Scheme from Pairings

Huifang Yu, Liqin Tian, Wang Zhi-cang

Open publisher page 2 citations

Abstract

By integrating the thoughts of self-certified signcryption and proxy blind signature, we propose a new self certified proxy blind signcryption scheme from pairings and prove its security in the random oracle model. The proposed overcomes the certificate existence problem and the key escrow problem in public key cryptosystem. In the scheme, the original signcrypter can delegate the signcryption power to a proxy blind signcrypter, then the proxy blind signcryption can be generated by the proxy blind signcrypter and the message owner, the proxy blind signcrypter learns nothing about the signed message and can not trace the proxy blind signcryption. Analysis shows the new scheme has lower communication overheads and computation efforts, furthermore, its efficiency is better than the existing literatures, so it has more practical value in applications.

About this research paper

What this paper is about

By integrating the thoughts of self-certified signcryption and proxy blind signature, we propose a new self certified proxy blind signcryption scheme from pairings and prove its security in the random oracle model. The proposed overcomes the certificate existence problem and the key escrow problem in public key cryptosystem. In the scheme, the original signcrypter can delegate the signcryption power to a proxy blind signcrypter, then the proxy blind signcryption can be generated by the proxy blind signcrypter and the message owner, the proxy blind signcrypter learns nothing about the signed message and can not trace the proxy blind signcryption. Analysis shows the new scheme has lower communication overheads and computation efforts, furthermore, its efficiency is better than the existing literatures, so it has more practical value in applications.

Why it matters

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

By integrating the thoughts of self-certified signcryption and proxy blind signature, we propose a new self certified proxy blind signcryption scheme from pairings and prove its security in the random oracle model. The proposed overcomes the certificate existence problem and the key escrow problem in public key cryptosystem. In the scheme, the original signcrypter can delegate the signcryption power to a proxy blind signcrypter, then the proxy blind signcryption can be generated by the proxy blind signcrypter and the message owner, the proxy blind signcrypter learns nothing about the signed message and can not trace the proxy blind signcryption. Analysis shows the new scheme has lower communication overheads and computation efforts, furthermore, its efficiency is better than the existing literatures, so it has more practical value in applications.

Key concepts: Signcryption, Random oracle, Proxy (statistics), Computer science, Public-key cryptography, Delegate, Cryptosystem, Blind signature

Related papers

Back to paper searchBrowse research topicsOriginal source
Self-Certified Proxy Blind Signcryption Scheme from Pairings — Research Paper | ScholarLens