Efficient Scheme of (t,n) Threshold Group Signature
Min Huang
Abstract
Min Huang
Abstract
An efficient threshold signature scheme based on the difficulty of discrete logarithm problem and secret sharing method was proposed.Distribution Center(DC) shares the signature secret key with group members by the method of optional quotient.DC generates threshold Signature according to the sharing signatures after the identity and correctness verification.The identity and time stamp of the sharing signature members are recorded in the database prepared for arbitrating the dispute in the future.The analysis from correctness,security and efficiency shows that the proposed scheme is effective and secure.
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.
An efficient threshold signature scheme based on the difficulty of discrete logarithm problem and secret sharing method was proposed.Distribution Center(DC) shares the signature secret key with group members by the method of optional quotient.DC generates threshold Signature according to the sharing signatures after the identity and correctness verification.The identity and time stamp of the sharing signature members are recorded in the database prepared for arbitrating the dispute in the future.The analysis from correctness,security and efficiency shows that the proposed scheme is effective and secure.
Key concepts: Correctness, Computer science, Signature (topology), Discrete logarithm, Secret sharing, Ring signature, Group signature, Theoretical computer science