2008Computer Engineering and Applications JournalRequires access

Blind signature scheme based on bilinear pairings

Dang Rong-xiang

Open publisher page 0 citations

Abstract

A new efficient blind signature scheme based on bilinear pairings is proposed,compared with those proposed schemes.The new scheme can overcome the security drawbacks such as forgeability and deniability,which has the properties of high efficiency and low computation complexity etc.

About this research paper

What this paper is about

A new efficient blind signature scheme based on bilinear pairings is proposed,compared with those proposed schemes.The new scheme can overcome the security drawbacks such as forgeability and deniability,which has the properties of high efficiency and low computation complexity etc.

Why it matters

A significance statement is not available in the OpenAlex record.

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

A new efficient blind signature scheme based on bilinear pairings is proposed,compared with those proposed schemes.The new scheme can overcome the security drawbacks such as forgeability and deniability,which has the properties of high efficiency and low computation complexity etc.

Key concepts: Bilinear interpolation, Scheme (mathematics), Signature (topology), Computer science, Computation, Blind signature, Cryptography, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Blind signature scheme based on bilinear pairings — Research Paper | ScholarLens