An efficient static blind ring signature scheme

  • Authors:
  • Qianhong Wu;Fanguo Zhang;Willy Susilo;Yi Mu

  • Affiliations:
  • Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, Guangdong Province, P.R. China;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia

  • Venue:
  • ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Blind group/ring signatures are useful for applications such as e-cash and e-voting systems. In this paper, we show that the blindness of some existing blind group/ring signature schemes is easy to break by a malicious anonymous signer of dynamic groups. However, this risk has not been pointed out in these proposals, which may cause misuse of the schemes. Fortunately, for static groups, it is possible to integrate the blindness of message into group/ring signatures. An efficient static blind ring signature is proposed with its security provable under the extended ROS assumptions in the random oracle model plus the generic group model. After the group public key is generated, the space, time, and communication complexities of the relevant parameters and operations are constant.