117
Views
0
CrossRef citations to date
0
Altmetric
Information Engineering

A fair offline electronic cash scheme with multiple-bank in standard model

, &
Pages 87-96 | Received 07 Jun 2017, Accepted 08 Nov 2018, Published online: 20 Feb 2019

References

  • Baldimtsi, F., M. Chase, G. Fuchsbauer, and M. Kohlweiss. 2015. “Anonymous Transferable E-Cash.” In Proceedings of IACR International Workshop on Public Key Cryptography, Gaithersburg, MD, 30 March–1 April: 101–124. New York: Springer-Verlag.
  • Brands, S. 1994. “Untraceable Off-Line Cash in Wallet with Observers.” In Proceedings of Advances in Cryptology-CRYPTO’ 93: 13th Annual International Cryptology Conference, Santa Barbara, California, 22–26 August: 302–318. New York: Springer-Verlag.
  • Canard, S., D. Pointcheval., O. Sanders., and J. Traoré. 2015. “Scalable Divisible E-Cash.” In Proceedings of the 13th International Conference on Applied Cryptography and Network Security, New York, NY, 2–5 Jun. 287–306. New York: Springer-Verlag.
  • Canard, S., and J. Traoré. 2003. “On Fair E-Cash Systems Based on Group Signature Schemes.” In Proceedings of Australasian Conference on Information Security and Privac y, Wollongong, Australia, 9–11 July: 237–248. New York: Springer-Verlag.
  • Chaum, D. 1983. “Blind Signatures for Untraceable Payments.” In Proceedings of Advances in Cryptology-Crypto 82: Conference on the Theory and Application of Cryptography 1982, California, 23–25 August 1982: 199–203. New York: Springer-Verlag.
  • Chaum, D., A. Fiat, and M. Naor 1988. “Untraceable Electronic Cash.” In Proceedings of Advances in Cryptology-Crypto 88: Conference on the Theory and Application of Cryptography 1988, California, 21–25 August: 319–327. New York: Springer-Verlag.
  • Chen, M. T., C. I. Fan, W. S. Juang, and Y. C. Yeh. 2012. “An Efficient Electronic Cash Scheme with Multiple Banks Using Group Signature.” International Journal of Innovative Computing Information and Control 8 (7): 4469–4482.
  • Chou, J. S., Y. Chen, M. H. Cho, and H. M. Sun. 2009. “A Novel ID-based Electronic Cash System from Pairings.” IACR Cryptology ePrint Archive, Accessed July 8. https://eprint.iacr.org/2009/339
  • Cramer, R. J., and T. P. Pedersen. 1993. “Improved Privacy in Wallets with Observers.” In Proceedings of Advances in Cryptology—EUROCRYPT ’93: Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, May 23–27: 329–343. New York: Springer-Verlag.
  • Eslami, Z., and M. Talebi. 2011. “A New Untraceable Off-Line Electronic Cash System.” Electronic Commerce Research and Applications 10 (1): 59–66. doi:10.1016/j.elerap.2010.08.002.
  • Groth, J., and A. Sahai. 2008. “Efficient Non-Interactive Proof Systems for Bilinear Groups.” In Proceedings of Advances in Cryptology—EUROCRYPT’08:: Workshop on the Theory and Application of Cryptographic Techniques, Istanbul, Turkey, April 13–17: 415–432. New York: Springer-Verlag.
  • Hou, X., and C. H. Tan. 2005. “On Fair Traceable Electronic Cash.” In IEEE Proceeding of the 3rd Communication Networks and Services Research Conference, N.S., Canada, May 16–18: 39–44. Washington, DC: IEEE.
  • Huang, T. 2015. “Research on Mobile Multi-Bank Divisible E-Cash Protocol.” International Journal of Information and Electronics Engineering 5 (6): 437. doi:10.7763/IJIEE.2015.V5.574.
  • Islam, S. H., R. Amin, G. P. Biswas, M. S. Obaidat, and M. K. Khan. 2016. “Provably Secure Pairing-Free Identity-Based Partially Blind Signature Scheme and Its Application in Online E-Cash System.” Arabian Journal for Science and Engineering 41 (8): 3163–3176. doi:10.1007/s13369-016-2115-5.
  • Izabachène, M., and B. Libert. 2012. “Divisible E-Cash in the Standard Model” In Proceedings of the 5th International Conference on Pairing-Based Cryptography, Cologne, Germany, May 16–18: 314–332. New York: Springer-Verlag.
  • Li, Z., J. Higgins, and M. Clement. 2001. “Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem.” In IEEE Proceedings of Ninth International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, Cincinnati, Ohio, August 15–18. 249–256. Washington, DC: IEEE.
  • Lysyanskaya, A., and Z. Ramzan. 1998. “Group Blind Digital Signatures: A Scalable Solution to Electronic Cash” In Proceedings of the 2nd International Conference on Financial Cryptography, Anguilla, British West Indies, February 23–25. 184–197. New York: Springer-Verlag.
  • Nakamoto, S. 2008. “Bitcoin: A Peer-To-Peer Electronic Cash System.” 28. https://bitcoin.org/bitcoin.pdf
  • Popescu, C. 2006. “An Electronic Cash System Based on Group Blind Signatures.” Informatica 17 (4): 551–564.
  • Wang, S., Z. Chen, and X. Wang. 2008. “A New Certificateless Electronic Cash Scheme with Multiple Banks Based on Group Signatures.” In IEEE Proceeding of 2008 International Symposium on Electronic Commerce and Security, edited by B. Werner. Guangzhou, China, August 3–5: 362–366. Washington, DC: IEEE. doi:10.1089/jmf.2006.065.
  • Zhang, J., L. Huo, X. Liu, C. Sui, Z. Li, and J. Ma. 2015. “Transferable Optimal-Size Fair E-Cash with Optimal Anonymity.” In Proceedings of Theoretical Aspects of Software Engineering, Nanjing, Jiangsu, September 12–14: 139–142. Washington, DC: IEEE.
  • Zhou, F., Y. Li, Q. Zhou, J. Miao, and J. Xu. 2016. “The Electronic Cash System Based on Non-Interactive Zero-Knowledge Proofs.” International Journal of Computer Mathematics 93 (2): 239–257. doi:10.1080/00207160.2014.933816.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.