An efficient static blind ring signature scheme

  • Qianhong Wu*
  • , Fanguo Zhang
  • , Willy Susilo
  • , Yi Mu
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers
PublisherSpringer Verlag
Pages410-423
Number of pages14
ISBN (Print)3540333541, 9783540333548
DOIs
StatePublished - 2006
Externally publishedYes
Event8th International Conference on Information Security and Cryptology, ICISC 2005 - Seoul, Korea, Republic of
Duration: 1 Dec 20052 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3935 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Information Security and Cryptology, ICISC 2005
Country/TerritoryKorea, Republic of
CitySeoul
Period1/12/052/12/05

Fingerprint

Dive into the research topics of 'An efficient static blind ring signature scheme'. Together they form a unique fingerprint.

Cite this