Linkability of a blind signature scheme and its improved scheme

  • Authors:
  • Jianhong Zhang;Tao Wei;JianYu Zhang;Wei Zou

  • Affiliations:
  • Institute of Computer Science & Technology, Peking University, Beijing, P.R.China;Institute of Computer Science & Technology, Peking University, Beijing, P.R.China;Institute of Computer Science & Technology, Peking University, Beijing, P.R.China;Institute of Computer Science & Technology, Peking University, Beijing, P.R.China

  • Venue:
  • ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
  • Year:
  • 2006
  • Linkability of some blind signature schemes

    WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems

Quantified Score

Hi-index 0.00

Visualization

Abstract

Blind signature allows a user to obtain signatures from an authority on any document, in such a way that the authority learns nothing about the message that is being signed. The blindness is an important property in blind signature scheme. In this work, we analyze security of the blind signature[1], and show that the scheme hasn't blindness, in other words, the signer is able to link a valid message-signature pair obtained by some user. To overcome the above flaw, we propose an improved scheme and show that the security of the improved scheme is based on the Computational Diffie-Hellman problem.