Blind signature scheme based on bilinear pairings
Dang Rong-xiang
Abstract
Dang Rong-xiang
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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