一个常数对基于证书聚合签名方案  

A Certificate-based Aggregate Signature with Constant Pairing

作　　者：陈建能[1] 陈群山[1] 

机构地区：[1]闽南师范大学计算机科学与工程系,福建漳州363000

出　　处：《漳州师范学院学报（自然科学版）》2013年第3期50-53,共4页Journal of ZhangZhou Teachers College（Natural Science)

基　　金：国家自然科学基金(61170246);福建省自然科学基金项目(2012J01295);福建省教育厅项目(JA12219);漳州师学院杰青项目(SJ1116)

摘　　要：基于证书公钥密码体制是新近提出的一类新型公钥密码体制,它克服了基于身份密码体制的密钥托管问题和传统公钥密码体制下的证书管理问题.聚合签名是一种可将不同签名者对不同消息的签名聚合成一个单一签名的数字签名技术.然而,在聚合签名的验证过程中,随着聚合人数的增加,运算量也线性地增加.本文利用双线性对和Computational Diffie-Hellman困难性问题构造了一个常数对运算基于证书的聚合签名方案.Certificate-based public key cryptography is a new public key cryptosystem proposed recently, which overcomes the key escrow problem in the identity-based public key cryptography and the certificate management problem in traditional public key system. An aggregate signature scheme can aggregate signatures on distinct messages from distinct users into a single signature. However, in the signature verification process, with the increase in the number of users, the amount of computation increases linearly. Based on bilinear pairings and the hardness of Computational Diffie-Hellman problem, a certificated-based aggregate signature scheme with Constant Pairing is proposed.

关 键 词：数字签名 基于证书 聚合 双线性对 

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