Department of Computer Science & Technology, School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330032,Jiangxi Province, P.R. China; Key Lab of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007,Fujian Province, P.R. China

---

Abstract—In this paper, a proxy blind signature scheme based on bilinear pairing is proposed. The proposed proxy blind signature is existential unforgeable under adaptively chosen warrant attacks and chosen message attacks upon the CDH assumptions and DBDH assumptions in the Random Oracle Model. In order to make all levels of banks issue electronic coin, the proxy blind signature scheme is applied to construct an electronic cash system. The electronic cash system holds unforgeability, unlinkability and efficient traceability. It can provide protection for the honest consumers and the transactions, and prevent the double spending.

Index Terms—Electronic cash; Proxy Blind Signature; Discrete Logarithm; Unlinkability; Random Oracle Model

[PDF]

Cite: Zuowen Tan, " An E-Cash Scheme Based on Proxy Blind Signature from Bilinear Pairings," Journal of Computers vol. 5, no. 11, pp. 1638-1645, 2010.