Abstract
Almost all of the mobile devices have some fixed characters which can be distinguished easily, and also they are so portable that can be taken with yourself, so the mobile device which is used in electronic business is always the same, as the result, electronic cash, consumer and mobile device can be tied together, and we can check whether the cash belongs to the user by authenticating the fixed character of the mobile device. In this paper, a portable and divisible electronic payment scheme is presented under the idea above, whose computational load, storage needed and network load are all light, so it is fit for mobile commerce. In addition, an augmented dynamic password identity authentication scheme is given after disclosing the hidden security trouble of SDPA. Meanwhile, a new identity-based digital signature scheme is proposed.
Supported by The State Key Lab of Modern Communication (51436040203DZ01) and The “973” National Fundamental Research Program of China (TG1999035801)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brands, S.: Untraceable Off-Line Cash in Wallets with Observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302–318. Springer, Heidelberg (1994)
Ferguson, N.: Single Term Off-line Coins. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 318–328. Springer, Heidelberg (1994)
Okamoto, T.: An Efficient Divisible Electronic Cash Scheme. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 438–451. Springer, Heidelberg (1995)
Huang, Z., Chen, K.F., Zheng, D.: Efficient Electronic Payment Fit for Wireless Networks. Chinese Journal of Electronics 13(2) (2004)
Sandiringama, M., Shimizu, A., Noda, M.-t.: Simple and Secure Password Authentication Protocol. IEICE Trans Comm. E83-B(6), 1363–1365 (2000)
Ku, W.C., Chen, C.M.: Cryptanalysis of A One Time Password Authentication Protocols. In: Proceedings of the 2001 National Computer Symposium, Taiwan, December 2001, pp. 17046–17050 (2001)
Lin, C.L., Sun, H.M., Hwang, T.: Attacks And Solutions on Strong-password Authentication. IEICE Transactions on Communications E84-B(9), 2622–2627 (2001)
Yuan, D., Fan, Z.P.: A Secure Dynamic Password Authentication Scheme. Journal of Sichuan University. Natural science edn. 39(2) (April 2002)
Shamir, A.: Identity-based Cryptosystems And Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)
Boneh, D., Franklin, M.: Identity Based Encryption from The Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 229–231. Springer, Heidelberg (2001)
Barreto, P., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairings Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)
Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)
Schnorr, C.P.: Efficient Signature Generation for Smart Cards. Journal of Cryptology 4(3), 161–174 (1991)
Okamoto, T., Ohta, K.: Universal electronic cash. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 324–337. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, Y., Han, Z., Liu, J., Li, Z. (2005). An Efficient and Divisible Payment Scheme for M-Commerce. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_70
Download citation
DOI: https://doi.org/10.1007/11553939_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28896-1
Online ISBN: 978-3-540-31990-0
eBook Packages: Computer ScienceComputer Science (R0)