电子学报 ›› 2009, Vol. 37 ›› Issue (2): 367-371.

• 论文 • 上一篇    下一篇

可直接计算的高效的可分电子现金系统

刘文远1, 张江霄1, 胡庆华1, 谷秀芝2   

  1. 1. 燕山大学信息科学与工程学院,河北秦皇岛 066004;2. 重庆交通大学,重庆 400074
  • 收稿日期:2008-03-11 修回日期:2008-09-25 出版日期:2009-02-25 发布日期:2009-02-25

Divisible E-Cash System with Direct Computation and Efficiency

LIU Wen-yuan1, ZHANG Jiang-xiao1, HU Qing-hua1, GU Xiu-zhi2   

  1. 1. Information Science and Engineering Institute,Yanshan University,Qinhuangdao,Hebei 066004,China;2. Chongqing Jiaotong University,Chongqing,400074,China
  • Received:2008-03-11 Revised:2008-09-25 Online:2009-02-25 Published:2009-02-25

摘要: 针对现有的基于可信第三方的可分电子现金存在用户花费电子现金效率低、用户花费时要从根节点一层一层计算的缺点,在无可信第三方的基础上,首次将节点可直接计算与可再分的方法引入到离线可分电子现金中,提出了一种新型的无可信第三方的离线可分电子现金系统.该协议在基于同一棵二叉树时,用户所能花费的电子现金总额是原来的n倍(n是二叉树层数),由同一电子现金分出的不同节点具有不可链接性,而且花费二叉树上任一节点所做的计算量是一样的,从而提高系统的整体效率.

关键词: 电子现金, 可分性, 不可链接性, 可直接计算

Abstract: There exist some drawbacks such as low efficiency and computation lay by lay from a root node when the user spends E-cash in the divisible electronic cash(E-cash)based on TTP.Based on without TTP,the concept of direct computation and division again was firstly introduced to off-line divisible E-cash,a new off-line divisible E-cash system without trusted third party was presented.In the new system,the E-cash total amount spent by user was times than before(is the binary tree layer),the different node divided from the same E-cash was unlinkable,moreover the computation of expending on any node was the same,thus we can enhance the overall efficiency of the system.

Key words: e-cash, divisibility, unlinkability, direct computation

中图分类号: