A traceable group signature scheme
Camenisch [1] links Chaum's [2] blind signature and claims to solve the length problems of group public key and of anonymous digital signature. However, a heavy time burden in verification weakens digital signature. This;paper is to develop a new and faster digital anonymous signature system by linking the LUC function with the complexities of discrete logarithm and factorization. Our scheme is free from the change in public key, private key, and semipublic key if there is any change in the group internal membership. Our verification needs smaller volume than the Camenisch method [1] does, is easier to implement, and can be applied to large computer networks. (C) 2000 Elsevier Science Ltd. All rights reserved.
group signature luc function cryptosystem factorization problem discrete logarithm problem