2008•Unpublished venueRequires access

New Efficient Group Blind Signature Scheme with Membership Revocation and Unlinkability

Chunmei Song

Open publisher page 0 citations

Abstract

A new efficient group blind signature scheme with membership revocation on the basis of ACJT group scheme was provided.Drawing on the thought of the membership revocation of Chen,in the process of signature,it only uses a random number to decrease two zero-knowledge proofs of the original program to one,and decreases the mode index operation,thus shortens the length of signatures,while the group blind signature thinking proposed by C.Popescu is joined in the signature process,increases blind to the improved group signature with the membership revocation,and the program has also effectively addressed the flaw of linkability of the group blind signature programs proposed by C.Popescu.The new efficient group blind signature scheme with membership revocation and unlinkability can be applied to multi-bank electronic cash system,used to realize the multi-bank electron cash system which can abolish the group members,enables the electronic cash system to conform to the application of the real financial system.

About this research paper

What this paper is about

A new efficient group blind signature scheme with membership revocation on the basis of ACJT group scheme was provided.Drawing on the thought of the membership revocation of Chen,in the process of signature,it only uses a random number to decrease two zero-knowledge proofs of the original program to one,and decreases the mode index operation,thus shortens the length of signatures,while the group blind signature thinking proposed by C.Popescu is joined in the signature process,increases blind to the improved group signature with the membership revocation,and the program has also effectively addressed the flaw of linkability of the group blind signature programs proposed by C.Popescu.The new efficient group blind signature scheme with membership revocation and unlinkability can be applied to multi-bank electronic cash system,used to realize the multi-bank electron cash system which can abolish the group members,enables the electronic cash system to conform to the application of the real financial system.

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 group blind signature scheme with membership revocation on the basis of ACJT group scheme was provided.Drawing on the thought of the membership revocation of Chen,in the process of signature,it only uses a random number to decrease two zero-knowledge proofs of the original program to one,and decreases the mode index operation,thus shortens the length of signatures,while the group blind signature thinking proposed by C.Popescu is joined in the signature process,increases blind to the improved group signature with the membership revocation,and the program has also effectively addressed the flaw of linkability of the group blind signature programs proposed by C.Popescu.The new efficient group blind signature scheme with membership revocation and unlinkability can be applied to multi-bank electronic cash system,used to realize the multi-bank electron cash system which can abolish the group members,enables the electronic cash system to conform to the application of the real financial system.

Key concepts: Revocation, Group signature, Blind signature, Electronic cash, Computer science, Signature (topology), Group (periodic table), Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
New Efficient Group Blind Signature Scheme with Membership Revocation and Unlinkability — Research Paper | ScholarLens