title: Untraceable partially blind signature based on DLOG problem.
abstract: This paper proposes a new untraceable Partially Blind Signature scheme which is a cross between the traditional signature scheme and the blind signature scheme. In this proposed scheme, the message M that the signer signed can be divided into two parts. The first part can be known to the signer (like that in the traditional signature scheme) while the other part cannot be known to the signer (like that in the blind signature scheme). After having signed M, the signer cannot determine if he has made the signature of M except through the part that he knows. We draw ideas from Brands' "Restricted Blind Signature" to solve the Untraceable Partially Blind Signature problem. Our scheme is a probabilistic signature scheme and the security of our Untraceable Partially Blind Signature scheme relies on the difficulty of computing discrete logarithm.
authors.affiliation: Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China. zheng@cs.sjtu.edu.cn
authors.forename: Zheng
authors.initials: Z
authors.lastname: Huang
authors.forename: Ke-fei
authors.initials: KF
authors.lastname: Chen
authors.forename: Wei-dong
authors.initials: WD
authors.lastname: Kou
mesh_terms: D000465:Algorithms; D016494:Computer Security; D003628:Database Management Systems; D005607:Fraud / Q000517:prevention & control*; D016247:Information Storage and Retrieval / Q000379:methods*; D012815:Signal Processing, Computer-Assisted