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

Transferable E-Cash System with Arbitrarily Spending Order

针对现有的可传递电子现金系统在传递协议中传递花费顺序固定以及传递次数受限制的问题,利用Groth-Sahai证明系统、对承诺的承诺和Ghadafi群盲签名,在标准模型下构建一个具有最优匿名性的可任意花费的等长可传递电子现金系统,该系统中电子现金的花费不受任何花费顺序限制,传递次数是任意次.基于对承诺的承诺,可以对所传递的序列号进行压缩,从而保证用户传递电子现金的长度是常量;基于Ghadafi群盲签名,实现了电子现金花费用户的任意性;在标准模型下,证明了新系统的安全属性,该系统具有不可伪造性、最优匿名性、不可重复花费性和不可诬陷性.

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.