Cryptanalysis of Lee-Hwang-Yang blind signature scheme

Authors:
Chun-I Fan;D. J. Guan;Chih-I Wang;Dai-Rui Lin
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804, ROC;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804, ROC;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804, ROC;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804, ROC
Venue:
Computer Standards & Interfaces
Year:
2009

Citing 8
Cited 0

Secret ballot elections in computer networks

Computers and Security
An unlinkably divisible and intention attachable ticket scheme for runoff elections

Journal of Network and Computer Applications
Security enhancement for anonymous secure e-voting over a network

Computer Standards & Interfaces
Implementing regular cash with blind fixed-value electronic coins

Computer Standards & Interfaces
Electronic voting systems: Requirements, design, and implementation

Computer Standards & Interfaces
Design of a fair proxy raffle protocol on the Internet

Computer Standards & Interfaces
Specifying Privacy-Preserving Protocols in Typed MSR

Computer Standards & Interfaces
Ownership-attached unblinding of blind signatures for untraceable electronic cash

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2005, Lee et al. proposed a blind signature scheme based on the discrete-logarithm problem to achieve the untraceability or unlinkability property. Later, Wu and Wang proposed a simplified version of Lee et al.'s scheme. However, both of the two schemes will be demonstrated as not being secure in this manuscript. We design an attack on both of the two schemes such that a signature requester can obtain more than one valid signatures by performing only one round of the protocol. It violates an important security requirement of blind signatures.