LOW-COMPUTATION PARTIALLY BLIND SIGNATURES FOR ELECTRONIC CASH

In a secure partially blind signature scheme, the signer assures that the blind signatures issued by him contains the information he desires . The techniques make it possible to minimize the unlimited growth of the bank's database which storing all spent electronic cash in an anon ymous electronic cash system. In this paper we propose an efficient pa rtially blind signature scheme for electronic cash. In our scheme, onl y several modular additions and modular multiplications are required f or a signature requester to obtain and verify a signature. It turns ou t that the proposed scheme is suitable for mobile clients and smart-ca rd applications because no time-consuming computations are required, s uch as modular exponentiation and inverse computations. Comparing with the existing blind signature schemes proposed in the literatures, our method reduces the amount of computations for signature requesters by almost 98%.