Research Article

Analysis of a Known Offline E-Coin System

by  Sattar J. Aboud, Ammar Agoun
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 98 - Issue 15
Published: July 2014
Authors: Sattar J. Aboud, Ammar Agoun
10.5120/17261-7613
PDF

Sattar J. Aboud, Ammar Agoun . Analysis of a Known Offline E-Coin System. International Journal of Computer Applications. 98, 15 (July 2014), 27-30. DOI=10.5120/17261-7613

                        @article{ 10.5120/17261-7613,
                        author  = { Sattar J. Aboud,Ammar Agoun },
                        title   = { Analysis of a Known Offline E-Coin System },
                        journal = { International Journal of Computer Applications },
                        year    = { 2014 },
                        volume  = { 98 },
                        number  = { 15 },
                        pages   = { 27-30 },
                        doi     = { 10.5120/17261-7613 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2014
                        %A Sattar J. Aboud
                        %A Ammar Agoun
                        %T Analysis of a Known Offline E-Coin System%T 
                        %J International Journal of Computer Applications
                        %V 98
                        %N 15
                        %P 27-30
                        %R 10.5120/17261-7613
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In 2012, Fan et al. presented the user recoverable offline e-coin system with rapid anonymity revoking. The authors claimed that their system can accomplish the security needs of e-coin scheme such as unlinkability, over-spending checking, anonymity control and rapid anonymity revoking on over-spending. They added prove unforgeability characteristic. But, in this paper we demonstrate that a system cannot reach the two proven security characteristics, unlinkability and anonymity. So, we adjust the scheme to contain these two characteristics which are vital in any e-coin scheme.

References
  • Chaum, D. 1982, Blind Signatures for Untraceable Payments, CRYPTO82, pp. 199–203, Plenum Press, New York.
  • Tan, Garry Wei-Han, 2014, NFC Mobile Credit Card: The Next Frontier of Mobile Payment, Telematics and Informatic, 31, pp. 292–307.
  • Brands, S. 1993, Untraceable Off-line Cash in Wallets with Observers, CRYPTO93, volume 773 of Lecture Notes in Computer Science, pages 302-318, Springer.
  • Baldimtsi, F. and Lysyanskaya, A. 2012, On the Security of One-Witness Blind Signature Schemes, IACR Cryptology ePrint Archive, 2012:197.
  • Abe, M. 2001, A Secure Three-Move Blind Signature Scheme for Polynomial Many Signatures, EUROCRYPT2001, volume 2045 of Lecture Notes in Computer Science, pp. 136–151, Springer.
  • Ohkubo, M. and Abe, M. 2003, Security of Three-move Blind Signature Schemes Reconsidered, SCIS03, Symposium on Cryptography and Information Security, Japan.
  • T Heydt-Benjamin, Chae, H. Defend, B. and Fu, K. 2006, Privacy for Public Transportation, Privacy Enhancing Technologies, volume 4258, Lecture Notes in Computer Science, pp. 1–19, Springer.
  • Clemente-Cuervo, E. Rodríguez-Henríquez, F. Arroyo, D. and Ertaul, L. 2007, A PDA Implementation of an Off-line e-Cash Protocol, Security and Management, pp. 452–458, CSREA Press.
  • Blass, E. Kurmus, A. Molva, R. and Strufe, T. 2009, private and secure payment with RFID, WPES, pp. 51–60, ACM.
  • Batina, L. Hoepman, J. Jacobs, B. Mostowski, W. and Vullers, P. 2010, Developing Efficient Blinded Attribute Certificates on Smart Cards via Pairings, volume 6035 of Lecture Notes in Computer Science, pages 209–222, Springer.
  • Derler, D. Potzmader, K. Winter, J. and Dietrich, K. 2011, Anonymous Ticketing for NFC-Enabled Mobile Phones, INTRUST, volume 7222 of Lecture Notes in Computer Science, pages 66–83, Springer.
  • Baldimtsi F. and Lysyanskaya, A. 2012, Anonymous Credentials Light, IACR Cryptology ePrint Archive, 2012:298.
  • Pirker M. and Slamanig, D, 2012, A Framework for Privacy-Preserving Mobile Payment on Security Enhanced ARM TrustZone Platforms", TrustCom, pp. 1155–1160, IEEE Computer Society.
  • CI Fan, VSM Huang, and YC Yu, 2012, User Efficient Recoverable Off-line E-cash Scheme with Fast Anonymity Revoking, Mathematical and Computer Modeling, Vol. 58, No. 1-2, pp. 227-237.
  • Liu, J. K. Tsang, P. P. , and Wong, D. S. 2005, Recoverable and Untraceable E-cash, in: Euro PKI 2005, in: Lecture Notes in Computer Science, vol. 3545, Springer-Verlag, pp. 206–214.
  • Qiu, W. 2007, A Fair Off-line Electronic Payment System, in: Studies in Computational Intelligence, Springer-Verlag, pp. 177–195.
  • Hou, X. and Tan, C. H. 2004, Fair traceable off-line electronic cash in wallets with observers, in: Advanced Communication Technology, IEEE Computer Society, Phoenix Park, Korea, 2004, pp. 595–599.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Digital signatures discrete logarithm problem cryptanalysis RSA e-commerce and payment

Powered by PhDFocusTM