北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (3): 123-126.doi: 10.13190/jbupt.200903.123.wangjh

• 研究报告 • 上一篇    下一篇

低计算复杂度的半盲签名方案

王建辉 刘景伟 寇卫东 李晓辉   

  1. 西安电子科技大学 西安电子科技大学
  • 收稿日期:2008-09-19 修回日期:2009-03-26 出版日期:2009-06-28 发布日期:2009-06-28
  • 通讯作者: 王建辉

Low-computation Partially Blind Signature

  • Received:2008-09-19 Revised:2009-03-26 Online:2009-06-28 Published:2009-06-28

摘要:

目前, 盲签名在各种电子商务应用中(如电子现金和电子投票)扮演着重要的角色,而它的一种变形—半盲签名则有着更为广泛地应用。本文提出了一种低计算复杂度的半盲签名方案,并且给出了随机预言机模型下的安全性证明。而且与Masayuki Abe和Tatsuaki Okamoto的方案相比,我们的方案具有更高的效率。低计算复杂度的特性使得我们的方案非常适用于移动终端和智能卡环境。

关键词: 半盲签名, Schnorr签名, 低计算复杂度, 随机预言机模型

Abstract:

Blind signatures play a central role in applications such as e-cash and e-voting systems, while the notion of partially blind signature is a more applicable variant. This paper presents a model of simple partially blind signature with low computation, from which many simple partially blind signature schemes can be constructed, and gives a detail formal security proof in the random oracle model. Compared with the scheme due to Masayuki Abe and Tatsuaki Okamoto, our scheme is more efficient. The low-computation property makes our scheme very attractive for mobile client and smart-card implementation in many e-commerce applications.

Key words: Partially Blind Signature, Schnorr Signature, Low-Computation, Random Oracle Model