A very small bytecode-verifier based on PCC algorithm for smart card

DOI10.1007/3-540-45036-X_11MaRDI QIDQ4442184zbMATH OpenFDO

Authors Jeung-Bo Cho, Min-Soo Jung

Publication date 20 January 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2713/27130106.htm

zbMATH Keywords

BytecodeJavaJava Card Virtual MachineSmart CardVerifier

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• On-card bytecode verification for Java card
• Bytecode verification on Java smart cards
• Lightweight bytecode verification
• Java bytecode verification: An overview
• Java bytecode verification: Algorithms and formalizations

Cited in

(6)

• A B model for ensuring soundness of a large subset of the Java card virtual machine
• scientific article; zbMATH DE number 2088502 (Why is no real title available?)
• Reducing the memory complexity of type-inference algorithms
• On-card bytecode verification for Java card
• Bytecode verification on Java smart cards
• Implementation of Java card virtual machine

This page was built for publication: A very small bytecode-verifier based on PCC algorithm for smart card

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4442184)