Let H be a hard bit for the discrete log. Let p be a large prime such that p Gamma 1 has one large factor q, and let g 2 Z p . Let H be a hard bit for the discrete log. Finally , the customer wants to be sure that money he 1 has withdrawn will be accepted for a payment. Furthermore , the customer may require that his privacy be protected.
Payments are anonymous and different payments of the same customer are unlinkable.
Electronic cash systems based on the representation problem in groups of prime order . Springer Verlag, 1994. We introduce the first electronic cash systems which incorporate trustee based tracing but otherwise provably protect user anonymity. The systems are secure against counterfeiting and other fraud. Based on the Representation Problem in Groups of Prime Order .