欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2007, Vol. 24 ›› Issue (2): 253-256.DOI: 10.7523/j.issn.2095-6134.2007.2.018

• 论文 • 上一篇    下一篇

两个群签名方案的不可追踪性(英文)

曹正军   

  1. 1 上海大学数学系,200444. zjcao@amss.ac.cn
    2 中国科学院数学与系统科学研究院数学机械化重点实验室
  • 收稿日期:1900-01-01 修回日期:1900-01-01 发布日期:2007-03-15

On the untraceability of two group signatures

CAO Zheng-Jun   

  1. 1 Department of Mathematics, Shanghai University, Shanghai, 200444, zjcao@amss.ac.cn
    2 Key Lab of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing
  • Received:1900-01-01 Revised:1900-01-01 Published:2007-03-15

摘要: 群签名允许每个成员代表整个群体作出签名,它是构造电子现金、电子拍卖、电子选举方案
的基本工具. 本文通过极其简单的攻击方法证明Zhang et al.在2003年和 Kim et al.在1996年提出的两个群签名方案是不可追踪的。与Wang et al.提供的攻击方法相比,本文所发展的技巧十分新奇有趣。

关键词: 群签名, 可追踪性, 不可联系性

Abstract: Group signature allows individual members to make signatures on behalf of the whole group. It can be used to constitute a very useful primitive in many settings, such as E-cash, E-auction and E-election. In this paper, we show that the two group signatures proposed by Zhang et al. in 2003 and Kim et al. in 1996 are untraceable by very simple attacks. In contrast to those attacks presented by Wang et al., the techniques developed in this paper are novel and interesting.

Key words: Group signature, Traceability, Unlinkability.

中图分类号: