Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme is quite commendable in comparison with the previous work in terms of security and time complexity.
 David Chaum. Blind Signatures for Untraceable Payments. In Advances in Cryptology CRYPTO '82, pages 199-203, Santa. Barbara, California, 1982. Plemum.
 Lein Harn. Cryptanalysis of the Blind Signatures Based on the Discrete Logarithm Problem. Electronic Letters, 31(14):1136, 1995.
 Cheng-Chi Lee, Min-Shiang Hwang, and Wei- Pang Yang. A New Blind Signature Based on the Discrete Logarithm Problem for Untraceability. Applied Mathematics and Computation, 164(3): 837-841, 2005.
 David Chaum. Security without Identification: Transaction Systems to Make Big Brother Obsolete. Communications of the ACM, 28(10):1030-1044, 1985. ISSN 0001-0782.
 Scott A. Vanstone. Elliptic Curve Cryptosystem-The Answer to Strong, Fast Public-Key Cryptography for Securing Constrained Environments. Information Security Technical Report, 2(2):78-87, 1997.
 William Stallings. Cryptography and Network Security: Principles and Practice. Prentice Hall, 2006.
 Wu Ting and Jin-Rong Wang. Comment: A New Blind Signature Based on the Discrete Logarithm Problem for Untraceability. Applied Mathematics and Computation, 170(2): 999-1005, 2005.
 Debasish Jena, Sanjay Kumar Jena, and Banshidhar Majhi. A Novel Blind Signature Scheme Based on Nyberg-Rueppel Signature Scheme and Applying in Off-Line Digital Cash. In Proceedings of the 10th International Conference on Information Technology (ICIT'07), pages 19-22, Rourkela, India, 2007. IEEE Computer Society.
 Jan L. Camenisch, Jean-Marc Piveteau, and Markus A. Stadler. Blind Signatures Based on the Discrete Logarithm Problem. In Advances in Cryptology-EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 428-432, Perugia, Italy, 1994. Springer.
 Patrick Horster, Markus Michels, and Holger Petersen. Comment: Cryptanalysis of the Blind Signatures Based on the Discrete Logarithm Problem. Electronic Letters, 31(21):1827, 1995.
 Debasish Jena, Sanjay Kumar Jena, and Banshidhar Majhi. A Novel Untraceable Blind Signature Based on Elliptic Curve Discrete Logarithm Problem. IJCSNS International Journal of Computer Science and Network Security, 7(6):269-275, 2007.
 Chun-I Fan, D. J. Guan, Chih-I Wang, and Dai-Rui Lin. Cryptanalysis of Lee-Hwang-Yang Blind Signature Scheme. Computer Standards & Interfaces, 31(2):319-320, 2009.
 Victor S. Miller. Use of Elliptic Curves in Cryptography. In Advances in Cryptology-CRYPTO'85, volume 218 of Lecture Notes in Computer Sciences, pages 417-426, Santa. Barbara, California, 1986. Springer.