期刊文献+

基于RSA电子现金支付系统的研究与实现 被引量:2

E-cash System's Research and Realization Based on RSA
下载PDF
导出
摘要 在分析现有电子现金技术的基础上,提出一种安全的、方便的电子现金支付系统实现方案。该方案利用求模算法的性质,只使用少量的公钥,就能满足电子现金的公钥需求;并利用盲签名和直接签名,解决系统的找零问题。最后通过一个系统原型的实现,证明该方案的可行性。 A safe and convenient E-cash system scheme is submitted based on analyzing the present technology of E-cash.It can meet the demand of E-cash with only a little public key using the property of the modal calculating, and solute the question of the change using the blind signature and the method of signing directly. The scheme is certified to be feasible through carrying out the system model.
作者 梁俏权 王勋
出处 《计算机工程》 CAS CSCD 北大核心 2003年第14期189-191,共3页 Computer Engineering
基金 浙江省教育厅基金资助项目(Y02-68)
关键词 RSA盲签名 电子现金 匿名性 零知识证明 RSA blind signature Electronic cash Anonymity Zero knowledge proof
  • 相关文献

参考文献4

二级参考文献9

  • 1[1]Adam N R, Dogramaci O, Gangopadhyay A, et al. Electronic Commerce:Technical, Business,and Legal Issues. Prentice Hall PTR, 1999
  • 2[2]Cracker S D, Sterenson Jr R B. Paying Up: Payment Systems for Digital Commerce. Edited by Leebarert D. The Future of the Electronic Marketplace. Massachusetts Institute of Technology,Second Printing, 1999
  • 3[3]O′Mahony D, Peirce M, Tewan H.Electronic Payment Systems.Artech House, Inc.,1997
  • 4[4]Yesil M.Creating the Virtual Store. John Wiley & Sons, Inc.,1997
  • 5[5]Mcknight LW,BailleyJ.Internet Economics. Massachusetts Institute of Technology, 1997
  • 6[6]Services, Cash Payment Types, Internet Card Processing. http:∥www.cybercash.com/cybercash/services/
  • 7[7]Anderson M M. The Electronic Check Architecture. 1998-09-29
  • 8Chen Kai,International Workshop on Cyrptographic Techniques and E Commerce(Cryp TEC 99),1999年,272页
  • 9Chan A,Advances in Cryptology Proceedings of Eurocrypt 98,1998年,561页

共引文献16

同被引文献16

  • 1毕玉,高虎明.一个可计息的离线电子现金方案[J].中国科学院研究生院学报,2006,23(6):802-807. 被引量:1
  • 2CHAUM D. Blind signatures for untraceable payments [C]//Advances in Cryptology: Proc of CRYPTO '82. New York: Springer-Verlag, 1998: 199-203.
  • 3BONEH D, FRANKLIN M. Identity-based encryption from the well pairing [J]. SIAM J Comput, 2003, 32(33 : 586- 615.
  • 4WATERS B. Efficient identity-based encryption without random oracles [C]//Proceedings of Eurocrypt 05. Berlin, Germany: SDriner-Verla, 2005: 114-127.
  • 5MICCIANCIO D, REGEV O. Worst-case to average case reductions based on Gaussian measures [J]. SIAM J Comput, 2007, 37(1): 267-302.
  • 6LYUBASHEVSKY V, MICCIANCIO D. Asymptotically efficient lattice-based digital signatures [C]//TCC 08 Proceedings of the 5th Conference on Theory of Cryptography. Berlin, Germany: Springer-Verlag, 2008: 37-54.
  • 7GENTRY C, PEIKERT C, VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic con- structions [-C]//STOC '08 Proceedings of the 40th Annual ACM Symposium on Theory of Computing. New York, NY: ACM, 2008: 197-206.
  • 8ALWEN J, PEIKERT C. Generating shorter bases for hard random lattices [-J]. Theor Comput Syst, 2011, 48(3) : 535-553.
  • 9孟纯煜,殷新春,宋春来.利用可链接环签名的电子现金支付方案[J].扬州大学学报(自然科学版),2007,10(2):54-56. 被引量:3
  • 10刘文远,张江霄,胡庆华,谷秀芝.可直接计算的高效的可分电子现金系统[J].电子学报,2009,37(2):367-371. 被引量:6

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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