Research Article

A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves

by  Atul Chaturvedi, Varun Shukla
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Issue 5
Published: February 2012
Authors: Atul Chaturvedi, Varun Shukla
10.5120/4814-7051
PDF

Atul Chaturvedi, Varun Shukla . A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves. International Journal of Computer Applications. 39, 5 (February 2012), 6-8. DOI=10.5120/4814-7051

                        @article{ 10.5120/4814-7051,
                        author  = { Atul Chaturvedi,Varun Shukla },
                        title   = { A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 39 },
                        number  = { 5 },
                        pages   = { 6-8 },
                        doi     = { 10.5120/4814-7051 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A Atul Chaturvedi
                        %A Varun Shukla
                        %T A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves%T 
                        %J International Journal of Computer Applications
                        %V 39
                        %N 5
                        %P 6-8
                        %R 10.5120/4814-7051
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Identification protocols have an important role for building secure communications amongst two or more entities over the internet. In this paper we introduce a new identification scheme (or money transaction protocol) based on the elliptic curve Diffie - Hellman problem. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem is secure.

References
  • ANSI X 9.63, 1999. Elliptic curve key agreement and key transport protocols, American Bankers Association.
  • Debiao He, Sahadeo Padhye and Jianhua Chen. An efficient certificateless two-party authenticated key agreement protocol, http://eprint.iacr.org/2011/478
  • Debiao He, Cryptanalysis of an Authenticated Key Agreement Protocol for Wireless Mobile Communications, http://eprint.iacr.org/2011/336
  • N. Koblitz, 1987. Elliptic curve cryptosystems, Mathematics of Computation, 48, 203 – 209.
  • N. Koblitz, 1992. CM – Curves with good cryptographic properties, Proceedings of crypto’ 91, Santa Barbara, USA.
  • L. Law, A. Menezes, M. Qu, J. Solinas and S. Vanstone, 1998. An efficient Protocol for authenticated key Agreement, Technical Report CORR 98 – 05, Department of CO, University of Waterloo.
  • V. Miller, 1986. Use of elliptic curves in cryptography, Proceedings of Crypto’ 85, Santa Barbara, USA, 417 – 426.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Identification schemes elliptic curve Diffie – Hellman problem secure communication discrete logarithm problem

Powered by PhDFocusTM