Advanced control flow in Java card programming
Authors: 
Peng Li, Steve ZdancewicAuthors Info & Claims
Abstract
Java Card technology simplifies the development of smart card applications by providing a high-level programming language similar to Java. However, the master-slave programming model used in current Java Card platform creates control flow difficulties when writing complex card programs, making it inconvenient, tedious, and error-prone to implement Java Card applications. This paper examines these drawbacks of the master-slave model and proposes a concurrent thread model for developing future Java Card programs, which is much closer to conventional Java network programming. This paper also presents a code translation algorithm and a corresponding tool that makes it possible to write card programs in the concurrent thread model without losing compatibility with the existing Java Card API.
References
[1]
A. Appel. Compiling with Continuations. Cambridge University Press, 1992.]]
[2]
E. W. Dijkstra. Go to statement considered harmful. Comm. of the ACM, 11(3):147--148, Mar. 1968.]]
[3]
S. E. Ganz, D. P. Friedman, and M. Wand. Trampolined style. In International Conference on Functional Programming, pages 18--27, 1999.]]
[4]
P. Graunke, S. Krishnamurthi, S. V. D. Hoeven, and M. Felleisen. Programming the Web with high-level programming languages. In European Symposium on Programming, 2001.]]
[5]
C. A. Gunter. Open APIs for embedded security. In Proc. of the European Conference on Object-Oriented Programming (ECOOP), 2003.]]
[6]
P. H. Hartel and E. K. de Jong. A programming and a modelling perspective on the evaluation of Java card implementations. In I. Attali and T. Jensen, editors, 1st Java on Smart Cards: Programming and Security (Java Card Workshop), volume LNCS 2041, pages 52--72, Cannes, France, Sep 2000. Springer-Verlag, Berlin.]]
[7]
A. Igarashi, B. Pierce, and P. Wadler. Featherweight java. In Conference of Object-Oriented Programming, Systems, Languages and Applications, volume~34 of ACM SIGPLAN Notices. ACM Press, Oct. 1999.]]
[8]
R. Kelsey, W. Clinger, and J. R. (Editors). Revised5 report on the algorithmic language Scheme. ACM SIGPLAN Notices, 33(9):26--76, 1998.]]
[9]
R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.]]
[10]
C. Queinnec. The influence of browsers on evaluators or, continuations to program Web servers. ACM SIGPLAN Notices, 35(9):23--33, 2000.]]
[11]
L. Zheng, S. Chong, S. Zdancewic, and A. C. Myers. Building secure distributed systems using replication and partitioning. In IEEE 2003 Symposium on Security and Privacy. IEEE Computer Society Press, 2003.]]
Index Terms
- Advanced control flow in Java card programming
Recommendations
Advanced control flow in Java card programming
LCTES '04: Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systemsJava Card technology simplifies the development of smart card applications by providing a high-level programming language similar to Java. However, the master-slave programming model used in current Java Card platform creates control flow difficulties ...
Implementing FISC IC Card Specification and Developing Health Care Application Using Java Card
MSE '00: Proceedings of the 2000 International Conference on Microelectronic Systems EducationJava Card specification extends Java technology into smart card. FIX IC card specificationis the only financial smart card standard in Taiwan. In the Peng-Hu Health Care IC Card Project, we adopted FIX-compatible IC cards. In this paper we describe an ...
Combined software and hardware attacks on the java card control flow
CARDIS'11: Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced ApplicationsThe Java Card uses two components to ensure the security of its model. On the one hand, the byte code verifier (BCV) checks, during an applet installation, if the Java Card security model is ensured. This mechanism may not be present in the card. On the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2004276 pages
Copyright © 2004 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2004
Published in SIGPLAN Volume 39, Issue 7
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 985Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in