2008Modern ComputerRequires access

A New Blind Signature Scheme Based on Bilinear Pairings

Qun Lin

Open publisher page 0 citations

Abstract

In a blind signature scheme, the user can obtain the signature of a message in a way that the signer learns neither the message nor the resulting signature, so the privacy of the user is protected. Proposes a new blind signature scheme based on bilinear pairings, the scheme has the advantages of efficiency and security.

About this research paper

What this paper is about

In a blind signature scheme, the user can obtain the signature of a message in a way that the signer learns neither the message nor the resulting signature, so the privacy of the user is protected. Proposes a new blind signature scheme based on bilinear pairings, the scheme has the advantages of efficiency and security.

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

In a blind signature scheme, the user can obtain the signature of a message in a way that the signer learns neither the message nor the resulting signature, so the privacy of the user is protected. Proposes a new blind signature scheme based on bilinear pairings, the scheme has the advantages of efficiency and security.

Key concepts: Computer science, Blind signature, Signature (topology), Bilinear interpolation, Scheme (mathematics), ElGamal signature scheme, Ring signature, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Blind Signature Scheme Based on Bilinear Pairings — Research Paper | ScholarLens