可任意花费的可传递电子现金系统

There exist some problems such that the user spending order is fixed in the transferable E-cash system, and the transferable number is restricted. Using the Groth-Sahai proof system, Ghadafi group blind signature and commitment to commitment, a transferable E-cash system of equal length with optimal anonymity and arbitrarily spending order was designed in a standard model. It was arranged that, based on the commitment to commitment, the users could compress the transferable serial number, and the length of the E-cash could be constant in the spending protocol, based on the Ghadafi group blind signature, the arbitrarily spending order could be achieved. Finally, the security of the transferable E-cash system was verified in the standard model. Results show its unforgeability, anonymity, identification of double spender and exculpability.