1. Home
  2. Issues
  3. Volume 30, Issue 2 (2019)
  4. Security, Trustworthiness and Effectivit ...

Informatica


Security, Trustworthiness and Effectivity Analysis of an Offline E-Cash System with Observers
Volume 30, Issue 2 (2019), pp. 327–348
Pub. online: 5 August 2022      Type: Research Article      Open accessOpen Access
Received
1 November 2018
Accepted
1 March 2019
Published
5 August 2022

Abstract

In our previous paper we presented an offline e-cash system with observers. We have shown that the proposed system satisfies basic requirements for e-cash schemes. We also covered such security issues as chosen message attack resistance and forgery of protocols data. However, in that paper we focused more on the system itself, rather than its analysis.
Hence, here we present cryptanalysis of our system. We aim to prove that existential forgery of data is not possible due to complexity of the discrete logarithm problem. Furthermore, we perform the analysis of trustworthiness of the system using the so-called BAN logic. Also, we consider effectivity of the proposed e-cash system in observers with limited computational resources.

References

 
Au, M.H., Susilo, W., Mu, Y. (2007). Practical compact e-cash. In: Australasian Conference on Information Security and Privacy. Springer, Berlin, Heidelberg, pp. 431–445.
 
Brands, S.A. (1993). An efficient off-line electronic cash system based on the representation problem. Centrum voor Wiskunde en Informatica.
 
Burrows, M., Abadi, M., Needham, R.M. (1989). A logic of authentication. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 426, 233–271. 1871.
 
Chan, A., Frankel, Y., Tsiounis, Y. (1998). Easy come-easy go divisible cash. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 561–575.
 
Chaum, D., Fiat, A., Naor, M. (1988). Untraceable electronic cash. In: Conference on the Theory and Application of Cryptography. Springer, New York, NY, pp. 319–327.
 
Chaum, D., Pedersen, T.P. (1992). Transferred cash grows in size. In: Workshop on the Theory and Application of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 390–407.
 
Cramer, R., Shoup, V. (2003). Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 33(1), 167–226.
 
D’Amiano, S., Di Crescenzo, G. (1994). Methodology for digital money based on general cryptographic tools. In: Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 156–170.
 
Diffie, W., Hellman, M. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22(6), 644–654.
 
Eng, T., Okamoto, T. (1994). Single-term divisible electronic coins. In: Workshop on the Theory and Application of of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 306–319.
 
Guilford, J., Yap, K., Gopal, V. (2012). Fast SHA-256 implementations on Intel architecture processors. IA Architects.
 
Fuchsbauer, G. (2009). Automorphic signatures in bilinear groups and an application to round-optimal blind signatures. IACR Cryptology ePrint Archive, 2009, 320.
 
Hinterwälder, G., Zenger, C.T., Baldimtsi, F., Lysyanskaya, A., Paar, C., Burleson, W.P. (2013). Efficient e-cash in practice: NFC-based payments for public transportation systems. In: International Symposium on Privacy Enhancing Technologies Symposium. Springer, Berlin, Heidelberg, pp. 40–59.
 
Hinterwälder, G., Riek, F., Paar, C. (2015). Efficient E-cash with attributes on MULTOS smartcards. In: International Workshop on Radio Frequency Identification: Security and Privacy Issues. Springer, Cham, pp. 141–155.
 
Hwang, R.J., Su, F.F., Yeh, Y.S., Chen, C.Y. (2005). An efficient decryption method for RSA cryptosystem. In: Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05). IEEE, pp. 585–590.
 
Juang, W.S. (2010). RO-cash: an efficient and practical recoverable pre-paid offline e-cash scheme using bilinear pairings. Journal of Systems and Software, 83(4), 638–645.
 
Knuth, D.E. (1981). The Art of Programming, Vol. 2, Semi-Numerical Algorithms. Addison Wesley, Reading, MA.
 
Kreft, H., Adi, W. (2006). fairCASH-A digital cash candidate for the proposed GCC gulf dinar. In: Innovations in Information Technology. IEEE, pp. 1–5.
 
Muleravičius, J., Sakalauskas, E., Timofejeva, I. (2016). On methodology of E-wallet construction for partially ff-line payment system. In: International Conference on Information and Software Technologies. Springer, Cham, pp. 753–765.
 
Okamoto, T. (1995). An efficient divisible electronic cash scheme. In: Annual International Cryptology Conference. Springer, Berlin, Heidelberg, pp. 438–451.
 
Pfitzmann, A., Köhntopp, M. (2001). Anonymity, unobservability, and pseudonymity – a proposal for terminology. In: Designing Privacy Enhancing Technologies. Springer, Berlin, Heidelberg, pp. 1–9.
 
Petersen, H., Poupard, G. (1997). Efficient scalable fair cash with off-line extortion prevention. In: International Conference on Information and Communications Security. Springer, Berlin, Heidelberg, pp. 463–477.
 
Pointcheval, D., Stern, J. (2000). Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3), 361–396.
 
Rosenberg, B. (2010). Handbook of Financial Cryptography and Security. CRC Press.
 
Stadler, M., Piveteau, J.M., Camenisch, J. (1995). Fair blind signatures. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 209–219.
 
Sakalauskas, E., Timofejeva, I., Michalkovič, A., Muleravičius, J. (2018). A simple off-line E-cash system with observers. Information Technology and Control, 47(1), 107–117.
 
Tsiounis, Y. (1997). Efficient Electronic Cash: New Notions and Techniques. PhD thesis, College of Computer Science.
 
Waters, B. (2005). Efficient identity-based encryption without random oracles. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp. 114–127.

Biographies

Muleravicius Jonas
jonas.muleravicius@ktu.edu

J. Muleravicius is currently seeking a PhD degree at Kaunas University of Technology. His research interest is in cryptography focusing in development and analysis of e-cash systems. During the last 5 years he made contributions to 3 papers on this topic.

Timofejeva Inga
inga.timofejeva@ktu.edu

I. Timofejeva is currently seeking a master degree at Kaunas University of Technology. One of her many scientific research interests is cryptography. Currently her interests are focused in the development and analysis e-cash systems. She contributed to 3 papers on this topic.

Mihalkovich Aleksejus
aleksejus.michalkovic@ktu.lt

A. Mihalkovich received PhD degree from Kaunas University of Technology, in 2015. Currently he is an assistant professor in Department of Applied Mathematics in Kaunas University of Technology. His main research interest is focused in cryptography and cryptanalysis. During the last 5 years he made contributions to 4 papers published in Thompson Reuters database journals.

Sakalauskas Eligijus
eligijus.sakalauskas@ktu.lt

E. Sakalauskas received PhD degree from Kaunas Polytechnical Institute, in 1983. Currently he is a professor in Department of Applied Mathematics in Kaunas University of Technology. In recent time his research interests are focused in cryptography. The main research results in this field were published in over 15 papers.


Full article Cited by PDF XML
Full article Cited by PDF XML

Copyright
© 2019 Vilnius University
Open access article under the CC BY license.

Keywords
e-cash BAN logic observers computation time

Metrics
since January 2020
1866

Article info
views

615

Full article
views

821

PDF
downloads

274

XML
downloads


Share


RSS