• 研究论文 • 上一篇    下一篇



  1. (西安电子科技大学 计算机网络与信息安全教育部重点实验室,陕西 西安 710071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-20 发布日期:2007-10-25

Efficient group signature scheme with verifier-local revocation

ZHANG Yue-yu;PANG Liao-jun;SU Wan-li;WANG Yu-min

  1. (Ministry of Edu. Key Lab. of Computer Network and Information Scurity, Xidian Univ., Xi′an 710071, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-20 Published:2007-10-25

摘要: 基于Boneh和Shacham的群签名方案,提出一种后向无关联的本地验证者撤销群签名方案.该方案中成员私钥是由密钥管理者所分发的密钥和成员生成的密钥构成的三元组,从而使得签名具有强防陷害性.在判定线性Diffie-Hellman假设下,应用零知识证明,在签名验证阶段解决了算法运行时间与撤销列表长度成线性关系的问题,验证过程仅需3次多指数运算和1次双线性运算.方案还采用时间间隔的概念实现了后向无关联性,签名长度仅为1533比特.

关键词: 群签名, 本地验证者, 后向无关联, 强防陷害性

Abstract: A verifier-local revocation group signature scheme with backward unlinkability is proposed based on the scheme presented by Boneh and Shacham. In our scheme, the private key to a group member is a triple consisting of the key obtained from the key issuer and that generated by the member, thus realizing strong exculpability. Also, we solve the problem that the running time of signature verification is linearly dependent on the length of revocation list using zero knowledge under Decision Linear Diffie-Hellman assumption, so the verification of our scheme requires only three multi-exponentiations and one paring computation. Further, our scheme realizes the backward unlinkability based on the concept of time intervals and is only 1553bits in size.

Key words: group signature, verifier-local, backward unlinkability, strong exculpability


  • TN918.1