An Anonymous Mobile Payment System Based on Bilinear Pairings

Article type: Research Article

Authors: Popescu, Constantin

Affiliations: Department of Mathematics and Computer Science, University of Oradea, Universitatii 1, Oradea, Romania, e-mail: cpopescu@uoradea.ro

Abstract: Many electronic cash systems have been proposed with the proliferation of the Internet and the activation of electronic commerce. E-cash enables the exchange of digital coins with value assured by the bank's signature and with concealed user identity. In an electronic cash system, a user can withdraw coins from the bank and then spends each coin anonymously and unlinkably. In this paper, we design an efficient anonymous mobile payment system based on bilinear pairings, in which the anonymity of coins is revocable by a trustee in case of dispute. The message transfer from the customer to the merchant occurs only once during the payment protocol. Also, the amount of communication between customer and merchant is about 800 bits. Therefore, our mobile payment system can be used in the wireless networks with the limited bandwidth. The security of the new system is under the computational Diffie–Hellman problem in the random oracle model.

Keywords: cryptography, electronic cash system, bilinear pairings

Journal: Informatica, vol. 20, no. 4, pp. 579-590, 2009