一种可快速验证的可聚合BLS签名方案  

An Aggregable BLS Signature Scheme with Fast Verification

作　　者：潘天雨 赵运磊 PAN Tian-Yu;ZHAO Yun-Lei(School of Computer Science,Fudan University,Shanghai 200433,China)

机构地区：[1]复旦大学计算机科学技术学院,上海200433

出　　处：《密码学报（中英文）》2024年第4期799-806,共8页Journal of Cryptologic Research

摘　　要：BLS签名是一种双线性映射友好椭圆曲线上的数字签名方案,它具有签名大小短、在聚合签名场景中验证高效、支持同态性与非交互聚合等优点.但由于需要进行双线性映射操作,单个BLS签名的验证算法相对较慢,这阻碍了其在区块链系统中进一步的应用.本文提出了一种BLS签名方案的变体—CPABLS,其主要优点如下:第一,将Chaum-Pedersen离散对数相等性证明纳入签名中,使得签名验证算法不再需要双线性映射操作,从而提升了验证速度;第二,在公钥聚合时只需对各个签名者的公钥简单求和,而无需进行大量的标量乘法操作;第三,相比于群G2,签名验证算法可在群G1中更快地进行哈希到曲线和聚合公钥检验操作.给出了该方案在聚合签名安全模型中的安全证明及原型实现,并进行了性能测试与效率评估.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 G1.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.

关 键 词：BLS聚合签名 Chaum-Pedersen证明 高效验证 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]