您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4 ›› 2013, Vol. 48 ›› Issue (09): 29-34.

• 论文 • 上一篇    下一篇

改进的无证书聚合签名方案

侯红霞1,2,张雪锋2,董晓丽2   

  1. 1.陕西师范大学计算机科学学院,陕西 西安710062;  2.西安邮电大学通信与信息工程学院, 陕西 西安 710121
  • 收稿日期:2013-06-17 出版日期:2013-09-20 发布日期:2013-09-25
  • 作者简介:侯红霞(1980- ),女,讲师,主要研究方向为应用密码学. Email: hhx315@126.com
  • 基金资助:

    陕西省自然科学基金资助项目(2009MJ80023);陕西省教育厅项目(12JK0551);西安邮电大学省级重点学科建设项目

Improved certificateless aggregate signature scheme

HOU Hong-xia1,2, ZHANG Xue-feng2, DONG Xiao-li2   

  1. 1. School of Computer Science, Shaanxi Normal University, Xi’an 710062, Shaanxi, China;
    2.School of Communication and Information Engineering, Xi’an University of Posts & Telecommunications,
    Xi’an 710121, Shaanxi, China
  • Received:2013-06-17 Online:2013-09-20 Published:2013-09-25

摘要:

 聚合签名是近年被关注的一个热点。基于无证书密码体制,构造了一个改进的无证书聚合签名方案,较之于已有的方案,本方案的对运算是常量的,只需3次对运算,提高了签名验证时的效率。改进的方案可以抵抗无证书攻击模型中类型Ⅰ敌手与类型Ⅱ敌手的攻击,在计算性DiffieHellman困难问题假设下,该方案是存在性不可伪造的,并在随机预言机模型中给出了方案的安全性证明。

关键词: 无证书密码体制;聚合签名;双线性对

Abstract:

Recently, the aggregate signature is a hot topic concerned. An improved cerificateless aggregate signature scheme is constructed based on the certificateless cryptography. Compared with the existing schemes, the scheme has constant pairing computations, and the verification algorithm only requires three pairing computations, which greatly improves the efficiency of the signature verification. The improved scheme can resist the attack of TypeⅠand TypeⅡadversary in certificateless adversary model,and it is existentially unforgeable under the computational DiffieHellman assumption.The security proof of the improved scheme is given in the random oracle model.

Key words: certificateless cryptography; aggregate signature; bilinear pairing

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!