Developing provable secure M-commerce applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3995 LNCS, Issue , 2006, Pages 115-129

  Grandy, Holger ^a   Haneberg, Dominik ^a   Reif, Wolfgang ^a   Stenzel, Kurt ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CODES (SYMBOLS); COMMERCE; JAVA PROGRAMMING LANGUAGE; NETWORK PROTOCOLS; TICKET ISSUING MACHINES;

COMMERCE APPLICATIONS; ELECTRONIC TICKETING SYSTEMS; JAVA CODES; MODELING FRAMEWORK;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 33746654922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11766155_9     Document Type: Conference Paper

References (29)

1. [AN95] R. Anderson and R. Needham. Programming Satan's Computer. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments. Springer LNCS 1000, 1995.
2. [BAN89] M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society of London, (Series A, 426, 1871), 1989.
3. [BDW99] C. Bolton, J. Davies, and J.C.P. Woodcock. On the refinement and simulation of data types and processes. In K. Araki, A. Galloway, and K. Taguchi, editors, Proceedings of the International conference of Integrated Formal Methods (IFM), pages 273-292. Springer, 1999.
4. [Bee] Tickets on your Mobile. URL: http://www.beep.nl [last seen 2006-03-16].
5. [BGW01] Nikita Borisov, Ian Goldberg, and David Wagner. Intercepting Mobile Mommunications: The Insecurity of 802.11. In MobiCom '01: Proceedings of the 7th annual international conference on Mobile computing and networking, pages 180-189, New York, NY, USA, 2001. ACM Press.
6. [BMV03] David Basin, Sebastian Mödersheim, and Luca Viganò. An On-The-Fly Model-Checker for Security Protocol Analysis. In Proceedings of Esorics'03, LNCS 2808, pages 253-270. Springer-Verlag, Heidelberg, 2003.
7. [Bör03] E. Börger. The ASM Refinement Method. Formal Aspects of Computing, 15 (1-2): 237-257, November 2003.
8. [BRS+00] M. Balser, W. Reif, G. Schellhorn, K. Stenzel, and A. Thums. Formal system development with KIV. In T. Maibaum, editor, Fundamental Approaches to Software Engineering, number 1783 in LNCS. Springer-Verlag, 2000.
9. [BS03] E. Börger and R. F. Stärk. Abstract State Machines - A Method for High-Level System Design and Analysis. Springer-Verlag, 2003.
10. [DB01] J. Derrick and E. Boiten. Refinement in Z and in Object-Z : Foundations and Advanced Applications. FACIT. Springer, 2001.
11. [dRE98] W. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison, volume 47 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
12. [DY83] D. Dolev and A. Yao. On the security of public key protocols. In IEEE Transactions on Information Theory, volume 29, 1983.
13. [GSR05] H. Grandy, K. Stenzel, and W. Reif. Object-Oriented Verification Kernels for Secure Java Applications. In B. Aichering and B. Beckert, editors, SEFM 2005-3rd IEEE International Conference on Software Engineering and Formal Methods. IEEE Press, 2005.
14. [Gur95] M. Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
15. [HGRS05] D. Haneberg, H. Grandy, W. Reif, and G. Schellhorn. Verifying Security Protocols: An ASM Approach. In D. Beauquier, E. Börger, and A. Slissenko, editors, 12th Int. Workshop on Abstract State Machines, ASM 05. University Paris 12 ∼ Val de Marne, Créteil, France, March 2005.
16. [HHS86] He Jifeng, C. A. R. Hoare, and J. W. Sanders. Data refinement refined. In B. Robinet and R. Wilhelm, editors, Proc. ESOP 86, volume 213 of Lecture. Notes in Computer Science, pages 187-196. Springer-Verlag, 1986.
17. [HKT00] D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
18. [HRS02] D. Haneberg, W. Reif, and K. Stenzel. A Method for Secure Smartcard Applications. In H. Kirchner and C. Ringeissen, editors, Algebraic Methodology and Software. Technology, Proceedings AMAST 2002. Springer LNCS 2422, 2002.
19. [KIV] Web presentation of KIV projects. URL: http://www.informatik.uni-augsburg.de/swt/projects/.
20. [Low96] G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 1055, pages 147-166. Springer-Verlag, 1996.
21. [Mea96] Catherine Meadows. The NRL protocol analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
22. [Pau98] Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
23. [Sch01] G. Schellhorn. Verification of ASM Refinements Using Generalized Forward Simulation. Journal of Universal Computer Science (J.UCS), 7(11):952-979, 2001. URL: http://hyperg.iicm.tu-graz.ac.at/jucs/.
24. [Sch05] G. Schellhorn. ASM Refinement and Generalizations of Forward Simulation in Data Refinement: A Comparison. Journal of Theoretical Computer Science, vol. 336, no. 2-3:403-435, May 2005.
25. [Ste04] K. Stenzel. A formally verified calculus for full Java Card. In C. Rattray, S. Maharaj, and C. Shankland, editors, Algebraic Methodology and Software Technology (AMAST) 2004, Proceedings, Stirling Scotland, July 2004. Springer LNCS 3116.
26. [Ste05] Kurt Stenzel. Verification of Java Card Programs. PhD thesis, Universität Augsburg, Fakultät für Angewandte Informatik, URL: http://www.opus-bayern.de/uni-augsburg/volltexte/2005/122/, 2005.
27. [Sun] Sun Microsystems Inc. Java Micro Edition. URL: http://java.sun.com/j2me/index.jsp.
28. [WD96] J. C. P. Woodcock and J. Davies. Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science, 1996.
29. [WS96] David Wagner and Bruce Schneier. Analysis of the SSL 3.0 protocol. In 2nd USENIX Workshop on Electronic Commerce, November 1996. A revised version is available at http://www.schneier.com/paper-ssl.html.