Developing Provable Secure M-Commerce Applications

  • Holger Grandy
  • Dominik Haneberg
  • Wolfgang Reif
  • Kurt Stenzel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3995)


We present a modeling framework and a verification technique for m-commerce applications. Our approach supports the development of secure communication protocols for such applications as well as the refinement of the abstract protocol descriptions into executable Java code without any gap. The technique is explained using an interesting m-commerce application, an electronic ticketing system for cinema tickets. The verification has been done with KIV [BRS + 00].


Mobile Phone Security Protocol Security Property Proof Obligation Symbolic Execution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AN95]
    Anderson, R., Needham, R.: Programming Satan’s Computer. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, Springer, Heidelberg (1995)CrossRefGoogle Scholar
  2. [BAN89]
    Burrows, M., Abadi, M., Needham, R.: A logic of authentication. Proceedings of the Royal Society of London (Series A, 426, 1871) (1989)Google Scholar
  3. [BDW99]
    Bolton, C., Davies, J., Woodcock, J.C.P.: On the refinement and simulation of data types and processes. In: Araki, K., Galloway, A., Taguchi, K. (eds.) Proceedings of the International conference of Integrated Formal Methods (IFM), pp. 273–292. Springer, Heidelberg (1999)Google Scholar
  4. [Bee]
    Tickets on your Mobile (last seen March 16, 2006),
  5. [BGW01]
    Borisov, N., Goldberg, I., Wagner, D.: Intercepting Mobile Mommunications: The Insecurity of 802.11. In: MobiCom 2001: Proceedings of the 7th annual international conference on Mobile computing and networking, pp. 180–189. ACM Press, New York (2001)Google Scholar
  6. [BMV03]
    Basin, D., Mödersheim, S., Viganò, L.: An On-the-Fly Model-Checker for Security Protocol Analysis. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol. 2808, pp. 253–270. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. [Bör03]
    Börger, E.: The ASM Refinement Method. Formal Aspects of Computing 15(1–2), 237–257 (2003)CrossRefzbMATHGoogle Scholar
  8. [BRS+00]
    Balser, M., Reif, W., Schellhorn, G., Stenzel, K., Thums, A.: Formal System Development with KIV. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol. 1783, p. 363. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. [BS03]
    Börger, E., Stärk, R.F.: Abstract State Machines—A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)CrossRefzbMATHGoogle Scholar
  10. [DB01]
    Derrick, J., Boiten, E.: Refinement in Z and in Object-Z: Foundations and Advanced Applications. In: FACIT, Springer, Heidelberg (2001)Google Scholar
  11. [dRE98]
    de Roever, W., Engelhardt, K.: Methods of Algorithmic Language Implementation. Cambridge Tracts in Theoretical Computer Science, vol. 47. Cambridge University Press, Cambridge (1998)CrossRefzbMATHGoogle Scholar
  12. [DY83]
    Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory 29 (1983)Google Scholar
  13. [GSR05]
    Grandy, H., Stenzel, K., Reif, W.: Object-Oriented Verification Kernels for Secure Java Applications. In: Aichering, B., Beckert, B. (eds.) SEFM 2005 – 3rd IEEE International Conference on Software Engineering and Formal Methods. IEEE Press, Los Alamitos (2005)Google Scholar
  14. [Gur95]
    Gurevich, M.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)Google Scholar
  15. [HGRS05]
    Haneberg, D., Grandy, H., Reif, W., Schellhorn, G.: Verifying Security Protocols: An ASM Approach. In: Beauquier, D., Börger, E., Slissenko, A. (eds.) 12th Int. Workshop on Abstract State Machines, ASM 2005, University Paris 12 – Val de Marne, Créteil, France (March 2005)Google Scholar
  16. [HHS86]
    Jifeng, H., Hoare, C.A.R., Sanders, J.W.: Data refinement refined. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187–196. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  17. [HKT00]
    Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  18. [HRS02]
    Haneberg, D., Reif, W., Stenzel, K.: A Method for Secure Smartcard Applications. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, p. 319. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. [KIV]
    Web presentation of KIV projects,
  20. [Low96]
    Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  21. [Mea96]
    Meadows, C.: The NRL protocol analyzer: An overview. Journal of Logic Programming 26(2), 113–131 (1996)CrossRefzbMATHGoogle Scholar
  22. [Pau98]
    Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6, 85–128 (1998)CrossRefGoogle Scholar
  23. [Sch01]
    Schellhorn, G.: Verification of ASM Refinements Using Generalized Forward Simulation. Journal of Universal Computer Science (J.UCS) 7(11), 952–979 (2001), MathSciNetGoogle Scholar
  24. [Sch05]
    Schellhorn, G.: ASM Refinement and Generalizations of Forward Simulation in Data Refinement: A Comparison. Journal of Theoretical Computer Science 336(2-3), 403–435 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  25. [Ste04]
    Stenzel, K.: A Formally Verified Calculus for Full Java Card. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 491–505. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  26. [Ste05]
    Stenzel, K.: Verification of Java Card Programs. PhD thesis, Universität Augsburg, Fakultät für Angewandte Informatik (2005),
  27. [Sun]
    Sun Microsystems Inc. Java Micro Edition,
  28. [WD96]
    Woodcock, J.C.P., Davies, J.: Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science (1996)Google Scholar
  29. [WS96]
    Wagner, D., Schneier, B.: Analysis of the SSL 3.0 protocol. In: 2nd USENIX Workshop on Electronic Commerce, (November 1996) (A revised version is available at),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Holger Grandy
    • 1
  • Dominik Haneberg
    • 1
  • Wolfgang Reif
    • 1
  • Kurt Stenzel
    • 1
  1. 1.Lehrstuhl für Softwaretechnik und Programmiersprachen, Institut für InformatikUniversität AugsburgAugsburgGermany

Personalised recommendations