METHOD AND APPARATUS FOR SECURE NON-INTERACTIVE THRESHOLD SIGNATURES

摘要

The present principles provide a threshold signature scheme. Considering n players, given asymmetric bilinear groups (G, Ĝ, G_T) with generators g, h, g̃, h̃, X, Y ∈_R G and g̃_z, g̃_r ∈_R Ĝ, each player chooses a set of random _t-degree polynomials, and generate a set of partial homomorphic signature on several linearly independent vectors. The public key PK may be obtained based on the set of polynomials and the partial homomorphic signatures of n players. The private key share and verification key for a player can be defined based on the set of polynomials. The signature for the message can be obtained from t partial signatures, wherein each partial signature can be generated based on the player's private key share and some random variables. Whether a partial signature is valid can be determined based on the public key PK and the verification key. Whether the signature for the message is valid can be determined based on the public key PK.