一种可快速验证的可聚合BLS签名方案OA北大核心CSTPCD

BLS signature is a digital signature scheme over pairing-friendly elliptic curves.It has the advantages of short signature size,efficient aggregate signature verification,supporting homomor-phism and non-interactive aggregation etc.However,due to the need for bilinear mapping operations,the verification algorithm for a single BLS signature is of low efficiency,which hinders its further ap-plication in blockchain system.This paper proposes a variant of BLS signature scheme—CPABLS,its main advantages are as follows:firstly,the Chaum-Pedersen discrete logarithm equality proof is included in the signature,so that the signature verification algorithm no longer needs the bilinear mapping operation,thereby improving the verification efficiency.Secondly,when the public key is aggregated,each signer's public keys can simply be summed without a large number of scalar multipli-cation operations.Thirdly,compared to in group G2,the signature verification algorithm can perform faster hash-to-curve and aggregate public key verification operations over group Gi.This paper gives a security proof of the aggregated signature security model and a prototype implementation of the scheme,together with performance tests and efficiency evaluation.