• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2015, Vol. 37 ›› Issue (09): 1643-1651.

• 论文 • 上一篇    下一篇

一个可证安全的高效的代理盲签名方案

周明,王箭   

  1. (南京航空航天大学计算机科学与技术学院,江苏 南京 210016)
  • 收稿日期:2014-10-28 修回日期:2015-02-28 出版日期:2015-09-25 发布日期:2015-09-25

An efficient and provably secure proxy blind signature scheme 

ZHOU Ming,WANG Jian   

  1. (College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China)
  • Received:2014-10-28 Revised:2015-02-28 Online:2015-09-25 Published:2015-09-25

摘要:

代理盲签名结合了代理签名和盲签名的优点,在电子商务等领域有着广阔的应用前景。目前大多数代理盲签名的安全性是启发式分析,没有形式化证明,并且大多没有考虑多一伪造攻击。提出了一个新型的代理盲签名安全模型,并在该模型下提出了一个基于双线性对的代理盲签名方案,并在随机预言机模型下,证明了其在选择消息/授权文件攻击下是不可伪造的,其安全性可分别规约为CDH问题和ChosenTarget CDH问题。分析表明,该方案满足代理盲签名的主要安全要求,而且和已有的方案相比,本方案更加高效。

关键词: 代理盲签名, 双线性对, 随机预言机, 多一伪造

Abstract:

By combining the advantages of blind signatures with proxy signatures, a proxy blind signature can be widely applied in many fields, such as ecommerce. Currently, most of the proposed proxy blind signature schemes only give some heuristic explanations without formal proof, and onemore forgery is seldom considered in many schemes. In the paper, we propose a novel efficient security model and a proxy blind signature scheme based on bilinear parings. The scheme is unforgeable against adaptive chosen message/warrant attacks under the Computational DiffieHellman assumption and ChosenTarget Computational DiffieHellman assumption in the random oracle model. The analysis shows that the proposed scheme can satisfy the main secure properties of a proxy blind signature. Furthermore, the scheme is more efficient than traditional ones.

Key words: proxy blind signature;bilinear pairing;random oracle model;one-more forgery