期刊文献+

具有可传递性的聚合-再分离线可分电子现金方案

Transferable Off-line Divisible E-cash System Based on Combination-subdivision
下载PDF
导出
摘要 基于二叉树模型提出一种聚合-再分花费原则并构建一个新的具有可传递性的离线可分电子现金方案.方案中聚合-再分花费原则能够使二叉树上的每个节点都可以被花费,减少了银行在取款过程中的签名次数和存款过程中的运算量,同时能实现用户对商品的精确支付;在保证用户匿名性和电子现金信息量不随传递次数增加的前提下,实现了电子现金的可传递性.通过非形式化分析表明,该方案具有良好的安全性和高效性. This paper presented a spend principle named combination-subdivision based on the model of binary tree, and then presen- ted a new off-line divisible e-cash scheme with transferability. In the scheme, each node of the binary tree can be spent based on the principle which can realize accurate payment and reduce the bank's signatures in the withdrawal protocol and operations in the deposit protocol. This scheme also realized transferability in the premise of user's anonymity and no increase of e-cash information. The non- formal analysis showed that this scheme has better security and efficiency.
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第8期1964-1968,共5页 Journal of Chinese Computer Systems
基金 河北省重大技术创新项目(09213562Z)资助 河北省自然科学基金青年科学基金(G2011203195)资助
关键词 可分电子现金 二叉树 可传递性 聚合-再分 divisible electronic cash binary tree transferability combination-subdivision
  • 相关文献

参考文献3

二级参考文献41

  • 1马春光,杨义先,胡正名.一种加入有效期的离线电子现金方案[J].计算机工程与设计,2004,25(4):484-485. 被引量:4
  • 2李梦东,杨义先.无可信第三方的离线电子现金匿名性控制[J].电子学报,2005,33(3):456-458. 被引量:13
  • 3彭冰,洪帆,崔国华.基于零知识证明签名和强RSA问题的可分电子现金[J].通信学报,2006,27(7):12-19. 被引量:7
  • 4T Okamato, K Ohata. Universal electronic cash [ A ]. Proceedings of Cypto' 91 [C]. Berlin: Spdnger-Verlag, 1992. 324 - 337.
  • 5T Okamoto.An efficient divisible electronic cash scheme[ A ]. Advances in Cryptology-CRYPTO' 95 [ C ]. German: Springer- Verlag, 1995,438 - 451.
  • 6A Chart, Y frankel, Y Tsiounis. Easy come-easy go divisible cash[ A ]. Advances in Cryptology- EUROCRYPT' 98 [ C ]. Finland: Springer-Verlag, 1998.561 - 575.
  • 7T Nakanishi, M Sugiyama. Unlinkable divisible electronic cash [A]. ISW' 00[ C]. Australia: Springer-Verlag, 2000, 121 - 134.
  • 8S 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.
  • 9J 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.
  • 10E 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.

共引文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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