Institute of Information & System Technology,Huazhong Univ. of Sci & Tech.,Wuhan 430074, China

---

Abstract—The bytecode verification is a key point of the security chain of the Java Platform. This feature is optional in many embedded devices since the memory requirements of the verification process and the process capability of hardware are too high. In this paper we propose a verifier that utilizes the logical flow graph based cache policy and an improved non stressing type coding method, for the bytecode verification on the Java card, which remarkably reduces the use of the memory by the scheduling algorithm of the bytecode verifier. Off-card pre-processing is unnecessary for the bytecode, hence it is possible to be implemented on card and to prevent any bytecode, which is correct yet not pre-processed, from being refused by the oncard verifier. This algorithm also features strong transportability and feasibility with a perfect verification process based on traditional bytecode verification. The results of the experiments show that this bytecode verification can be performed directly on small memory systems.

Index Terms—Java card, bytecode verification, type deduction, cache scheduling policy.

[PDF]

Cite: Tongyang Wang, Pengfei Yu, Jun-jun Wu, Xin-long Ma, "Research on On-card Bytecode Verifier for Java Cards," Journal of Computers vol. 4, no. 6, pp. 502-509, 2009.