Improvement of Threshold Group Signature Scheme
Tong Lu, Baoyuan Kang
Abstract
Tong Lu, Baoyuan Kang
Abstract
A (t,n) threshold group signature scheme allows a singer to determine a (t,n) threshold strategy and only t or more signers of the group can sign messages on behalf of the group. Recently, Li et al. proposed a new threshold group signature scheme based on discrete logarithm problem, which is not only threshold-signing but also threshold-verifying. Unfortunately, their scheme are not secure, in their scheme the appointed group signer himself can generate a valid signature, which voilates unforgeability and threshold characteristics. Then we propose an improvement to overcome this security flaw.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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 (t,n) threshold group signature scheme allows a singer to determine a (t,n) threshold strategy and only t or more signers of the group can sign messages on behalf of the group. Recently, Li et al. proposed a new threshold group signature scheme based on discrete logarithm problem, which is not only threshold-signing but also threshold-verifying. Unfortunately, their scheme are not secure, in their scheme the appointed group signer himself can generate a valid signature, which voilates unforgeability and threshold characteristics. Then we propose an improvement to overcome this security flaw.
Key concepts: Discrete logarithm, Group signature, Signature (topology), Scheme (mathematics), Group (periodic table), Computer science, Schnorr signature, Sign (mathematics)