电子学报 ›› 2016, Vol. 44 ›› Issue (8): 1845-1850.DOI: 10.3969/j.issn.0372-2112.2016.08.011

• 学术论文 • 上一篇    下一篇

一种可证安全的紧致无证书聚合签名方案

许艳1,2, 黄刘生1,3, 田苗苗1,3, 仲红2, 崔杰2   

  1. 1. 中国科学技术大学计算机科学与技术学院, 安徽合肥 230026;
    2. 安徽大学计算机科学与技术学院, 安徽合肥 230601;
    3. 中国科学技术大学苏州研究院, 江苏苏州 215123
  • 收稿日期:2015-01-15 修回日期:2015-09-14 出版日期:2016-08-25
    • 作者简介:
    • 许艳 女,1982年生,现为中国科学技术大学计算机科学与技术学院博士生,研究方向为信息安全和密码学.E-mail:xuyan@ahu.edu.cn;黄刘生 男,1957年生,现为中国科学技术大学计算机科学与技术学院教授,博士生导师,主要研究方向为无线传感网络、信息安全和分布式计算.
    • 基金资助:
    • 国家电网基础前瞻性项目 (No.XXN51201304253); 国家自然科学基金 (No.61572001,No.61502443); 中国博士后科学基金 (No.2015M570545); 安徽省自然科学基金 (No.201508085QF132); 安徽大学信息保障技术协同创新中心开放课题 (No.ADXXBZ2014-9)

A Provably Secure and Compact Certificateless Aggregate Signature Scheme

XU Yan1,2, HUANG Liu-sheng1,3, TIAN Miao-miao1,3, ZHONG Hong2, CUI Jie2   

  1. 1. School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230026, China;
    2. School of Computer Science and Technology, Anhui University, Hefei, Anhui 230601, China;
    3. Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou, Jiangsu 215123, China
  • Received:2015-01-15 Revised:2015-09-14 Online:2016-08-25 Published:2016-08-25
    • Supported by:
    • Basic Prospective Project of State Grid Corporation of China (No.XXN51201304253); National Natural Science Foundation of China (No.61572001, No.61502443); China Postdoctoral Science Foundation (No.2015M570545); Natural Science Foundation of Anhui Province (No.201508085QF132); Open Program of Information Assurance Technical Collaborative Innovation Center of Anhui University (No.ADXXBZ2014-9)

摘要: 聚合签名能够实现批验证,特别适用于资源受限的无线网络中批量身份认证.无证书密码体制能够解决聚合签名的证书管理或私钥托管问题.本文首先对一个无证书聚合签名方案进行分析,随后提出更加安全高效的无证书聚合签名方案,方案验证时需要更少的双线性对操作.最后在随机预言模型下证明方案具有不可伪造性,其安全性等价于求解CDH(Computation Diffie-Hellman)困难问题.

关键词: 无证书密码学, 聚合签名, 随机预言模型

Abstract: Aggregate signature schemes are particularly useful for authentication in resource-constrained wireless networks for realizing batch verification.Certificateless cryptosystems can resolve the certificate management problem or key escrow problem in aggregate signature schemes.This paper firstly analyzed a certificatelss aggregate signature(CLAS) scheme.Then,a more efficient CLAS scheme that requires less bilinear paring operations was provided.The security analysis showed that this scheme can resist the forgery attack under the random oracle model,the security was equal to resolve CDH problem.

Key words: certificateless cryptography, aggregate signature, random oracle model

中图分类号: