改进的签名长度固定的无证书聚合签名方案  

Improved certificateless aggregate signature with constant length

作　　者：陈明[1] 

机构地区：[1]宜春学院数学与计算机科学学院,江西宜春336000

出　　处：《计算机应用研究》2016年第1期271-275,280,共6页Application Research of Computers

基　　金：江西省宜春市科技计划资助项目(JXYC2014KSB003);江西省自然科学基金项目(2014ZBAB207022)

摘　　要：现有的具有固定签名长度的无证书聚合签名(certificateless aggregate signatures,CLAS)方案要么存在安全缺陷,要么通信开销较大。提出一种改进的CLAS方案,由聚合人选择整数域上的随机参数替代状态信息,并且广播给所有签名者。在随机预言模型下,改进方案被规约为多项式时间敌手求解CDH(computational DiffieHellman)难题,具有可证明安全性。对比分析表明,在改进的CLAS方案中,状态信息协商阶段仅需要一次广播通信,通信开销更低,易于实现。改进方案可用于在资源受限的网络环境下构建多对一的认证方案。The existing certificateless aggregate signature schemes with constant length have either known security flaws or large communication overheads. This paper presented an improved certificateless aggregate signature scheme. It substituted a random integer for slLate information, and broadcasted to all signers. The new scheme is provably secure in the random oracle model under the computational l）iffie-Hellman assumption against a polynomial time adversary. The comparative analysis indi- cates that the improved scheme has lower communication loads, and requires only 1 broadcast in status information negotiation phase. With the new scheme,it is easier to construct many-to-one authentication schemes in a resource-constrained network en- vironment.

关 键 词：无证书密码学 聚合签名 随机预言模型 不可伪造性 

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