期刊文献+

可直接计算的高效的可分电子现金系统 被引量:6

Divisible E-Cash System with Direct Computation and Efficiency
下载PDF
导出
摘要 针对现有的基于可信第三方的可分电子现金存在用户花费电子现金效率低、用户花费时要从根节点一层一层计算的缺点,在无可信第三方的基础上,首次将节点可直接计算与可再分的方法引入到离线可分电子现金中,提出了一种新型的无可信第三方的离线可分电子现金系统.该协议在基于同一棵二叉树时,用户所能花费的电子现金总额是原来的n倍(n是二叉树层数),由同一电子现金分出的不同节点具有不可链接性,而且花费二叉树上任一节点所做的计算量是一样的,从而提高系统的整体效率. 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.
出处 《电子学报》 EI CAS CSCD 北大核心 2009年第2期367-371,共5页 Acta Electronica Sinica
基金 国家科技部高新技术计划基金(No.2005EJ000017) 国家电子信息发展基金 河北省信息产业发展计划基金(No.2005035025) 河北省自然科学基金(No.F2005000368)
关键词 电子现金 可分性 不可链接性 可直接计算 e-cash divisibility unlinkability direct computation
  • 相关文献

参考文献13

  • 1T Okamato, K Ohata. Universal electronic cash [ A ]. Proceedings of Cypto' 91 [C]. Berlin: Spdnger-Verlag, 1992. 324 - 337.
  • 2T Okamoto.An efficient divisible electronic cash scheme[ A ]. Advances in Cryptology-CRYPTO' 95 [ C ]. German: Springer- Verlag, 1995,438 - 451.
  • 3A Chart, Y frankel, Y Tsiounis. Easy come-easy go divisible cash[ A ]. Advances in Cryptology- EUROCRYPT' 98 [ C ]. Finland: Springer-Verlag, 1998.561 - 575.
  • 4T Nakanishi, M Sugiyama. Unlinkable divisible electronic cash [A]. ISW' 00[ C]. Australia: Springer-Verlag, 2000, 121 - 134.
  • 5彭冰,洪帆,崔国华.基于零知识证明签名和强RSA问题的可分电子现金[J].通信学报,2006,27(7):12-19. 被引量:7
  • 6S Canard, A Gouget. Divisible e-cash systems can be truly anonymous[A]. Advances in Cryptology-EUROCRYPT' 07 [ C ]. Barcelona, Spain: Springer-Verlag, 2007.482 - 497.
  • 7李梦东,杨义先.无可信第三方的离线电子现金匿名性控制[J].电子学报,2005,33(3):456-458. 被引量:13
  • 8J Camenisch, M Michels. Proving in zero-knowledge that a number n is the product of two safe primes[A]. Advances in Cryptology-EUROCRYPT' 99 [C]. Czech Republic: Springer- Verlag, 1999.107 - 122.
  • 9E Fujisaki, T Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations[ A]. Advances in Cryptology - CRYPIO' 97 [ C ]. Berlin: Springer- Verlag. 1997.16 - 30.
  • 10J Camenisch, A Lysyanskaya. SignattLre schemes and anonymous credentials from bilinear maps[A]. Advances in Cryptology-Crypto' 04[C]. California: Springer-Vedag, 2004.56 - 72.

二级参考文献23

  • 1CAMENISCH J,MAURER U,STADLER M.Digital pay-ment systems with passive anonymity-revoking trustees[A].Computer Security,ESORICS'96[C].Berlin,1996.33-43.
  • 2SONG R G,KORBA L.How to make e-cash with non-repudiation and anonymity[A].Proceedings of the International Conference on Information Technology,ITCC'04[C].Las Vegas,2004.167-172.
  • 3YU P L,LEI C L.An user efficient fair e-cash scheme with anonymous certificates.electrical and electronic technology[A].Proceedings of IEEE Region 10,International Conference[C].TENCON,2001.74-77.
  • 4CHAN A,FRANKEL Y,TSIOUNIS Y.Easy come-easy go divisible cash[A].Advances in Cryptology,EUROCRYPT'98[C].Helsinki,1998.561-575.
  • 5OKAMOTO T,OHTA K.Universal electronic cash[A].Advances in Cryptology,CRYPTO'91[C].1992.324-337.
  • 6OKAMOTO T.An efficient divisible electronic cash scheme[A].Advances in Cryptology,CRYPTO'95[C].Santa Barbara,1995.438-451.
  • 7VONSOLMS S.NACCACHE D.On blind signatures and perfect crimes[J].Computers and Security,1992,11(6):581-583.
  • 8CAMENISCH J,STADLER M.Efficient group signature schemes for large groups[A].Advances in Cryptology,CRYPTO'97[C].1997.410-424.
  • 9CAMENISCH J,MICHELS M.A group signature scheme with improved efficiency[A].Advances in Cryptology,ASIACRYPT'98[C].Beijing,1998.160-174.
  • 10BELLARE M,MICCIANCIO D,WARINSCHI B.Foundations of group signatures:formal definitions,simplified requirements,and a construction based on general assumptions[A].Advances in Cryptology,EUROCRYPT'03[C].Warsaw,2003.614-629.

共引文献18

同被引文献58

引证文献6

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部