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

Translated title of the contribution: Transferable E-Cash System with Arbitrarily Spending Order

Jiang Xiao Zhang, Chun Hui Feng, Jin Xin Ma, Bin Zhang, Chang Xu, Zhou Jun Li, Ying Dang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

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.

Translated title of the contributionTransferable E-Cash System with Arbitrarily Spending Order
Original languageChinese (Traditional)
Pages (from-to)283-289
Number of pages7
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume39
Issue number3
DOIs
Publication statusPublished - 1 Mar 2019

Fingerprint

Dive into the research topics of 'Transferable E-Cash System with Arbitrarily Spending Order'. Together they form a unique fingerprint.

Cite this