ZHANG Jiang-xiao, FENG Chun-hui, MA Jin-xin, ZHANG Bin, XU Chang, LI Zhou-jun, DANG Ying. Transferable E-Cash System with Arbitrarily Spending OrderJ. Transactions of Beijing institute of Technology, 2019, 39(3): 283-289. DOI: 10.15918/j.tbit1001-0645.2019.03.010
Citation: ZHANG Jiang-xiao, FENG Chun-hui, MA Jin-xin, ZHANG Bin, XU Chang, LI Zhou-jun, DANG Ying. Transferable E-Cash System with Arbitrarily Spending OrderJ. Transactions of Beijing institute of Technology, 2019, 39(3): 283-289. DOI: 10.15918/j.tbit1001-0645.2019.03.010

Transferable E-Cash System with Arbitrarily Spending Order

  • 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.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return