WO2004066129A2 - System for communicating program data between a first device and a second device - Google Patents

System for communicating program data between a first device and a second device Download PDF

Info

Publication number
WO2004066129A2
WO2004066129A2 PCT/US2004/001049 US2004001049W WO2004066129A2 WO 2004066129 A2 WO2004066129 A2 WO 2004066129A2 US 2004001049 W US2004001049 W US 2004001049W WO 2004066129 A2 WO2004066129 A2 WO 2004066129A2
Authority
WO
WIPO (PCT)
Prior art keywords
fingeφrint
program
smart card
data
apdus
Prior art date
Application number
PCT/US2004/001049
Other languages
French (fr)
Other versions
WO2004066129A3 (en
Inventor
Eduard K. De Jong
Original Assignee
Sun Microsystems, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sun Microsystems, Inc. filed Critical Sun Microsystems, Inc.
Publication of WO2004066129A2 publication Critical patent/WO2004066129A2/en
Publication of WO2004066129A3 publication Critical patent/WO2004066129A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/34Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters 
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/30Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/36Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
    • G06Q20/367Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/30Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/36Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
    • G06Q20/367Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes
    • G06Q20/3672Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes initialising or reloading thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Definitions

  • the present invention relates to the field of computer science. More particularly, the present invention relates to communicating program data between a first device and a second device. BACKGROUND OF THE INVENTION
  • FIG. 1 is a block diagram that illustrates a typical mechanism for communicating program data between a host computer and a smart card.
  • Smart cards 110 typically communicate with other computers 100 via APDUs (Application Protocol Data Units).
  • the APDU protocol is specified in International Standard ISO/IEC 7816-3.
  • An APDU includes either a command 115 or a response 120 message.
  • a smart card 110 receives a command APDU 115 from a host computer 100, executes the instruction specified in the command 115 and replies to the host computer 100 with a response APDU 120.
  • Command APDUs 115 and response APDUs 120 are exchanged alternately between a card 110 and a host computer 100.
  • APDU messages comprise two structures. One structure is used by a host application on a loading terminal to send commands to the card. The other stracture is used by the card to send responses back to the host application.
  • the former is referred to as the command APDU (C-APDU) and the latter is referred to as the response APDU (R-APDU).
  • C-APDU command APDU
  • R-APDU response APDU
  • Java CardTM technology enables programs written in the JavaTM programming language to run on smart cards and other resource-constrained devices.
  • Java CardTM technology is described in Z. Chen, Java CardTM Technology for Smart Cards (2000).
  • FIG. 3 a block diagram that illustrates loading a converted applet (CAP) file is presented.
  • the Java CardTM Virtual Machine (JCVM) comprises an on-card portion that includes the Java CardTM bytecode inte ⁇ reter 345 and an off-card portion called a converter 310. Taken together, the inte ⁇ reter 345 and the converter 310 implement all the virtual machine functions, including loading JavaTM class files 300 and executing them with a particular set of semantics.
  • the converter 310 loads and pre- processes the class files 300 that comprise a Java CardTM program that may be structured in one or more packages and produces a CAP (converted applet) file 350.
  • CAP converted applet
  • the CAP file 350 is then loaded on a Java CardTM technology-enabled smart card 330 and executed by the inte ⁇ reter 345.
  • the CAP file 350 includes an executable binary representation of the classes in a JavaTM package 350.
  • the Java CardTM inte ⁇ reter 345 provides runtime support of the JavaTM language execution model.
  • the mechanisms to download and install a CAP file 350 are embodied in a unit called the installer 340.
  • the Java CardTM installer 340 resides within the card 330. It cooperates with an off-card installation program 320.
  • the off- card installation program 320 transmits the executable binaiy and possibly other data in a CAP file 350 to the installer 340 running on the card 330 via a loading terminal 325.
  • the installer 340 writes the binary into the smart card memory, links it with the other classes that have already been placed on the card 330 and creates and initializes any data stractures that are used internally by the Java CardTM runtime environment.
  • An optional on-card verifier 335 performs bytecode verification of downloaded code before the downloaded code is inte ⁇ reted by bytecode inte ⁇ reter 345.
  • the APDU protocol limits the size of the payload or data field (reference numeral 240 of FIG. 2) to a small number of bytes (typically less than 128) determined by the restricted size of RAM. Data structures larger than the limitation must be split among the payload portion of multiple APDUs. This splitting is typically performed without regard to the data content. For example, a particular APDU may contain a portion of one data stracture and a portion of another data stracture. This is explained in more detail below, with reference to FIG. 4.
  • FIG. 4 a flow diagram that illustrates loading a CAP file from the perspective of a loading terminal is ⁇ presented.
  • a CAP file is received.
  • the CAP file and associated authentication data is split amongst multiple APDUs.
  • the APDUs are fransmitted to the target smart card according to the APDU protocol.
  • FIG. 5 a flow diagram that illustrates loading a CAP file from the perspective of a smart card is presented.
  • the CAP file is reassembled in the smart card.
  • the reassembled CAP file is decrypted.
  • the decrypted CAP file data is authenticated.
  • the CAP file is authenticated and then decrypted.
  • the CAP file is communicated without encryption.
  • the content of the authenticated CAP file is installed on the smart card.
  • FIG. 6 a flow diagram that illustrates reassembling a CAP file in a smart card is presented.
  • an APDU is received.
  • the APDU is stored in a persistent mutable memory such as an EEPROM (electrically erasable programmable read-only memory). Alternatively, the APDU payload is not stored in a persistent mutable memory.
  • receipt of the APDU is acknowledged.
  • Card memory 700 represents card memory before using embedded link data (704, 712, 728) to link executable code segments (702, 706, 708, 710, 712, 716, 718, 720, 722, 724, 726, 728, 732).
  • Card memory 750 represents card memory after the embedded link data (704, 712, 728) has been used to link executable code segments (702, 706, 708, 710, 712, 716, 718, 720, 722, 724, 726, 728, 732).
  • method “Al A” code 702 calls method “A1C” 708, method “A2A” code 712 calls method “B1A” 720 and method “B2A” code 728 calls method “BID” 726.
  • Method “A1A” link data 704 comprises an indication of how to resolve the reference to method “A1C” 708.
  • Method “A1A” link data 704 may additionally comprise an indication of how method “A1A” code 702 must be modified.
  • method “A2A” link data 714 comprises an indication of how to resolve the reference to method “B1A” 720.
  • Method “A2A” link data 714 may additionally comprise an indication of how method "A2A” code 712 must be modified.
  • method “B2A” link data 730 comprises an indication of how to resolve the reference to method "BID” 726.
  • Method “B2A” link data 730 may additionally comprise an indication of how method “B2A” code 728 must be modified. Referring to card memory 750 of FIG. 7, symbolic references to called methods have been replaced with the addresses of the called methods and the link data is not stored.
  • a system for communicating program data between devices includes a first device configured to disassemble a program file comprising program data into at least one logical data unit, partition each logical data unit into at least one protocol data unit and compute a first fmge ⁇ rint over the payload portion of the protocol data units.
  • the first device is also configured to send the protocol data units and at least one member of the group comprising the first finge ⁇ rint and a first authentication code based on the first finge ⁇ rint to a second device.
  • the second device is configured to compute a second finge ⁇ rint over the payload portion of the protocol data units and to commit the program to a memory based on whether the at least one member matches the second finge ⁇ rint or a second authentication code based on the second finge ⁇ rint.
  • FIG. 1 is a block diagram that illustrates a typical mechanism for communicating program data between a host computer and a smart card.
  • FIG. 2A is a block diagram that illustrates a typical Command Application Protocol Data Unit (C-APDU).
  • C-APDU Command Application Protocol Data Unit
  • FIG. 2B is a block diagram that illustrates a typical Response Application Protocol Data Unit (R-APDU).
  • R-APDU Response Application Protocol Data Unit
  • FIG. 3 is a block diagram that illustrates loading a converted applet (CAP) file.
  • CAP converted applet
  • FIG. 4 is a flow diagram that illustrates loading a CAP file from the perspective of a loading terminal.
  • FIG. 5 is a flow diagram that illustrates loading a CAP file from the perspective of a smart card.
  • FIG. 6 is a flow diagram that illustrates reassembling a CAP file in a smart card.
  • FIG. 7 is a block diagram that illustrates modifying a stored program having link data to resolve static references.
  • FIG. 8 is a block diagram of a computer system suitable for implementing aspects of the present invention.
  • FIG. 9 is a block diagram that illustrates a system for communicating program data between a host computer and a smart card in accordance with one embodiment of the present invention.
  • FIG. 10 is a high level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention.
  • FIG. 11 is a low level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention.
  • FIG. 12 is a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a host computer in accordance with one embodiment of the present invention.
  • FIG. 13 is a block diagram that illustrates partitioning a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention.
  • FIG. 14 is a flow diagram that illustrates a method for using program unit type map information in accordance with one embodiment of the present invention.
  • FIG. 15A is a block diagram that illustrates a CAP file comprising package-structured data.
  • FIG. 15B is a use diagram corresponding to the program within the CAP file of FIG.
  • FIG. 15C is a block diagram that illustrates the CAP file of FIG. 15A ordered based upon the use diagram of FIG. 15B in accordance with one embodiment of the present invention.
  • FIG. 16 is a flow diagram that illustrates a method for ordering program units for optimized verification and linking in accordance with one embodiment of the present invention.
  • FIG. 17A is a block diagram that illustrates a CAP file comprising package-structured data.
  • FIG. 17B is a use diagram corresponding to the program within the CAP file of FIG.
  • FIG. 17C is a block diagram that illustrates the CAP file of FIG. 17A ordered based upon the use diagram of FIG. 17B in accordance with one embodiment of the present invention.
  • FIG. 18 is a flow diagram that illustrates a method for disassembling a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention.
  • FIG. 19 is a flow diagram that illustrates a method for disassembling a CAP file into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
  • FIG. 20A is a flow diagram that illustrates a method for computing an authentication finge ⁇ rint over an APDU data stream where verification APDUs are included in the finge ⁇ rint in accordance with one embodiment of the present invention.
  • FIG. 20B is a flow diagram that illustrates a method for computing an authentication finge ⁇ rint over an APDU data stream where verification APDUs are excluded from the finge ⁇ rint in accordance with one embodiment of the present invention.
  • FIG. 21 is a flow diagram that illustrat ⁇ s a method for communicating program data from a host computer to a loading terminal from the perspective of a loading terminal in accordance with one embodiment of the present invention.
  • FIG. 22 is a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs in accordance with one embodiment of the present invention.
  • FIG. 23 is a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
  • FIG. 24 is a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
  • FIG. 25 is a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs including APDUs comprising link data in accordance with one embodiment of the present invention.
  • FIG. 26 is a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention.
  • FIG. 27 is a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention.
  • FIG. 28 is a flow diagram that illustrates a method for creating one or more method link APDUs in accordance with one embodiment of the present invention.
  • FIG. 29 is a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card in accordance with one embodiment of the present invention.
  • FIG. 30 is a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card using an authentication finge ⁇ rint that is a HMAC in accordance with one embodiment of the present invention.
  • FIG. 31 is a flow diagram that illustrates a method for performing load initialization in accordance with one embodiment of the present invention.
  • FIG. 32 is a flow diagram that illustrates a method for processing a logical APDU stream in accordance with one embodiment of the present invention.
  • FIG. 33 is a flow diagram that illustrates a method for computing an authentication finge ⁇ rint in accordance with one embodiment of the present invention.
  • FIG. 34 is a flow diagram that illustrates a method for processing a logical APDU in accordance with one embodiment of the present invention.
  • FIG. 35 is a block diagram that illustrates data stractures for linking a program including virtual methods in accordance with one embodiment of the present invention.
  • FIG. 36 is a block diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention.
  • FIG. 37 is a flow diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention.
  • FIG. 38 is a block diagram that illustrates a hierarchy of program unit commitment finge ⁇ rints in accordance with one embodiment of the present invention.
  • FIG. 39 is a block diagram that illustrates a data stracture including program code and program unit commitment finge ⁇ rints in accordance with one embodiment of the present invention.
  • FIG. 40 is a block diagram that illustrates a data stracture including program code and a load storage commitment finge ⁇ rint in accordance with one embodiment of the present invention.
  • FIG. 41 is a flow diagram that illustrates a method for using a program unit commitment fmge ⁇ rint to determine whether a program unit may be used, in accordance with one embodiment of the present invention.
  • FIG. 42 is a flow diagram that illustrates a method for determining whether stored program unit data is valid in accordance with one embodiment of the present invention.
  • FIG. 43 is a block diagram that illustrates a smart card configured to ensure a called method has been verified prior to execution in accordance with one embodiment of the present invention.
  • FIG. 44 is a flow diagram that illustrates a method for ensuring a called method has been verified prior to execution in accordance with one embodiment of the present invention.
  • the components, process steps, and/or data stractures may be implemented using various types of operating systems (OS), computing platforms, firmware, computer programs, computer languages, and/or general-pu ⁇ ose machines.
  • OS operating systems
  • the method can be ran as a programmed process running on processing circuitry.
  • the processing circuitry can take the form of numerous combinations of processors and operating systems, or a stand-alone device.
  • the process can be implemented as instructions executed by such hardware, hardware alone, or any combination thereof.
  • the software may be stored on a program storage device readable by a machine.
  • FPLDs field programmable logic devices
  • FPGAs field programmable gate arrays
  • CPLDs complex programmable logic devices
  • ASICs application specific integrated circuits
  • the method may be implemented on a data processing computer such as a personal computer, workstation computer, mainframe computer, or high performance server running an OS such as Solaris® available from Sun Microsystems, Inc. of Santa Clara, California, Microsoft® Windows® XP and Windows® 2000, available from Microsoft Co ⁇ oration of Redmond, Washington, or various versions of the Unix operating system such as Linux available from a number of vendors.
  • the method may also be implemented on a multiple-processor system, or in a computing environment including various peripherals such as input devices, output devices, displays, pointing devices, memories, storage devices, media interfaces for transferring data to and from the processor(s), and the like.
  • a computer system or computing environment may be networked locally, or over the Internet.
  • network includes local area networks, wide area networks, the Internet, cable television systems, telephone systems, wireless telecommunications systems, fiber optic networks, ATM networks, frame relay networks, satellite communications systems, and the like. Such networks are well known in the art and consequently are not further described here.
  • the result of the hash function is independent of the argument order.
  • fin ⁇ rint is defined as the result of a function that identifies or detects one or more changes in a byte sequence.
  • a finge ⁇ rint may comprise a non-commutative hash of an arbitrary byte sequence or a non-commutative hash of a sequence of one or more byte sequences.
  • a finge ⁇ rint may comprise a CRC (cyclic redundancy code), a message digest, or the like.
  • CRC cyclic redundancy code
  • an authentication code is defined as a digital signature, or a Message Authentication Code (MAC) using a block cipher.
  • an authentication code may be generated using the DES algorithm (Federal Information Processing Standards Publication 46-3, -Data Encryption Standard (DES), October 25, 1999; Federal Information Processing Standards Publication 197, Advanced Encryption Standard (AES), November 26, 2001), the Rijndael algorithm (J. Daemen and V. Rijmen, AES Proposal: Rijndael, AES Algorithm submission, September 3, 1999), or the like.
  • An authentication code produced as a result of a keyed hash function is an example of an authentication code that is also a finge ⁇ rint.
  • a keyed hash-based message authentication code is defined as a MAC that uses a cryptographic key in conjunction with a hash function.
  • a HMAC is both a finge ⁇ rint and a MAC.
  • authenticated finge ⁇ rint is defined as an authentication code based at least in part on a finge ⁇ rint.
  • authentication finge ⁇ rint is defined as a finge ⁇ rint used to create an authenticated finge ⁇ rint.
  • the term "session” or "user session” is defined as a period that begins when a user inserts a secure portable device such as a smart card or the like into a communications device such as a loading terminal or card acceptance device (CAD), and ends when the secure portable device is removed from the communications device.
  • a "session ID” is used to describe an identifier that uniquely identifies such a session.
  • One or more session ID may be used to uniquely identify the same session.
  • the term "package-structured data" is defined as executable code using JavaTM-like naming conventions for references to external program units.
  • the JavaTM naming convention for an external class includes a package name followed by the class name.
  • verification APDU is defined as an APDU comprising a command and verification data.
  • the verification data is located within the data field (reference numeral 240 of FIG. 2) of the APDU.
  • link APDU is defined as an APDU comprising a command and link data.
  • the link data is located within the data field (reference numeral 240 of FIG. 2) of the APDU.
  • program unit is defined as an identifiable unit of program behavior.
  • a higher-level program unit may include one or more lower-level program units.
  • a JavaTM class may include one or more method.
  • FIG. 8 depicts a block diagram of a computer system 800 suitable for implementing aspects of the present invention.
  • computer system 800 includes a bus 802 which interconnects major subsystems such as a central processor 804, a system memory 806 (typically RAM), an input/output (I/O) controller 808, an external device such as a display screen 810 via display adapter 812, serial ports 814 and 816, a keyboard 818, a fixed disk drive 820, a floppy disk drive 822 operative to receive a floppy disk 824, and a CD-ROM player 826 operative to receive a CD-ROM 828.
  • a bus 802 which interconnects major subsystems such as a central processor 804, a system memory 806 (typically RAM), an input/output (I/O) controller 808, an external device such as a display screen 810 via display adapter 812, serial ports 814 and 816, a keyboard 818, a fixed disk drive 820, a floppy disk drive 8
  • pointing device 830 e.g., a mouse
  • modem 832 may provide a direct connection to a server via a telephone link or to the Internet via a POP (point of presence).
  • POP point of presence
  • a network interface adapter 834 may be used to interface to a local or wide area network using any network interface system known to those skilled in the art (e.g., Ethernet, xDSL, AppleTalkTM).
  • System 900 comprises a host computer 910, a loading terminal 985 and a smart card 950.
  • Host computer 910 comprises an off-card installer 915 for augmenting a CAP file 980 comprising package- structured data 905 to create an augmented CAP file 920 comprising the package- structured data 925, an authentication finge ⁇ rint 940, one or more loading terminal authentication codes 930 and one or more target smart card authentication codes 935.
  • Augmented CAP file 920 may also comprise verification data 945 that verifies CAP file content.
  • Authentication finge ⁇ rint 940 is computed over the payload portion of logical APDUs derived from the package-structured data 925.
  • Logical APDUs are illustrated in more detail below with reference to FIG. 13.
  • the similarity of the processes used by host computer 910, loading terminal 985 and target smart card 950 to compute an authentication finge ⁇ rint guarantees that if the APDU payload remains the same, the same authentication finge ⁇ rint will be generated regardless of the entity performing the computation. Conversely, if the APDU payload changes between when each entity performs the computation, a different finge ⁇ rint will be generated, signaling a change in the payload.
  • one or more of loading terminal authentication codes 930 and target smart card authentication codes 935 are based at least in part on authentication finge ⁇ rint 940.
  • the authentication finge ⁇ rint 940 comprises a eyed hash-based message authentication code (HMAC).
  • HMAC eyed hash-based message authentication code
  • one or more of loading terminal authentication codes 930 and target smart card authentication codes 935 comprise a digital signature computed over augmented CAP file 920, without regard to logical APDUs.
  • a logical program unit APDU may be followed and/or preceded by one or more APDUs that provide verification information (verification APDU) and/or linking information (link APDU).
  • the verification data may be embedded in the CAP file. Alternatively, the verification data may be computed by the loading terminal. If verification data is included in the CAP file, it may be used to compute an authentication finge ⁇ rint.
  • Linking data may also be computed by the loading terminal. Linking data may be based on data obtained from the card, data obtained from the Web, data in the CAP file, or any combination thereof.
  • loading terminal 985 is configured to receive the augmented CAP file 920, create one or more logical APDUs from package-structured data 925, authenticate the CAP file based at least in part on the loading terminal authentication code 930, create one or more APDUs comprising a selected target smart card authentication code 935 and the authentication finge ⁇ rint 940, and communicate the one or more APDUs to target smart card 950.
  • host computer 910 communicates an augmented CAP file without verification data. According to another embodiment of the present invention, host computer 910 communicates an augmented CAP file having verification data.
  • loading terminal 985 receives an augmented CAP file 920 without verification data, computes verification data and creates one or more verification APDUs.
  • loading terminal 985 receives an augmented CAP file 920 with verification data and creates one or more verification APDUs.
  • loading terminal 985 computes link data and creates one or more link APDUs.
  • smart card 950 comprises a secure portable device such as a Java CardTM technology-enabled smart card, or the like.
  • smart card 950 comprises a CDMA technology-enabled smart card.
  • CDMA technology-enabled smart cards are described in Smart Card Stage I Description, Version 1.1, CDMA Development Group - Smart Card Team Document (May 22, 1996).
  • smart card 950 comprises a SIM (Subscriber Identity Module card) card.
  • SIM Subscriber Identity Module
  • GSM Global System for Mobile Communications
  • the SIM includes the subscriber's personal cryptographic identity key and other information such as the current location of the phone and an address book of frequently called numbers.
  • the SIM is described in Digital cellular telecommunications system (phase 2+); Specification of the Subscriber Identity Module -Mobile Equipment (SIM -ME) interface, ETSI, GSM 11.11 version 7.4.0, Release 1998.
  • smart card 950 comprises a WIM (Wireless Interface Module).
  • a WIM is a smart card in a WAP (Wireless Application Protocol) phone. It is described in Wireless Identity Module Part: Security, WAP-260-WIM-20010712-a , Wireless Application Protocol Forum, July 12, 2001.
  • smart card 950 comprises a USIM (Universal Subscriber Identity Module).
  • a USIM is a smart card for a 3GPP (3 rd Generation Partnership Project) mobile phone. It is described in 3rd Generation Partnership Project; Technical Specification Terminals; USIM and IC card requirements, Release 4, 3GPP TS 21.111 V4.0.0 (2001-03).
  • smart card 950 comprises a UIM (User Identity Module).
  • a UIM is a smart card for a 3GPP Project 2 (3GPP2) mobile phone.
  • the term "R-UIM” is used when the smart card is removable.
  • a UIM is a super set of the SIM and allows CDMA (Code Division Multiple Access)- based cellular subscribers to roam across geographic and device boundaries.
  • the R-UIM is described in a specification issued by the 3rd Generation Partnership Project 2 (3GPP2) and entitled 3rd Generation Partnership Project 2; Removable User Identity Module (R-UIM) for cdma2000 Spread Spectrum Systems, 3GPP2 C.S0023-0, June 9, 2000.
  • FIG. 10 a high level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention is presented.
  • an augmented CAP file is prepared.
  • the augmented CAP file may comprise package-stractured data and an authentication finge ⁇ rint computed over an APDU data stream comprising the package- stractured data.
  • the augmented CAP file may comprise package-stractured data and at least one authentication code based at least in part on the authentication finge ⁇ rint.
  • preparing an augmented CAP file (1020) is preceded by determining a loading order of program elements for optimized verification and linking (1015).
  • the load order used in 1015 may be used in 1020 to determine the order of logical APDUs in the computation of the authentication fmge ⁇ rint.
  • the loading order for one or more classes, methods in classes or fields in methods is determined.
  • the program elements may be ordered based at least in part on a use graph of the program in the CAP file.
  • the "use" of a method may comprise, by way of example, calling the method.
  • the "use" of a field may comprise, by way of example, accessing the field.
  • the program elements may also be ordered based at least in part on type map information defined for the program. Type maps are explained in more detail below with reference to FIG. 14. Ordering program elements is explained in more detail below with reference to FIGS. 15A-15C.
  • the augmented CAP file is communicated to a loading terminal.
  • the loading terminal receives the augmented CAP file and initializes loading of an applet.
  • authenticated applet code is loaded on a target smart card.
  • applets are initialized.
  • a proof of loading received from the target smart card is processed to determine and record whether the load was successful.
  • smart card 1050 receives a load request from the loading terminal.
  • the smart card processes logical APDUs received from the loading terminal.
  • the processing includes computing an authentication finge ⁇ rint over the APDU payload.
  • initialization data received from the loading terminal is sed to initialize the smart card.
  • a proof of loading is sent to the loading terminal.
  • FIG. 11 a low level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention.
  • Figure 11 provides more detail for FIG. 10. More particularly, reference numerals 1106-1116, 1118-1136 and 1140-1150 of FIG. 11 correspond with reference numerals 1020-1025, 1030-1045 and 1050-1065 of FIG. 10, respectively.
  • a host computer disassembles a CAP file into logical data units, and the logical data units are partitioned into one or more APDUs.
  • an authentication finge ⁇ rint is computed over the APDU data stream, as described below with reference to FIGS. 20A and 20B.
  • one or more loading terminal authentication codes are created.
  • one or more target smart card authentication codes are created.
  • the CAP file is augmented with the authentication codes, finge ⁇ rint, or both.
  • the augmented CAP file is communicated to a loading terminal.
  • the loading terminal receives a load request including the augmented CAP file, an applet ID (AID) or the like, initialization instructions and initialization data.
  • AID is defined by International Standards Organization (ISO) Standard ISO-IEC 7816-3.
  • loading of the applet is initiated. The initiating may include separating any authentication codes and finge ⁇ rint from the augmented CAP file and obtaining linking information.
  • a loading order of program elements for optimized verification and linking is determined. The loading order of program elements may be determined as described with respect to reference numeral 1015 of FIG. 10. Alternatively, the order may be determined from an indicator stored in an augmented CAP file.
  • the augmented CAP file is disassembled into one or more logical APDUs.
  • the augmented CAP file is authenticated based on a loading terminal authentication code.
  • a target authentication code is selected from the target smart card authentication codes in the augmented CAP file based upon the target smart card.
  • one or more logical APDUs are communicated to the target smart card.
  • the finge ⁇ rint or authentication code based on a finge ⁇ rint is sent to the smart card.
  • the target smart card authentication code is sent to the smart card.
  • initialization instructions and load data are sent to the target smart card.
  • a proof of loading is received from the target smart card.
  • processes 1122 and 1124 are performed before processes 1126, 1128 and 1130.
  • the order of processes 1126, 1128 and 1130 with respect to one another may be changed.
  • the target smart card receives a load request from the loading terminal and performs load initialization.
  • the load initialization may include receiving the finge ⁇ rint or authentication code based on a finge ⁇ rint that was sent at 1130.
  • logical APDUs received from the loading terminal are processed.
  • the processing includes computing an authentication finge ⁇ rint over the logical APDU payload.
  • the processing may also include receiving the finge ⁇ rint or authentication code based on a finge ⁇ rint that was sent at 1130.
  • the received content is authenticated based on the target smart card authentication code.
  • the authenticating may include receiving the finge ⁇ rint or authentication code based on a finge ⁇ rint that was sent at 1130.
  • the received content is committed to memory on the smart card if the received finge ⁇ rint and the computed finge ⁇ rint matches, and if the received content is properly authenticated.
  • initialization data received from the loading terminal is used to initialize the card.
  • a proof of loading is sent to the loading terminal.
  • the processes illustrated in FIGS. 10 and 11 may be performed without using loading terminal authentication codes and/or target smart card authentication codes.
  • the decision to use or not use authentication codes may be based at least in part on a level of trast in host computer 1100, loading terminal 1105 and/or smart card 1110.
  • the processes illustrated in FIGS. 10 and 11 may be performed without a loading terminal authentication code.
  • a terminal authentication code is not needed since the card issuer can trast terminals which the issuer controls.
  • a terminal authentication code may be needed because the card issuer may have little if any control over the terminal.
  • the processes illustrated in FIGS. 10 and 11 may be performed without a target smart card authentication code.
  • the host computer 1100 and the loading terminal 1105 comprise the same device.
  • FIG. 12 a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a host computer in accordance with one embodiment of the present invention is presented.
  • Figure 12 provides more detail for reference numerals 1015-1025 of FIG. 10 and reference numerals 1106-1116 of FIG. 11.
  • a CAP file is received.
  • the CAP file is disassembled into one or more logical APDUs.
  • an authentication finge ⁇ rint is computed over the APDU data stream.
  • the authentication f ⁇ nge ⁇ rint may be computed upon creation of a logical APDU (i.e.
  • FIG. 13 a block diagram that illustrates partitioning a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention is presented.
  • Figure 13 provides more detail for reference numeral 1205 of FIG. 12.
  • CAP file 1300 is partitioned into one or more APDUs comprising package definition data 1305 for any package in the CAP file.
  • Package definition data may comprise a package identifier.
  • a class within a package is partitioned into one or more APDUs comprising class definition data 1310 for any class in the package.
  • Class definition data may comprise, by way of example, a class identifier, a base class identifier and one or more interface identifiers.
  • the method is partitioned into one or more APDUs comprising method definition data 1315 and one or more APDUs comprising method code data 1320.
  • the field in a class the field is partitioned into one or more APDUs comprising field definition data 1325.
  • the fields are also partitioned into one or more APDUs comprising field initialization data 1330.
  • Method definition data 1315 may comprise, by way of example, a method identifier, a return type identifier, one or more parameter type identifiers and one or more throwable exception type identifiers.
  • Method code data 1320 may comprise, by way of example, executable bytecodes.
  • Field definition data 1325 may comprise, by way of example, a field count, and a field type identifier for each field included in the field count.
  • Field initialization data 1330 may comprise, by way of example, data used to initialize constant data.
  • one or more APDUs comprising verification data may be associated with a program unit such a package, a class or a method, or the like.
  • the verification information is computed off-card by a host computer or a loading terminal, and loaded onto the card for use at load time, and possibly for use during program execution.
  • the one or more verification APDUs may be inserted in the APDU data stream before the corresponding logical program unit APDUs.
  • the one or more verification APDUs may also be inserted in the APDU data stream after the corresponding logical program unit APDUs.
  • the verification data includes information for use in predicting program behavior during execution.
  • Verification data may include, by way of example, primitive data type information such as bounds on values belonging to a particular data type. Verification data may also include program stack state information, such as the data type of entries on the program stack during simulated execution of the associated method code. The program stack state information may also include one or more reference to classes which are composite data types.
  • class verification APDUs supplement verification data in the method verification APDUs for methods in a particular class.
  • Such class verification APDUs may be used, by way of example, when a particular load order results in incomplete verification information availability when performing a per-method verification.
  • package verification APDUs supplement verification data in the class verification APDUs for classes in a particular package.
  • Such package verification APDUs may be used, by way of example, when a particular load order results in incomplete verification information availability when performing a per-class verification.
  • verification information is condensed using one or more type maps.
  • the one or more type maps refer to sets of types that are relevant to a particular program unit.
  • the one or more type maps refer to the data type of entries on an operand stack or in a register file during simulated execution of the corresponding code.
  • the type maps allow optimization of verification by using relatively smaller numbers to refer to predefined sets of types as the types used in the corresponding code. This provides a relatively condensed representation of the types that need to be checked during verification of a program unit. This is explained in more detail below, with reference to FIG. 14.
  • FIG. 14 a flow diagram that illustrates a method for using program unit type map information in accordance with one embodiment of the present invention is presented.
  • a program unit is received.
  • a method, class or package is received.
  • the types used by the program unit are determined.
  • a mapping for the types is created.
  • the program unit mapping information is used in verification information for the program unit.
  • program unit type map information is used to represent all type information in a program unit.
  • program unit type map information is used to represent a subset of type information in a program unit.
  • a type map may be used to represent the most-used types in the program unit.
  • a type map comprises a bitmap, each bit of the type map representing a particular data type.
  • a 16-bit type map may be used to represent 16 types.
  • type map information for a lower-level program unit is cumulative with respect to type map information for a higher-level program unit.
  • a package-level 4-bit type map may be used to represent the 16 most-used types in a package.
  • a class-level 4- bit type map may be used to represent the 16 most-used types in a class, exclusive of the 16 types represented by the package-level type map.
  • a bitmapped package-level 4-bit type map may be used to represent the 4 most-used types in a package.
  • a bitmapped class-level 4-bit type may be used to represent the 4 most-used types in a class, exclusive of the 4 types represented by the package level type map.
  • a trailer APDU indicates the last APDU associated with a program unit.
  • a header APDU precedes one or more APDUs associated with a program unit and defines the expected sequence of logical program unit APDUs to follow.
  • Figures 15A - 17C illustrate determining the order of program elements in a CAP file in accordance with one embodiment of the present invention.
  • Figures 15A - 17C provide more detail for reference numeral 1015 of FIG. 10 and reference numeral 1121 of FIG. 11.
  • Figure 15A illustrates a CAP file before ordering
  • FIG. 15B illustrates a use graph of the program elements in the CAP file of FIG. 15A
  • FIG. 15C illustrates the ordering of program elements in the original CAP file based at least in part on the use graph of FIG. 15B.
  • the original CAP file is ordered based at least in part on the corresponding use graph.
  • the ordered file is communicated to the target device.
  • the original CAP file is modified to include an order indicator that indicates the load order for the CAP file content.
  • the modified CAP file is communicated to the target device.
  • the original CAP file and an order indicator that indicates the load order for the CAP file content are communicated to the target device.
  • FIG. 16 a flow diagram that illustrates a method for ordering program units for optimized verification and linking in accordance with one embodiment of the present invention is presented.
  • a program including multiple program units targeted to a device such as a smart card or the like is received.
  • a use graph of the program is obtained.
  • the program units are ordered to create an ordered program. The ordering is based at least in part on the use graph obtained at 1605.
  • the ordered program is communicated to the device.
  • method A.B.C (1540) is the main method and it calls method A.B.A (1542).
  • Method A.B.A (1542) calls method A.B.B (1544) first and method A.A.B (1546) second.
  • Method A.B.C (1540) also calls method A.A.A (1548), followed by method A.A.C (1550). Following the use graph of FIG.
  • Figures 17A - 17C illustrate determining the order CAP file content based on a use diagram to create a more flattened ordered CAP file.
  • Figures 17A - 17C are similar to FIGS. 15A - 15C except that the ordered CAP file 1502 of FIG. 15C retains the class structure of the original CAP file 1500, whereas the ordered CAP file 1702 of FIG. 17C has been flattened and thus does not retain the original class stracture in the CAP file 1700.
  • Figure 17A illustrates a CAP file comprising package-stractured data.
  • Figure 17B illustrates a use diagram corresponding to the program within the CAP file of FIG. 17A.
  • Figure 17C illustrates the CAP file of FIG. 17A ordered based upon the use diagram of FIG. 17B in accordance with one embodiment of the present invention.
  • the first-used method is method A.B.B 1754.
  • the use of method A.B.B 1754 requires class A.B data 1724 and class A.B fields 1726, so this information is placed before method A.B.B 1728 in the ordered CAP file 1702.
  • the next-used method is method A.A.B 1756.
  • the use of method A.A.B 1756 requires class A. A data 1730 and class A. A fields 1733. Since the required class and field data does not occur earlier in the ordered CAP file, the required class and field data is placed before method A.A.B 1734 in the ordered CAP file 1702.
  • Placement of succeeding methods in the ordered CAP file 1702 proceeds according to the order of use, without regard to which class a method belongs to. In the present example, no further class or field data needs to be loaded because class and field data for the only two classes present in the original CAP file 1700 has already been placed in the ordered CAP file 1702.
  • FIGS. 15A - 17C are for pu ⁇ oses of illustration only. Those of ordinary skill in the art will recognize a use graph may be used to represent the use of other portions of a program. By way of example, a use graph may also represent the use of fields or other program constructs. Additionally, portions of a program from different packages may be ordered in a fashion similar to that shown in FIG. 17C, with package data for a particular package being positioned in the resulting file before any program units of the package. Also, those of ordinary skill in the art will recognize that many combinations of program elements and calling relationships between those program elements are possible.
  • APDUs are arbitrarily ordered, with each APDU including context information.
  • an APDU may include information identifying the APDU contents as the fourth method of the second class.
  • Including context information in an APDU facilitates loading all static data first (all the fields, classes and names) and then loading all the methods, ensuring information used by the methods for use in verification and linking is available first.
  • a host computer inserts an ordering indicator in an augmented CAP file containing program data.
  • a loading terminal uses the ordering indicator to determine the ordering of APDUs created as a result of the CAP file disassembly process.
  • the ordering indicator is based at least in part on a use graph of the program.
  • type map information may be loaded relatively late in the loading process, thus minimizing the amount of memory required.
  • type map information may be loaded relatively early in the loading process, thus increasing the probability that the type information will be resident on the card when the types are referenced.
  • one or more field definition APDUs 1325 and field initialization APDUs 1330 corresponding to a particular class are processed before any corresponding method definition APDU 1315 or method code APDU 1320 of the class.
  • Figures 18 and 19 are flow diagrams that illustrate disassembling a CAP file into logical APDUs from the perspective of a host computer in accordance with embodiments of the present invention.
  • Figure 18 illustrates disassembling a CAP file that does not include verification data
  • FIG. 19 illustrates disassembling a CAP file that includes verification data.
  • FIG. 18 a flow diagram that illustrates a method for disassembling a CAP file into logical APDUs in accordance with one embodiment of the present invention is presented.
  • the process illustrated within box 1800 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 1810 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 1825 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • one or more data initialization APDUs are created.
  • verification data may be created for program units.
  • the verification data may be created for program units such as packages, classes, methods, or the like, or any combination thereof.
  • the verification data for a program unit may be inserted in an APDU stream before the corresponding program unit code APDU or program unit definition APDU. In one embodiment, the verification data is inserted immediately before the corresponding program unit code APDU or program unit definition APDU.
  • the verification data for a program unit may be inserted in an APDU stream after the corresponding program unit code APDU or program unit definition APDU. In one embodiment, the verification data is inserted immediately after the corresponding program unit code APDU or program unit definition APDU. This is explained in more detail below with reference to FIG. 19.
  • FIG. 19 a flow diagram that illustrates a method for disassembling a CAP file into logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented.
  • Figure 19 is similar to FIG. 18, except that verification data is included in FIG. 19 at reference numerals 1940, 1945 and 1955.
  • the process illustrated within box 1900 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 1910 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 1925 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • one or more method verification APDUs comprising method verification data are created for a method.
  • one or more class verification APDUs comprising class verification data are created for a class.
  • one or more data initialization APDUs are created.
  • one or more package verification APDUs comprising package verification data are created for a package.
  • one or more verification APDUs are inserted into the APDU stream before and/or after the corresponding one or more code or definition APDUs.
  • one or more package verification APDUs may be inserted into the APDU stream (1955) after inserting the corresponding one or more package definition APDUs (1905).
  • one or more package verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more package definition APDUs.
  • one or more class verification APDUs may be inserted into the APDU stream (1945) after inserting the corresponding one or more class definition APDUs (1915).
  • one or more class verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more class definition APDUs.
  • one or more method verification APDUs may be inserted into the APDU stream (1940) after inserting the corresponding one or more method definition APDUs (1930).
  • one or more method verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more method definition APDUs.
  • a verification APDU that precedes or succeeds the corresponding one or more code or definition APDUs may comprise, by way of example, one or more type maps.
  • Figures 20A and 20B are flow diagrams that illustrate methods for computing an authentication finge ⁇ rint over an APDU data stream in accordance with embodiments of the present invention.
  • Figures 20A and 20B provide more detail for reference numeral 1108 of FIG. 11.
  • Figure 20A illustrates computing an authentication finge ⁇ rint when verification APDUs are used to determine the authentication finge ⁇ rint.
  • Figure 20B illustrates computing an authentication finge ⁇ rint when verification APDUs are not used to determine the authentication finge ⁇ rint.
  • the process illustrated by FIGS. 20A and 20B are the same processes used by a loading terminal (reference numerals 1128 and 130 of FIG. 11) and by a target smart card (reference numeral 1142 of FIG.
  • FIG. 20A a flow diagram that illustrates a method for computing an authentication finge ⁇ rint over an APDU data stream in accordance with one embodiment of the present invention is presented.
  • an authentication finge ⁇ rint is initialized.
  • a logical APDU is received.
  • the finge ⁇ rint is computed over the logical APDU payload.
  • the finge ⁇ rint computation uses the result of the previously computed finge ⁇ rint.
  • a determination is made regarding whether another logical APDU remains to be processed. Processing of additional APDUs continues at 2005.
  • an authentication finge ⁇ rint is initialized.
  • a logical APDU is received.
  • FIG. 21 a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a loading terminal in accordance with one embodiment of the present invention is presented.
  • Figure 21 provides additional detail for reference numerals 1030- 1045 of FIG. 10 and reference numerals 1118-1136 of FIG. 11.
  • an augmented CAP file is received.
  • any authentication codes and finge ⁇ rints are separated from the augmented CAP file.
  • linking information is obtained.
  • the linking information comprises information needed to link methods, such as the card's present callable routines and how to reference them.
  • the linking information may be obtained from an external source.
  • a loading terminal may communicate via the Web with a central repository having knowledge of a particular target smart card's linking information.
  • a loading terminal may obtain the information from the target smart card itself.
  • the augmented CAP file is disassembled into one or more logical APDUs.
  • the one or more logical APDUs are communicated to a smart card and an authentication finge ⁇ rint is computed over the APDU payload.
  • the process in 2115 and 2120 is similar to processes 1205 and 1210 of FIG. 12 performed by the host computer as described above, as well as the processes 2905 of FIG. 29 and 3005 of FIG. 30 performed by the target smart card as described below.
  • the similarity of the processes guarantees that if the APDU payload remains the same, the same authentication finge ⁇ rint will be generated regardless of the entity performing the computation. Conversely, if the APDU payload changes between when each entity performs the computation, a different finge ⁇ rint will be generated, signaling a change in the payload.
  • process 2125 applies when a CAP file optionally includes an authentication finge ⁇ rint. If the CAP file includes an authentication finge ⁇ rint, a determination is made regarding whether the finge ⁇ rint extracted from the augmented CAP file in 2105 matches the finge ⁇ rint computed at 2120. If the fmge ⁇ rints match, at 2130 a target smart card authentication code appropriate for the particular target smart card is extracted from the CAP file. At 2135, the finge ⁇ rint, authentication code, or both, are sent to the target smart card. At 2140, initialization instractions are performed and the resultant data is loaded. At 2145, a proof of loading is received from the smart card. According to one embodiment of the present invention, the proof of loading comprises the storage commitment finge ⁇ rint.
  • the loading terminal disassembles an augmented CAP file into logical APDUs (2115) and then computes an authentication finge ⁇ rint over the logical APDU payload upon transmitting the logical APDUs to the target smart card (2120).
  • the computation of the authentication finge ⁇ rint may be interleaved with the disassembly process (2115).
  • both the transmission of APDUs to the target smart card and the computation of the authentication finge ⁇ rint may be interleaved with the disassembly process (2115).
  • the augmented CAP file received by a loading terminal may include verification data.
  • the loading terminal may also receive a CAP file without verification data, compute verification data, create one or more APDUs containing the data and send the one or more APDUs to the target smart card.
  • the determination regarding whether to include verification data in the authentication finge ⁇ rint computation is based on whether the CAP file received by the loading terminal includes verification data, and on whether the target smart card requires verification data. If the received CAP file includes verification data, the authentication finge ⁇ rint is additionally computed over the verification data. If the received CAP file does not include verification data, the authentication finge ⁇ rint is not computed over verification data, regardless of whether the loading terminal produces verification data that is sent to the target smart card.
  • the loading terminal may also receive a CAP file, compute link data, create one or more APDUs containing the data and send the one or more APDUs to the target smart card.
  • Figures 22-27 illustrate methods for disassembling an augmented CAP file into one or more logical APDUs from the perspective of a loading terminal in accordance with embodiments of the present invention. Figures 22-27 provide more detail for reference numeral 2115 of FIG. 21. As mentioned previously, the program elements of the CAP file to be disassembled may be ordered for optimized verification and linking (reference numeral 1121 of FIG. 11) prior to the disassembling processes illustrated in FIGS. 22-27. Figure 22 illustrates disassembling an augmented CAP file into one or more logical APDUs.
  • Figure 23 illustrates disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data.
  • Figure 24 illustrates disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data.
  • Figure 25 illustrates disassembling an augmented CAP file into one or more logical APDUs including APDUs comprising link data.
  • Figure 26 illustrates disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data.
  • Figure 27 illustrates disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data.
  • FIG. 22 a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs in accordance with one embodiment of the present invention is presented.
  • Figure 22 is similar to the process performed by the host computer as illustrated in FIG. 18.
  • the process illustrated within box 2200 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2210 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2225 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • one or more data initialization APDUs are created.
  • FIG. 23 a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented.
  • Figure 23 is similar to the process performed by the host computer as illustrated in FIG. 19.
  • the process illustrated within box 2300 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2310 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2325 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • one or more method verification APDUs comprising method verification data are created for a method.
  • one or more class verification APDUs comprising class verification data are created for a class.
  • one or more data initialization APDUs are created.
  • one or more package verification APDUs comprising package verification data are created for a package.
  • FIG. 24 a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented.
  • Figure 24 is similar to FIG. 23, except that in FIG. 24, verification data is computed (2440, 2445, 2455), whereas in FIG. 23, verification data used to create one or more verification APDUs (2340, 2345, 2355) is extracted from the augmented CAP file.
  • the process illustrated within box 2400 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2410 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2425 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • method verification data is computed and one or more method verification APDUs comprising method verification data are created for a method.
  • class verification data is computed and one or more class verification APDUs comprising class verification data are created for a class.
  • one or more data initialization APDUs are created.
  • FIG. 25 a flow diagram that illustrates a method for disassembling an augmented CAP file into logical one or more APDUs including APDUs comprising link data in accordance with one embodiment of the present invention is presented.
  • FIG. 25 is similar to FIG. 22, except that per-method link APDUs are created (2540) in FIG. 25.
  • the process illustrated within box 2500 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2510 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2525 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • per-method link APDUs are created.
  • one or more data initialization APDUs are created.
  • FIG. 26 a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention is presented.
  • Figure 26 represents the combination of FIGS. 23 and 25.
  • the process illustrated within box 2600 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2610 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2625 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • one or more method verification APDUs comprising method verification data are created for a method.
  • per-method link APDUs are created.
  • one or more class verification APDUs comprising class verification data are created for a class.
  • one or more data initialization APDUs are created.
  • one or more package verification APDUs comprising package verification data are created for a package.
  • FIG. 27 a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention is presented.
  • Figure 27 represents the combination of FIGS. 24 and 25.
  • the process illustrated within box 2700 is performed per package.
  • one or more package definition APDUs comprising package definition data are created for a package.
  • the process illustrated within box 2710 is performed per class.
  • one or more class definition APDUs comprising class definition data are created for a class.
  • one or more field definition APDUs comprising field definition data are created for the class.
  • the process illustrated within box 2725 is performed per method.
  • one or more method definition APDUs comprising method definition data are created for a method.
  • one or more code APDUs comprising the method code are created for the method.
  • method verification data is computed and one or more method verification APDUs comprising method verification data are created for a method.
  • per-method link APDUs are created.
  • class verification data is computed and one or more class verification APDUs comprising class verification data are created for a class.
  • one or more data initialization APDUs are created.
  • package verification data is computed and one or more package verification APDUs comprising package verification data are created for a package.
  • FIG. 28 a flow diagram that illustrates a method for creating one or more method link APDUs in accordance with one embodiment of the present invention is presented.
  • Figure 28 provides more detail for reference numeral 2540 of FIG. 25, reference numeral 2645 of FIG. 26 and reference numeral 2745 of FIG. 27.
  • verifiable linking instractions are computed based on logical memory layout and information from the card.
  • the loading terminal may have previously obtained this information as described above with respect to reference numeral 2110 of FIG. 21.
  • a link APDU that includes the verifiable linking instractions is created.
  • FIG. 29 a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card in accordance with one embodiment of the present invention is presented.
  • Figure 29 provides additional detail for reference numerals 1050-1065 of FIG. 10 and reference numerals 1140-1150 of FIG. 11.
  • load initialization is performed.
  • one or more logical APDUs are processed to prepare the data in their data fields for loading.
  • the processing comprises computing an authentication fmge ⁇ rint.
  • an authentication finge ⁇ rint APDU is received.
  • the authentication finge ⁇ rint may be received as part of load initialization (2600), or as part of processing APDUs (2605).
  • the program data may be committed to the smart card memory by associating the program data with a storage commitment finge ⁇ rint computed over the finally stored program data.
  • the loading proof comprises the storage commitment finge ⁇ rint.
  • the loading proof comprises an authentication code based at least in part on the storage commitment finge ⁇ rint.
  • FIG. 30 a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card using an authentication finge ⁇ rint that is a HMAC in accordance with one embodiment of the present invention is presented.
  • Figure 30 is similar to FIG. 29, except that determinations 2930 and 2915 in FIG. 29 are equivalent to determination 3015 in FIG. 30. Since a HMAC is both a finge ⁇ rint and a message authentication code, the program data may be committed to the smart card memory when the received authentication finge ⁇ rint matches the computed authentication fmge ⁇ rint.
  • load initialization is performed.
  • one or more logical APDUs are processed to prepare the data in their data fields for loading.
  • the processing comprises computing an authentication finge ⁇ rint.
  • an authentication finge ⁇ rint APDU is received.
  • the authentication finge ⁇ rint may be received as part of load initialization (2600), or as part of processing APDUs (2605).
  • FIG. 31 a flow diagram that illustrates a method for performing load initialization in accordance with one embodiment of the present invention is presented.
  • Figure 31 provides more detail for reference numeral 2900 of FIG. 29 and reference numeral 3000 of FIG. 30.
  • a request for loading is received.
  • the request is authenticated to determine whether the loading process should proceed.
  • a determination is made regarding whether the authentication in 3105 was successful. If the authentication was not successful, the process ends with failure at 3130. If the authentication was successful, at 3115 load parameters are checked to determine whether the load is capable of succeeding, based on known characteristics of the card and the program data to be loaded.
  • an indication that the load will fail is made.
  • the program data to be loaded requires classes that are not presently on the card and are not part of the program data to be loaded.
  • an indication that the load will fail is made.
  • process 3105 and 3115 may be switched so that process 3115 is performed before process 3105.
  • load initialization ends with failure 3130 if either of processes 3105 and 3115 fails .
  • FIG. 32 a flow diagram that illustrates a method for processing an APDU stream in accordance with one embodiment of the present invention is presented.
  • Figure 32 provides more detail for reference numeral 2905 of FIG. 29 and reference numeral 3005 of FIG. 30.
  • a logical APDU is received.
  • the logical APDU is pre-processed.
  • the pre-processing may include, by way of example, finalizing processing of the previous program unit if the current APDU is the first APDU of another program unit.
  • the pre-processing may also include, by way of example, decryption.
  • the result of the pre-processing is an indication of whether the logical APDU is valid.
  • a storage commitment ftnge ⁇ rint is computed over the stored result using the result of the previously computed storage commitment finge ⁇ rint.
  • FIG. 33 a flow diagram that illustrates a method for computing an authentication finge ⁇ rint in accordance with one embodiment of the present invention is presented.
  • Figure 33 provides more detail for reference numeral 3220 of FIG. 32.
  • a determination is made regarding whether the APDU is a link APDU. If the APDU is not a link APDU, at 3305 a determination is made regarding whether the APDU is a verification APDU. If the APDU is a verification APDU, at 3310 a determination is made regarding whether verification APDUs are part of the authentication finge ⁇ rint.
  • the authentication finge ⁇ rint is computed over the logical APDU payload using the result of the previously computed authentication finge ⁇ rint.
  • the receipt of logical APDUs (3200) is interleaved with the computation of an authentication fmge ⁇ rint (3220) and computation of a storage commitment finge ⁇ rint (3240).
  • the smart card may receive one or more logical APDUs and then compute an authentication finge ⁇ rint and storage commitment finge ⁇ rint over the one or more received APDUs.
  • FIG. 34 a flow diagram that illustrates a method for processing a logical APDU in accordance with one embodiment of the present invention is presented.
  • Figure 34 provides more detail for reference numeral 3225 of FIG. 32.
  • verification information is accepted.
  • the verification information is used to verify a logical APDU.
  • a determination is made regarding whether the logical APDU was successfully verified. If the logical APDU was successfully verified, linking information is accepted at 3415 and at 3420, the linking information is used to link.
  • the data stractures as described with respect to FIG. 7 illustrate linking to static methods, or methods having a single call address.
  • Object-oriented languages such as the JavaTM language support virtual methods, or methods that may have multiple copies.
  • a virtual method may be declared in a class and a subclass of the class may override or replace the virtual method with its own instance of the virtual method.
  • An instance of the subclass will reference the version of the method overridden in the subclass, while an instance of the class will reference the virtual method declared in the class.
  • the capability to link virtual methods is provided by creating a jump table for each virtual method that is overridden at least once.
  • the jump table includes the address of each instance of a virtual method.
  • Object constructors are rewritten to accept a "type" parameter, constructor calls are rewritten to provide type information, and virtual method program calls are rewritten to include an indication of the current type of the called object.
  • the indication of the current type is used as an index into the corresponding virtual method jump table, where the address of the appropriate virtual method code is obtained. This is explained in more detail below with reference to FIGS. 35-37.
  • FIG. 35 data stractures for linking a program including virtual methods in accordance with one embodiment of the present invention is presented.
  • subclass N 3505
  • subclass O 3510
  • Subclass O 3510
  • Class M 3500
  • overrides method A 3525
  • Jump table 3320 is indexed by a value of a type identifier in the class instance data.
  • Each entry of jump table 3520 includes the address of the virtual method instance corresponding to the index, for each virtual method in a class having at least one instance.
  • Every call to method M.A (3525) that has been overridden includes a type identifier.
  • the type identifier is used as an index in the jump table 3320 to obtain the address of the code corresponding to the virtual method instance.
  • the calls in subclass N (3505) and subclass O (3510) are rewritten to call with the type identifier.
  • the calls may be rewritten by a host computer or a loading terminal before loading the program on a smart card, such as when an augmented CAP file is produced. Alternatively, the calls may be rewritten by a loading terminal.
  • the target smart card may also rewrite the calls after the program data has been loaded.
  • the type identifier is obtained from a "current type of the object" field 3345 in the called object 3515.
  • Searching for the appropriate virtual method instance is thus made more deterministic by giving each subtype and each method a type identifier.
  • class "M" (3500) or class "N" (3505) objects are instantiated, both objects are instantiated with the type identifier having a value of zero.
  • the type identifier associated with the instance is the value one.
  • object "O" (3510) calls the virtual method, the type identifier is used as an index into the jump table 3520 to determine which virtual method instance to call, thus obviating the need to perform an exhaustive search for the appropriate virtual method instance.
  • FIG. 36 a block diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention is presented.
  • Figure 36 is similar to FIG. 7, except that FIG. 36 includes a jump table (3676, 3680, 3682) for each virtual method having at least one virtual method instance.
  • code for methods A1A (3602), A2A (3612) and B2A (3628) include calls to virtual methods A1C (3608), B1A (3620) and BID (3626), respectively.
  • code for methods A1A (3652), A2A (3660) and B2A (3674) has been modified to refer to the jump table associated with the called virtual method (3676, 3680, 3682) and a type indicator of the called object.
  • FIG. 37 a flow diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention is presented.
  • a program is received.
  • classes in the program are enumerated.
  • Box 3710 is performed per class.
  • object constructor calls are rewritten to provide type information.
  • object constructors are rewritten to accept a "type" parameter.
  • Box 3715 is performed per virtual method in a class.
  • a determination is made regarding whether the virtual method has been overridden with an instance of the virtual method. If the virtual method has been overridden, at 3725 a virtual method jump table for the virtual method having at least one virtual method instance is created.
  • program calls to the virtual method are rewritten to refer to the jump table associated with the called virtual method and a type indicator of the called object. If the virtual method has not been overridden, the virtual method may be linked in the same manner as a static method.
  • a call to a virtual method that has been overridden at least once is replaced with a call instruction that uses the type indicator of the called object as an index into a table positioned in the instruction stream inline with the call instraction.
  • a program unit storage commitment finge ⁇ rint is associated with a program unit.
  • the program unit storage commitment finge ⁇ rint may be used to indicate commitment of the program unit.
  • the program unit storage commitment finge ⁇ rint may be used to indicate the program unit has been finally loaded onto the target smart card.
  • the program unit storage commitment finge ⁇ rint may also be used to indicate whether the program unit data has been tampered with or is otherwise unfit for execution.
  • the program unit storage commitment finge ⁇ rint is computed over the program unit data and associated with the program unit at the time the program unit is finally stored in a persistent mutable memory and ready for use.
  • the program unit storage commitment finge ⁇ rint may be stored in an area of memory contiguous with the associated program data.
  • a reference to the program unit commitment finge ⁇ rint may be stored with the associated program data.
  • program units may be stored in a tabular form, with each entry including a storage unit and the corresponding finge ⁇ rint.
  • the program unit storage commitment finge ⁇ rint initially associated with the program unit is matched against the result of computing a storage commitment finge ⁇ rint over the program unit data.
  • a mismatch indicates the program unit data has been tampered with or is otherwise unfit for execution.
  • a program unit may comprise any logical program stracture. Using JavaTM technology as an example, a program unit may comprise a package, a class, a method or any combination thereof. Additionally, a program unit may be stored in noncontiguous memory.
  • "use” of a program unit comprises executing the program unit.
  • "use" of a program unit comprises creating an instantiation of another program unit based at least in part on the program unit. Using JavaTM technology as an example, "use" of a program unit may comprise object instantiation.
  • "use" of a program unit comprises reading the program unit data.
  • a storage commitment finge ⁇ rint of a higher level program unit may be based at least in part on at least one storage commitment finge ⁇ rint of a lower level program unit. This is illustrated below with respect to FIG. 38.
  • FIG. 38 a block diagram that illustrates a hierarchy of program unit storage commitment finge ⁇ rints in accordance with one embodiment of the present invention is presented.
  • Reference numerals 3800-3808 represent classes
  • reference numerals 3810-3812 represent packages
  • reference numeral 3814 represents a load comprising one or more packages.
  • Class storage cornmitment finge ⁇ rints 3818-3826 are formed by computing a finge ⁇ rint over class-level data in classes 3800-3808, respectively, and the collection of method storage commitment f ⁇ nge ⁇ rints in classes 3800-3808, respectively.
  • Package storage commitment finge ⁇ rints 3828-3830 are formed by computing a finge ⁇ rint over package-level data in packages 3810-3812, respectively, and the collection of class storage commitment finge ⁇ rints in packages 3810-3812, respectively.
  • Load storage commitment finge ⁇ rint 3816 is formed by computing a finge ⁇ rint over the collection of package storage commitment finge ⁇ rints in load 3814.
  • one or more storage commitment finge ⁇ rints of a higher level program unit may be based on the data of a lower level program unit.
  • a class storage commitment finge ⁇ rint may be based over class-level data and method-level data for methods belonging to the class.
  • Card memory 3900 comprises a storage area for a load unit 3902 that comprises package "A" 3904 and package "B” 3906.
  • Packages 3904 and 3906 comprise classes 3908-3910 and 3912- 3914, respectively.
  • Classes 3908, 3910, 3912 and 3914 comprise methods 3916-3922, 3924-3926, 3928-3934 and 3936-3938, respectively.
  • Method storage commitment finge ⁇ rints 3940-3964 are computed over method code 3916-3938, respectively.
  • Class storage commitment finge ⁇ rints 3966, 3968, 3970 and 3972 are computed over method storage commitment finge ⁇ rints 3940-3946, 3948-3950, 3954-3960 and 3962-3964, respectively. Class storage commitment finge ⁇ rints 3966, 3968, 3970 and 3972 may also be computed over any field definitions and initialized static data that is part of the respective class.
  • Package storage commitment finge ⁇ rints 3974 and 3976 are computed over class storage cornmitment finge ⁇ rints 3966-3968 and 3970-3972, respectively.
  • Load unit storage commitment finge ⁇ rint 3978 is computed over package storage commitment finge ⁇ rints 3974 and 3976.
  • FIG. 40 a block diagram that illustrates a data stracture including program code and a load storage commitment finge ⁇ rint in accordance with one embodiment of the present invention is presented.
  • Figure 40 is similar to FIG. 39, except FIG. 40 does not include class storage commitment finge ⁇ rints or package storage commitment finge ⁇ rints.
  • Load unit storage commitment finge ⁇ rint 4042 is computed over stored method code 4016-3840 in packages "A" 4004 and package "B" 4006.
  • a program unit commitment finge ⁇ rint is used to check the integrity of a program unit at runtime.
  • Figures 41 and 42 illustrate the general case for this rantime integrity checking.
  • Figures 43 and 44 illustrate embodiments of the present invention that use a dispatching mechanism to implement runtime integrity checking.
  • Figure 41 is a flow diagram that illustrates a method for using a program unit commitment finge ⁇ rint to determine whether a program unit may be used, in accordance with one embodiment of the present invention.
  • a request for use of a program unit is received.
  • the "use” comprises creating an instantiation based at least in part on the program unit.
  • the "use” comprises executing the program unit code.
  • the "use” comprises reading the program unit data.
  • a program unit may be a program, a package, a class, a method an instance variable or a class variable.
  • a program unit may be partitioned in many ways.
  • the validity of a stored program unit is determined upon receiving a request for use of the program unit, without regard to whether a previous use request for the same program unit was received in the current session.
  • a finge ⁇ rint device is configured to compute authentication finge ⁇ rints, program storage commitment finge ⁇ rints, or both.
  • a finge ⁇ rint device comprises a computation unit that computes the storage commitment finge ⁇ rint.
  • the computation unit is linked to memory dedicated to storing committed data.
  • the computation unit may be integrated with a memory device comprising the memory.
  • the computation unit may be a standalone device in communication with a memory device comprising the memory.
  • the computation unit is configured to automatically and incrementally compute the finge ⁇ rint for the memory upon detecting a write operation to the memory.
  • the computation unit is configured to automatically and incrementally compute the finge ⁇ rint for the memory before use of data in the memory, such as upon detecting a read operation for the memory.
  • the computation unit computes a finge ⁇ rint over the data stored at the memory addresses specified by the memory range.
  • FIG. 42 a flow diagram that illustrates a method for determining whether stored program unit data is valid in accordance with one embodiment of the present invention is presented.
  • Figure 42 provides more detail for reference numeral 4110 of FIG. 41.
  • a finge ⁇ rint is computed over the program unit data.
  • a determination is made regarding whether the computed finge ⁇ rint matches a stored finge ⁇ rint. If the computed finge ⁇ rint does not match the stored fmge ⁇ rint, at 4210 an indication that the stored program unit data is invalid is made. If the computed finge ⁇ rint matches the stored finge ⁇ rint, at 4215 an indication that the stored program unit data is valid is made.
  • gateway dispatcher is defined as a program unit configured to determine whether the executable code of a called method is valid before calling the method.
  • a gateway dispatcher may be part of a virtual machine or a lower level routine.
  • a dispatch table associated with a protection unit includes an entry for methods protected by the protection unit.
  • a caller of a method in a protection unit calls the method by referring to the protection unit and an index in the table. The reference determines whether the executable code of a called method is valid (has been verified) before calling the method.
  • a gateway dispatcher verifies the protection unit if the protection unit dispatch table has been loaded but the protection unit has not been verified. The gateway dispatcher loads the dispatch table and verifies the protection unit if the protection unit dispatch table has not been loaded. This is explained in more detail below with reference to FIGS. 43 and 44.
  • FIG. 43 a block diagram that illustrates a smart card configured to ensure a called method has been verified prior to execution in accordance with one embodiment of the present invention is presented.
  • Figure 43 illustrates a data stracture for implementing the "use program unit" process discussed previously with respect to reference numeral 4125 of FIG. 41.
  • entry points to a class or package are precomputed at load time. The entry points trigger a test to determine whether the method being called has been verified. Calls are linked to those entry points by rewriting code containing calls to the methods.
  • each entry includes a check bit and a routine address.
  • methods or routines within a protection unit can call each other. Methods that call outside a protection unit do so via a dispatch table (4300, 4305, 4310). If the check bit of the dispatch table entry corresponding to the called routine indicates a checked status, the routine address of the dispatch table entry is used to call the routine. If check bit indicates an unchecked status, verification of the code is performed.
  • each entry includes a check bit because the corresponding routine may be the first routine within a protection unit to be called.
  • the check bit comprises the most significant bit and the method address comprises the least significant bits of a dispatch table entry. If the gateway dispatcher reads check bit value that indicates an unchecked status, the least-significant bits of the dispatch table entry are used to call the routine. This mechanism obviates the need for a second memory access to obtain the method address.
  • each table has a per- table check bit that indicates whether the table has been validly initialized.
  • Each table entry comprises a method address.
  • protection units are per package. According to another embodiment of the present invention, protection units are per class. According to another embodiment of the present invention, protection units are per method.
  • the program units protected by a protection unit corresponds with the program units included in a storage commitment finge ⁇ rint.
  • a storage commitment finge ⁇ rint if storage commitment finge ⁇ rints are computed over methods in a class, protection units are per class.
  • protection units are per package.
  • program code is rewritten to replace calls to routines outside a protection unit with calls to a gateway dispatcher.
  • the code is rewritten at conversion time, when a CAP file is created.
  • the code is rewritten at CAP file disassembly time.
  • the code is rewritten at load time, or at link time in the target smart card.
  • the gateway dispatcher inspects the table that belongs to the called method to determine whether it may jump directly to the routine, or whether the called routine must be verified first.
  • a check bit value of zero is used to indicate an unchecked status.
  • a value of zero may indicate the entry is corrupted. It may also indicate the entry is valid but that the code has not been verified.
  • the dispatch table template is obtained from a persistent mutable memory such as EEPROM, and the called routine is verified. This is shown in more detail below with reference to FIG. 44.
  • FIG. 44 a flow diagram that illustrates a method for ensuring a called method has been verified prior to execution in accordance with one embodiment of the present invention is presented.
  • Figure 44 presumes that program code has been rewritten such that calls between protection units have been replaced with calls to a gateway dispatcher.
  • Figure 44 also presumes that a dispatch table template that points to the actual method for each of the entries is placed in EEPROM during the linking process.
  • Figure 44 also presumes that upon reset or upon the first use of any entry in a dispatch table, the dispatch table template is copied to a preallocated space in an impersistent mutable memory such as RAM.
  • a protection unit is collective if the unit of use is not the same as the unit of protection.
  • the protection unit is not collective. But if the unit of use is a method and the unit of protection is a class, the protection unit is collective.
  • the dispatch table corresponding to the protection unit is obtained from a persistent mutable memory such as EEPROM and loaded into an impersistent mutable memory such as RAM.
  • the dispatch table entry corresponding to the called method is examined.
  • check bit value indicates an unchecked status
  • verification of the protection unit comprising the method is performed at 4455 and the check bit of methods in the protection unit are made to indicate a checked status at 4460.
  • the called method is called using the address in the table entry.
  • Any program file comprising program data may be used in place of a CAP file comprising structured program data.
  • an archive file such as a JavaTM archive (JAR) file may be used.
  • any communication protocol that defines a protocol data unit may be used in place of the APDU protocol.
  • program data for programs written in languages other than the JavaTM language may be used.
  • the target device need not be a smart card.
  • the target device may be any device capable of receiving protocol data units and executing a program based at least in part on the received data.

Abstract

A system for communicating program data between devices includes a first device configured to disassemble a program file comprising program data into at least one logical data unit, partition each logical data unit into at least one protocol data unit and compute a first fingerprint over the payload portion of the protocol data units. The first device is also configured to send the protocol data units and at least one member of the group comprising the first fingerprint and a first authentication code based on the first fingerprint to a second device. The second device is configured to compute a second fingerprint over the payload portion of the protocol data units and to commit the program to a memory based on whether the at least one member matches the second fingerprint or a second authentication code based on the second fingerprint.

Description

S P E C I F I C A T I O N
TITLE OF INVENTION
SYSTEM FOR COMMUNICATING PROGRAM DATA BETWEEN A FIRST
DEVICE AND A SECOND DEVICE
Cross Reference to Related Applications
[0001] This application is related to the following:
U.S. Patent Application Serial No. 10/346,230, filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Signing Program Data Payload Sequence in Program Loading", commonly assigned herewith.
U.S. Patent Application Serial No. 10/346,238 filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Using a Digital Fingeφrint to Commit Loaded Data in a Device", commonly assigned herewith.
U.S. Patent Application Serial No. 10/346,586, filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Ordering Program Data for Loading on a Device", commonly assigned herewith
U.S. Patent Application Serial No. 10/346,227 filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Optimized Representation of Data Type Information in Program Verification", commonly assigned herewith.
U.S. Patent Application Serial No. 10/346,243 filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Run Time Code Integrity Checks", commonly assigned herewith.
U.S. Patent Application Serial No. 10/346,579, filed January 16, 2003 in the name of inventor Eduard de Jong, entitled "Linking of Virtual Methods", commonly assigned herewith.
FIELD OF THE INVENTION
[0002] The present invention relates to the field of computer science. More particularly, the present invention relates to communicating program data between a first device and a second device. BACKGROUND OF THE INVENTION
[0003] Figure 1 is a block diagram that illustrates a typical mechanism for communicating program data between a host computer and a smart card. Smart cards 110 typically communicate with other computers 100 via APDUs (Application Protocol Data Units). The APDU protocol is specified in International Standard ISO/IEC 7816-3. An APDU includes either a command 115 or a response 120 message. A smart card 110 receives a command APDU 115 from a host computer 100, executes the instruction specified in the command 115 and replies to the host computer 100 with a response APDU 120. Command APDUs 115 and response APDUs 120 are exchanged alternately between a card 110 and a host computer 100.
[0004] According to the APDU protocol, APDU messages comprise two structures. One structure is used by a host application on a loading terminal to send commands to the card. The other stracture is used by the card to send responses back to the host application. The former is referred to as the command APDU (C-APDU) and the latter is referred to as the response APDU (R-APDU). Their structures are illustrated in FIGS. 2A and 2B, respectively. Some C-APDU components are optional.
[0005] Java Card™ technology enables programs written in the Java™ programming language to run on smart cards and other resource-constrained devices. Java Card™ technology is described in Z. Chen, Java Card™ Technology for Smart Cards (2000).
[0006] Turning now to FIG. 3, a block diagram that illustrates loading a converted applet (CAP) file is presented. The Java Card™ Virtual Machine (JCVM) comprises an on-card portion that includes the Java Card™ bytecode inteφreter 345 and an off-card portion called a converter 310. Taken together, the inteφreter 345 and the converter 310 implement all the virtual machine functions, including loading Java™ class files 300 and executing them with a particular set of semantics. The converter 310 loads and pre- processes the class files 300 that comprise a Java Card™ program that may be structured in one or more packages and produces a CAP (converted applet) file 350. The CAP file 350 is then loaded on a Java Card™ technology-enabled smart card 330 and executed by the inteφreter 345. The CAP file 350 includes an executable binary representation of the classes in a Java™ package 350. The Java Card™ inteφreter 345 provides runtime support of the Java™ language execution model.
[0007] In Java Card™ technology, the mechanisms to download and install a CAP file 350 are embodied in a unit called the installer 340. The Java Card™ installer 340 resides within the card 330. It cooperates with an off-card installation program 320. The off- card installation program 320 transmits the executable binaiy and possibly other data in a CAP file 350 to the installer 340 running on the card 330 via a loading terminal 325. The installer 340 writes the binary into the smart card memory, links it with the other classes that have already been placed on the card 330 and creates and initializes any data stractures that are used internally by the Java Card™ runtime environment. An optional on-card verifier 335 performs bytecode verification of downloaded code before the downloaded code is inteφreted by bytecode inteφreter 345.
[0008] The APDU protocol limits the size of the payload or data field (reference numeral 240 of FIG. 2) to a small number of bytes (typically less than 128) determined by the restricted size of RAM. Data structures larger than the limitation must be split among the payload portion of multiple APDUs. This splitting is typically performed without regard to the data content. For example, a particular APDU may contain a portion of one data stracture and a portion of another data stracture. This is explained in more detail below, with reference to FIG. 4.
[0009] Turning now to FIG. 4, a flow diagram that illustrates loading a CAP file from the perspective of a loading terminal is presented. At 400, a CAP file is received. At 405, the CAP file and associated authentication data is split amongst multiple APDUs. At 410, the APDUs are fransmitted to the target smart card according to the APDU protocol.
[0010] Turning now to FIG. 5, a flow diagram that illustrates loading a CAP file from the perspective of a smart card is presented. At 500, the CAP file is reassembled in the smart card. At 505, the reassembled CAP file is decrypted. At 510, the decrypted CAP file data is authenticated. In another solution, the CAP file is authenticated and then decrypted. In yet another solution, the CAP file is communicated without encryption. At 515, the content of the authenticated CAP file is installed on the smart card. [0011] Turning now to FIG. 6, a flow diagram that illustrates reassembling a CAP file in a smart card is presented. At 600, an APDU is received. At 605, the APDU is stored in a persistent mutable memory such as an EEPROM (electrically erasable programmable read-only memory). Alternatively, the APDU payload is not stored in a persistent mutable memory. At 610, receipt of the APDU is acknowledged. At 615, a determination is made regarding whether another APDU needs to be processed. Additional APDUs are processed beginning at 600.
[0012] Turning now to FIG. 7, a block diagram that illustrates modifying a stored program having link data to resolve static references is presented. Card memory 700 represents card memory before using embedded link data (704, 712, 728) to link executable code segments (702, 706, 708, 710, 712, 716, 718, 720, 722, 724, 726, 728, 732). Card memory 750 represents card memory after the embedded link data (704, 712, 728) has been used to link executable code segments (702, 706, 708, 710, 712, 716, 718, 720, 722, 724, 726, 728, 732). Referring to card memory 700, method "Al A" code 702 calls method "A1C" 708, method "A2A" code 712 calls method "B1A" 720 and method "B2A" code 728 calls method "BID" 726. Method "A1A" link data 704 comprises an indication of how to resolve the reference to method "A1C" 708. Method "A1A" link data 704 may additionally comprise an indication of how method "A1A" code 702 must be modified. Likewise, method "A2A" link data 714 comprises an indication of how to resolve the reference to method "B1A" 720. Method "A2A" link data 714 may additionally comprise an indication of how method "A2A" code 712 must be modified. Additionally, method "B2A" link data 730 comprises an indication of how to resolve the reference to method "BID" 726. Method "B2A" link data 730 may additionally comprise an indication of how method "B2A" code 728 must be modified. Referring to card memory 750 of FIG. 7, symbolic references to called methods have been replaced with the addresses of the called methods and the link data is not stored.
[0013] Unfortunately, storing the re-created CAP file in a persistent mutable memory and then processing the CAP file contents to create linked executable code requires a significant amount of available memory and is time consuming. [0014] Accordingly, a need exists in the prior art for a method and apparatus for communicating program data between a host computer and a smart card that is relatively efficient. A further need exists for such a solution that is relatively secure. Yet another need exists for such a solution that detects when program data has been tampered with.
SUMMARY OF THE INVENTION
[0015] A system for communicating program data between devices includes a first device configured to disassemble a program file comprising program data into at least one logical data unit, partition each logical data unit into at least one protocol data unit and compute a first fmgeφrint over the payload portion of the protocol data units. The first device is also configured to send the protocol data units and at least one member of the group comprising the first fingeφrint and a first authentication code based on the first fingeφrint to a second device. The second device is configured to compute a second fingeφrint over the payload portion of the protocol data units and to commit the program to a memory based on whether the at least one member matches the second fingeφrint or a second authentication code based on the second fingeφrint.
BRIEF DESCRIPTION OF THE DRAWINGS
[0016] The accompanying drawings, which are incoφorated into and constitute a part of this specification, illustrate one or more embodiments of the present invention and, together with the detailed description, serve to explain the principles and implementations of the invention.
In the drawings:
FIG. 1 is a block diagram that illustrates a typical mechanism for communicating program data between a host computer and a smart card.
FIG. 2A is a block diagram that illustrates a typical Command Application Protocol Data Unit (C-APDU).
FIG. 2B is a block diagram that illustrates a typical Response Application Protocol Data Unit (R-APDU).
FIG. 3 is a block diagram that illustrates loading a converted applet (CAP) file.
FIG. 4 is a flow diagram that illustrates loading a CAP file from the perspective of a loading terminal.
FIG. 5 is a flow diagram that illustrates loading a CAP file from the perspective of a smart card.
FIG. 6 is a flow diagram that illustrates reassembling a CAP file in a smart card.
FIG. 7 is a block diagram that illustrates modifying a stored program having link data to resolve static references.
FIG. 8 is a block diagram of a computer system suitable for implementing aspects of the present invention. FIG. 9 is a block diagram that illustrates a system for communicating program data between a host computer and a smart card in accordance with one embodiment of the present invention.
FIG. 10 is a high level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention.
FIG. 11 is a low level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention.
FIG. 12 is a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a host computer in accordance with one embodiment of the present invention.
FIG. 13 is a block diagram that illustrates partitioning a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention.
FIG. 14 is a flow diagram that illustrates a method for using program unit type map information in accordance with one embodiment of the present invention.
FIG. 15A is a block diagram that illustrates a CAP file comprising package-structured data.
FIG. 15B is a use diagram corresponding to the program within the CAP file of FIG.
FIG. 15C is a block diagram that illustrates the CAP file of FIG. 15A ordered based upon the use diagram of FIG. 15B in accordance with one embodiment of the present invention.
FIG. 16 is a flow diagram that illustrates a method for ordering program units for optimized verification and linking in accordance with one embodiment of the present invention. FIG. 17A is a block diagram that illustrates a CAP file comprising package-structured data.
FIG. 17B is a use diagram corresponding to the program within the CAP file of FIG.
FIG. 17C is a block diagram that illustrates the CAP file of FIG. 17A ordered based upon the use diagram of FIG. 17B in accordance with one embodiment of the present invention.
FIG. 18 is a flow diagram that illustrates a method for disassembling a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention.
FIG. 19 is a flow diagram that illustrates a method for disassembling a CAP file into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
FIG. 20A is a flow diagram that illustrates a method for computing an authentication fingeφrint over an APDU data stream where verification APDUs are included in the fingeφrint in accordance with one embodiment of the present invention.
FIG. 20B is a flow diagram that illustrates a method for computing an authentication fingeφrint over an APDU data stream where verification APDUs are excluded from the fingeφrint in accordance with one embodiment of the present invention.
FIG. 21 is a flow diagram that illustratέs a method for communicating program data from a host computer to a loading terminal from the perspective of a loading terminal in accordance with one embodiment of the present invention.
FIG. 22 is a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs in accordance with one embodiment of the present invention. FIG. 23 is a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
FIG. 24 is a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention.
FIG. 25 is a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs including APDUs comprising link data in accordance with one embodiment of the present invention.
FIG. 26 is a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention.
FIG. 27 is a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention.
FIG. 28 is a flow diagram that illustrates a method for creating one or more method link APDUs in accordance with one embodiment of the present invention.
FIG. 29 is a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card in accordance with one embodiment of the present invention.
FIG. 30 is a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card using an authentication fingeφrint that is a HMAC in accordance with one embodiment of the present invention.
FIG. 31 is a flow diagram that illustrates a method for performing load initialization in accordance with one embodiment of the present invention.
FIG. 32 is a flow diagram that illustrates a method for processing a logical APDU stream in accordance with one embodiment of the present invention.
FIG. 33 is a flow diagram that illustrates a method for computing an authentication fingeφrint in accordance with one embodiment of the present invention.
FIG. 34 is a flow diagram that illustrates a method for processing a logical APDU in accordance with one embodiment of the present invention.
FIG. 35 is a block diagram that illustrates data stractures for linking a program including virtual methods in accordance with one embodiment of the present invention.
FIG. 36 is a block diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention.
FIG. 37 is a flow diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention.
FIG. 38 is a block diagram that illustrates a hierarchy of program unit commitment fingeφrints in accordance with one embodiment of the present invention.
FIG. 39 is a block diagram that illustrates a data stracture including program code and program unit commitment fingeφrints in accordance with one embodiment of the present invention.
FIG. 40 is a block diagram that illustrates a data stracture including program code and a load storage commitment fingeφrint in accordance with one embodiment of the present invention. FIG. 41 is a flow diagram that illustrates a method for using a program unit commitment fmgeφrint to determine whether a program unit may be used, in accordance with one embodiment of the present invention.
FIG. 42 is a flow diagram that illustrates a method for determining whether stored program unit data is valid in accordance with one embodiment of the present invention.
FIG. 43 is a block diagram that illustrates a smart card configured to ensure a called method has been verified prior to execution in accordance with one embodiment of the present invention.
FIG. 44 is a flow diagram that illustrates a method for ensuring a called method has been verified prior to execution in accordance with one embodiment of the present invention.
DETAILED DESCRIPTION
[0017] Embodiments of the present invention are described herein in the context of communicating program data between a first device and a second device. Those of ordinary skill in the art will realize that the following detailed description of the present invention is illustrative only and is not intended to be in any way limiting. Other embodiments of the present invention will readily suggest themselves to such skilled persons having the benefit of this disclosure. Reference will now be made in detail to implementations of the present invention as illustrated in the accompanying drawings. The same reference indicators will be used throughout the drawings and the following detailed description to refer to the same or like parts.
[0018] In the interest of clarity, not all of the routine features of the implementations described herein are shown and described. It will, of course, be appreciated that in the development of any such actual implementation, numerous implementation-specific decisions must be made in order to achieve the developer's specific goals, such as compliance with application- and business-related constraints, and that these specific goals will vary from one implementation to another and from one developer to another. Moreover, it will be appreciated that such a development effort might be complex and time-consuming, but would nevertheless be a routine undertaking of engineering for those of ordinary skill in the art having the benefit of this disclosure.
[0019] In accordance with one embodiment of the present invention, the components, process steps, and/or data stractures may be implemented using various types of operating systems (OS), computing platforms, firmware, computer programs, computer languages, and/or general-puφose machines. The method can be ran as a programmed process running on processing circuitry. The processing circuitry can take the form of numerous combinations of processors and operating systems, or a stand-alone device. The process can be implemented as instructions executed by such hardware, hardware alone, or any combination thereof. The software may be stored on a program storage device readable by a machine.
[0020] In addition, those of ordinary skill in the art will recognize that devices of a less general puφose nature, such as hardwired devices, field programmable logic devices (FPLDs), including field programmable gate arrays (FPGAs) and complex programmable logic devices (CPLDs), application specific integrated circuits (ASICs), or the like, may also be used without departing from the scope and spirit of the inventive concepts disclosed herein.
[0021] In accordance with one embodiment of the present invention, the method may be implemented on a data processing computer such as a personal computer, workstation computer, mainframe computer, or high performance server running an OS such as Solaris® available from Sun Microsystems, Inc. of Santa Clara, California, Microsoft® Windows® XP and Windows® 2000, available from Microsoft Coφoration of Redmond, Washington, or various versions of the Unix operating system such as Linux available from a number of vendors. The method may also be implemented on a multiple-processor system, or in a computing environment including various peripherals such as input devices, output devices, displays, pointing devices, memories, storage devices, media interfaces for transferring data to and from the processor(s), and the like. In addition, such a computer system or computing environment may be networked locally, or over the Internet.
[0022] In the context of the present invention, the term "network" includes local area networks, wide area networks, the Internet, cable television systems, telephone systems, wireless telecommunications systems, fiber optic networks, ATM networks, frame relay networks, satellite communications systems, and the like. Such networks are well known in the art and consequently are not further described here.
[0023] In the context of the present invention, a hash function h is commutative if h(x,y) = h(y,x) for all x and y. In other words, the result of the hash function is independent of the argument order.
[0024] In the context of the present invention, the term "fingeφrint" is defined as the result of a function that identifies or detects one or more changes in a byte sequence. By way of example, a fingeφrint may comprise a non-commutative hash of an arbitrary byte sequence or a non-commutative hash of a sequence of one or more byte sequences. As a further example, a fingeφrint may comprise a CRC (cyclic redundancy code), a message digest, or the like. Such functions are described in Knuth, D. The Art of Computer Programming, Volume 2: Seminumerical Methods, Chapter 5. Addison Wesley, 1981.
[0025] In the context of the present invention, the term "authentication code" is defined as a digital signature, or a Message Authentication Code (MAC) using a block cipher. By way of example, an authentication code may be generated using the DES algorithm (Federal Information Processing Standards Publication 46-3, -Data Encryption Standard (DES), October 25, 1999; Federal Information Processing Standards Publication 197, Advanced Encryption Standard (AES), November 26, 2001), the Rijndael algorithm (J. Daemen and V. Rijmen, AES Proposal: Rijndael, AES Algorithm Submission, September 3, 1999), or the like. An authentication code produced as a result of a keyed hash function is an example of an authentication code that is also a fingeφrint.
[0026] In the context of the present invention, a keyed hash-based message authentication code (HMAC) is defined as a MAC that uses a cryptographic key in conjunction with a hash function. A HMAC is both a fingeφrint and a MAC.
[0027] In the context of the present invention, the term "authenticated fingeφrint" is defined as an authentication code based at least in part on a fingeφrint.
[0028] In the context of the present invention, the term "authentication fingeφrint" is defined as a fingeφrint used to create an authenticated fingeφrint.
[0029] In the context of the present invention, the term "session" or "user session" is defined as a period that begins when a user inserts a secure portable device such as a smart card or the like into a communications device such as a loading terminal or card acceptance device (CAD), and ends when the secure portable device is removed from the communications device. A "session ID" is used to describe an identifier that uniquely identifies such a session. One or more session ID may be used to uniquely identify the same session.
[0030] In the context of the present invention, the term "package-structured data" is defined as executable code using Java™-like naming conventions for references to external program units. By way of example, the Java™ naming convention for an external class includes a package name followed by the class name.
[0031] In the context of the present invention, the term "verification APDU" is defined as an APDU comprising a command and verification data. The verification data is located within the data field (reference numeral 240 of FIG. 2) of the APDU.
[0032] In the context of the present invention, the term "link APDU" is defined as an APDU comprising a command and link data. The link data is located within the data field (reference numeral 240 of FIG. 2) of the APDU.
[0033] In the context of the present invention, the term "program unit" is defined as an identifiable unit of program behavior. A higher-level program unit may include one or more lower-level program units. For example, a Java™ class may include one or more method.
[0034] Figure 8 depicts a block diagram of a computer system 800 suitable for implementing aspects of the present invention. As shown in FIG. 8, computer system 800 includes a bus 802 which interconnects major subsystems such as a central processor 804, a system memory 806 (typically RAM), an input/output (I/O) controller 808, an external device such as a display screen 810 via display adapter 812, serial ports 814 and 816, a keyboard 818, a fixed disk drive 820, a floppy disk drive 822 operative to receive a floppy disk 824, and a CD-ROM player 826 operative to receive a CD-ROM 828. Many other devices can be connected, such as a pointing device 830 (e.g., a mouse) connected via serial port 814 and a modem 832 connected via serial port 816. Modem 832 may provide a direct connection to a server via a telephone link or to the Internet via a POP (point of presence). Alternatively, a network interface adapter 834 may be used to interface to a local or wide area network using any network interface system known to those skilled in the art (e.g., Ethernet, xDSL, AppleTalk™).
[0035] Many other devices or subsystems (not shown) may be connected in a similar manner. Also, it is not necessary for all of the devices shown in FIG. 8 to be present to practice the present invention, as discussed below. Furthermore, the devices and subsystems may be interconnected in different ways from that shown in FIG. 8. The operation of a computer system such as that shown in FIG. 8 is readily known in the art and is not discussed in detail in this application, so as not to overcomplicate the present discussion. Code to implement the present invention may be operably disposed in system memory 806 or stored on storage media such as fixed disk 820, floppy disk 824 or CD-ROM 828.
Signature Protocol for Card Loading
[0036] Turning now to FIG. 9, a block diagram that illustrates a system for communicating program data between a host computer and a smart card in accordance with one embodiment of the present invention is presented. System 900 comprises a host computer 910, a loading terminal 985 and a smart card 950. Host computer 910 comprises an off-card installer 915 for augmenting a CAP file 980 comprising package- structured data 905 to create an augmented CAP file 920 comprising the package- structured data 925, an authentication fingeφrint 940, one or more loading terminal authentication codes 930 and one or more target smart card authentication codes 935. Augmented CAP file 920 may also comprise verification data 945 that verifies CAP file content. Authentication fingeφrint 940 is computed over the payload portion of logical APDUs derived from the package-structured data 925. Logical APDUs are illustrated in more detail below with reference to FIG. 13. As explained in more detail below, the similarity of the processes used by host computer 910, loading terminal 985 and target smart card 950 to compute an authentication fingeφrint guarantees that if the APDU payload remains the same, the same authentication fingeφrint will be generated regardless of the entity performing the computation. Conversely, if the APDU payload changes between when each entity performs the computation, a different fingeφrint will be generated, signaling a change in the payload.
[0037] According to one embodiment of the present invention, one or more of loading terminal authentication codes 930 and target smart card authentication codes 935 are based at least in part on authentication fingeφrint 940. According to another embodiment of the present invention, the authentication fingeφrint 940 comprises a eyed hash-based message authentication code (HMAC). According to another embodiment of the present invention, one or more of loading terminal authentication codes 930 and target smart card authentication codes 935 comprise a digital signature computed over augmented CAP file 920, without regard to logical APDUs.
[0038] According to embodiments of the present invention, a logical program unit APDU may be followed and/or preceded by one or more APDUs that provide verification information (verification APDU) and/or linking information (link APDU). The verification data may be embedded in the CAP file. Alternatively, the verification data may be computed by the loading terminal. If verification data is included in the CAP file, it may be used to compute an authentication fingeφrint. Linking data may also be computed by the loading terminal. Linking data may be based on data obtained from the card, data obtained from the Web, data in the CAP file, or any combination thereof.
[0039] Still referring to FIG. 9, loading terminal 985 is configured to receive the augmented CAP file 920, create one or more logical APDUs from package-structured data 925, authenticate the CAP file based at least in part on the loading terminal authentication code 930, create one or more APDUs comprising a selected target smart card authentication code 935 and the authentication fingeφrint 940, and communicate the one or more APDUs to target smart card 950.
[0040] According to one embodiment of the present invention, host computer 910 communicates an augmented CAP file without verification data. According to another embodiment of the present invention, host computer 910 communicates an augmented CAP file having verification data.
[0041] According to one embodiment of the present invention, loading terminal 985 receives an augmented CAP file 920 without verification data, computes verification data and creates one or more verification APDUs. According to another embodiment of the present invention, loading terminal 985 receives an augmented CAP file 920 with verification data and creates one or more verification APDUs. According to another embodiment of the present invention, loading terminal 985 computes link data and creates one or more link APDUs. [0042] According to one embodiment of the present invention, smart card 950 comprises a secure portable device such as a Java Card™ technology-enabled smart card, or the like.
[0043] According to one embodiment of the present invention, smart card 950 comprises a CDMA technology-enabled smart card. CDMA technology-enabled smart cards are described in Smart Card Stage I Description, Version 1.1, CDMA Development Group - Smart Card Team Document (May 22, 1996).
[0044] According to another embodiment of the present invention, smart card 950 comprises a SIM (Subscriber Identity Module card) card. The term "SIM card" describes the smart card used in GSM (Global System for Mobile Communications) mobile telephones. The SIM includes the subscriber's personal cryptographic identity key and other information such as the current location of the phone and an address book of frequently called numbers. The SIM is described in Digital cellular telecommunications system (phase 2+); Specification of the Subscriber Identity Module -Mobile Equipment (SIM -ME) interface, ETSI, GSM 11.11 version 7.4.0, Release 1998.
[0045] According to another embodiment of the present invention, smart card 950 comprises a WIM (Wireless Interface Module). A WIM is a smart card in a WAP (Wireless Application Protocol) phone. It is described in Wireless Identity Module Part: Security, WAP-260-WIM-20010712-a , Wireless Application Protocol Forum, July 12, 2001.
[0046] According to another embodiment of the present invention, smart card 950 comprises a USIM (Universal Subscriber Identity Module). A USIM is a smart card for a 3GPP (3rd Generation Partnership Project) mobile phone. It is described in 3rd Generation Partnership Project; Technical Specification Terminals; USIM and IC card requirements, Release 4, 3GPP TS 21.111 V4.0.0 (2001-03).
[0047] According to another embodiment of the present invention, smart card 950 comprises a UIM (User Identity Module). A UIM is a smart card for a 3GPP Project 2 (3GPP2) mobile phone. The term "R-UIM" is used when the smart card is removable. A UIM is a super set of the SIM and allows CDMA (Code Division Multiple Access)- based cellular subscribers to roam across geographic and device boundaries. The R-UIM is described in a specification issued by the 3rd Generation Partnership Project 2 (3GPP2) and entitled 3rd Generation Partnership Project 2; Removable User Identity Module (R-UIM) for cdma2000 Spread Spectrum Systems, 3GPP2 C.S0023-0, June 9, 2000.
[0048] The above description regarding various mobile phone technologies is not intended to be limiting in any way. Those of ordinary skill in the art will recognize that other user devices may be used.
[0049] Turning now to FIG. 10, a high level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention is presented. At 1020 an augmented CAP file is prepared. The augmented CAP file may comprise package-stractured data and an authentication fingeφrint computed over an APDU data stream comprising the package- stractured data. Alternatively, the augmented CAP file may comprise package-stractured data and at least one authentication code based at least in part on the authentication fingeφrint.
[0050] According to one embodiment of the present invention, preparing an augmented CAP file (1020) is preceded by determining a loading order of program elements for optimized verification and linking (1015). The load order used in 1015 may be used in 1020 to determine the order of logical APDUs in the computation of the authentication fmgeφrint. In a Java™ environment, the loading order for one or more classes, methods in classes or fields in methods is determined. The program elements may be ordered based at least in part on a use graph of the program in the CAP file. The "use" of a method may comprise, by way of example, calling the method. The "use" of a field may comprise, by way of example, accessing the field. The program elements may also be ordered based at least in part on type map information defined for the program. Type maps are explained in more detail below with reference to FIG. 14. Ordering program elements is explained in more detail below with reference to FIGS. 15A-15C. [0051] Still referring to FIG. 10, at 1025 the augmented CAP file is communicated to a loading terminal. At 1030, the loading terminal receives the augmented CAP file and initializes loading of an applet. At 1035, authenticated applet code is loaded on a target smart card. At 1040, applets are initialized. At 1045, a proof of loading received from the target smart card is processed to determine and record whether the load was successful.
[0052] Still referring to FIG. 10, smart card 1050 receives a load request from the loading terminal. At 1055, the smart card processes logical APDUs received from the loading terminal. The processing includes computing an authentication fingeφrint over the APDU payload. At 1060, initialization data received from the loading terminal is sed to initialize the smart card. At 1065, a proof of loading is sent to the loading terminal.
[0053] Turning now to FIG. 11, a low level flow diagram that illustrates communicating program data from a host computer to a smart card in accordance with one embodiment of the present invention. Figure 11 provides more detail for FIG. 10. More particularly, reference numerals 1106-1116, 1118-1136 and 1140-1150 of FIG. 11 correspond with reference numerals 1020-1025, 1030-1045 and 1050-1065 of FIG. 10, respectively. At 1106, a host computer disassembles a CAP file into logical data units, and the logical data units are partitioned into one or more APDUs. At 1108, an authentication fingeφrint is computed over the APDU data stream, as described below with reference to FIGS. 20A and 20B. At 1110, one or more loading terminal authentication codes are created. At 1112, one or more target smart card authentication codes are created. At 1114, the CAP file is augmented with the authentication codes, fingeφrint, or both. At 1116, the augmented CAP file is communicated to a loading terminal.
[0054] Still referring to FIG. 11, at 1118 the loading terminal receives a load request including the augmented CAP file, an applet ID (AID) or the like, initialization instructions and initialization data. The term "AID" is defined by International Standards Organization (ISO) Standard ISO-IEC 7816-3. At 1120, loading of the applet is initiated. The initiating may include separating any authentication codes and fingeφrint from the augmented CAP file and obtaining linking information. Optionally, at 1121 a loading order of program elements for optimized verification and linking is determined. The loading order of program elements may be determined as described with respect to reference numeral 1015 of FIG. 10. Alternatively, the order may be determined from an indicator stored in an augmented CAP file. At 1122, the augmented CAP file is disassembled into one or more logical APDUs. At 1124, the augmented CAP file is authenticated based on a loading terminal authentication code. At 1126, a target authentication code is selected from the target smart card authentication codes in the augmented CAP file based upon the target smart card. At 1128, one or more logical APDUs are communicated to the target smart card. At 1130, the fingeφrint or authentication code based on a fingeφrint is sent to the smart card. At 1132, the target smart card authentication code is sent to the smart card. At 1134, initialization instructions and load data are sent to the target smart card. At 1136 a proof of loading is received from the target smart card.
[0055] According to embodiments of the present invention, processes 1122 and 1124 are performed before processes 1126, 1128 and 1130. However, the order of processes 1126, 1128 and 1130 with respect to one another may be changed.
[0056] Still referring to FIG. 11, at 1140 the target smart card receives a load request from the loading terminal and performs load initialization. The load initialization may include receiving the fingeφrint or authentication code based on a fingeφrint that was sent at 1130. At 1142, logical APDUs received from the loading terminal are processed. The processing includes computing an authentication fingeφrint over the logical APDU payload. The processing may also include receiving the fingeφrint or authentication code based on a fingeφrint that was sent at 1130. At 1144, the received content is authenticated based on the target smart card authentication code. The authenticating may include receiving the fingeφrint or authentication code based on a fingeφrint that was sent at 1130. At 1146, the received content is committed to memory on the smart card if the received fingeφrint and the computed fingeφrint matches, and if the received content is properly authenticated. At 1148, initialization data received from the loading terminal is used to initialize the card. At 1150, a proof of loading is sent to the loading terminal.
[0057] Alternatively, the processes illustrated in FIGS. 10 and 11 may performed without using loading terminal authentication codes and/or target smart card authentication codes. The decision to use or not use authentication codes may be based at least in part on a level of trast in host computer 1100, loading terminal 1105 and/or smart card 1110. By way of example, if the loading terminal is trusted, the processes illustrated in FIGS. 10 and 11 may be performed without a loading terminal authentication code. Thus if a card issuer uses its own terminals to update a card, a terminal authentication code is not needed since the card issuer can trast terminals which the issuer controls. But if a third party terminal at a point of sale remote from the card issuer is used to update the card and the card has been in the possession of a user, a terminal authentication code may be needed because the card issuer may have little if any control over the terminal. Similarly, if the target smart card is trusted, the processes illustrated in FIGS. 10 and 11 may be performed without a target smart card authentication code.
[0058] Additionally, those of ordinary skill in the art will recognize that other mechanisms for creating a terminal authentication code may be used.
[0059] According to one embodiment of the present invention, the host computer 1100 and the loading terminal 1105 comprise the same device.
Host Computer
[0060] Turning now to FIG. 12, a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a host computer in accordance with one embodiment of the present invention is presented. Figure 12 provides more detail for reference numerals 1015-1025 of FIG. 10 and reference numerals 1106-1116 of FIG. 11. At 1200, a CAP file is received. At 1205, the CAP file is disassembled into one or more logical APDUs. At 1210, an authentication fingeφrint is computed over the APDU data stream. Alternatively, the authentication fϊngeφrint may be computed upon creation of a logical APDU (i.e. as part of the CAP file disassembly process 1205). At 1215, the CAP file is augmented to include the authentication fingeφrint, at least one data authentication code based at least in part on the authentication fingeφrint, or any combination thereof. At 1220, the augmented CAP file is communicated to a loading terminal. [0061] Turning now to FIG. 13, a block diagram that illustrates partitioning a CAP file into one or more logical APDUs in accordance with one embodiment of the present invention is presented. Figure 13 provides more detail for reference numeral 1205 of FIG. 12. CAP file 1300 is partitioned into one or more APDUs comprising package definition data 1305 for any package in the CAP file. Package definition data may comprise a package identifier. A class within a package is partitioned into one or more APDUs comprising class definition data 1310 for any class in the package. Class definition data may comprise, by way of example, a class identifier, a base class identifier and one or more interface identifiers. For any method in a class, the method is partitioned into one or more APDUs comprising method definition data 1315 and one or more APDUs comprising method code data 1320. For any field in a class, the field is partitioned into one or more APDUs comprising field definition data 1325. For static fields, the fields are also partitioned into one or more APDUs comprising field initialization data 1330.
[0062] Method definition data 1315 may comprise, by way of example, a method identifier, a return type identifier, one or more parameter type identifiers and one or more throwable exception type identifiers. Method code data 1320 may comprise, by way of example, executable bytecodes. Field definition data 1325 may comprise, by way of example, a field count, and a field type identifier for each field included in the field count. Field initialization data 1330 may comprise, by way of example, data used to initialize constant data.
[0063] According to embodiments of the present invention, one or more APDUs comprising verification data may be associated with a program unit such a package, a class or a method, or the like. The verification information is computed off-card by a host computer or a loading terminal, and loaded onto the card for use at load time, and possibly for use during program execution. The one or more verification APDUs may be inserted in the APDU data stream before the corresponding logical program unit APDUs. The one or more verification APDUs may also be inserted in the APDU data stream after the corresponding logical program unit APDUs. The verification data includes information for use in predicting program behavior during execution. Verification data may include, by way of example, primitive data type information such as bounds on values belonging to a particular data type. Verification data may also include program stack state information, such as the data type of entries on the program stack during simulated execution of the associated method code. The program stack state information may also include one or more reference to classes which are composite data types.
[0064] According to one embodiment of the present invention, class verification APDUs supplement verification data in the method verification APDUs for methods in a particular class. Such class verification APDUs may be used, by way of example, when a particular load order results in incomplete verification information availability when performing a per-method verification.
[0065] According to another embodiment of the present invention, package verification APDUs supplement verification data in the class verification APDUs for classes in a particular package. Such package verification APDUs may be used, by way of example, when a particular load order results in incomplete verification information availability when performing a per-class verification.
Type Map Information
[0066] According to another embodiment of the present invention, verification information is condensed using one or more type maps. The one or more type maps refer to sets of types that are relevant to a particular program unit. The one or more type maps refer to the data type of entries on an operand stack or in a register file during simulated execution of the corresponding code. The type maps allow optimization of verification by using relatively smaller numbers to refer to predefined sets of types as the types used in the corresponding code. This provides a relatively condensed representation of the types that need to be checked during verification of a program unit. This is explained in more detail below, with reference to FIG. 14.
[0067] Turning now to FIG. 14, a flow diagram that illustrates a method for using program unit type map information in accordance with one embodiment of the present invention is presented. At 1400, a program unit is received. Using Java™ technology as an example, a method, class or package is received. At 1405, the types used by the program unit are determined. At 1410, a mapping for the types is created. At 1415, the program unit mapping information is used in verification information for the program unit.
[0068] According to one embodiment of the present invention, program unit type map information is used to represent all type information in a program unit. According to another embodiment of the present invention, program unit type map information is used to represent a subset of type information in a program unit. By way of example, a type map may be used to represent the most-used types in the program unit.
[0069] According to one embodiment of the present invention, a type map comprises a bitmap, each bit of the type map representing a particular data type. By way of example, a 16-bit type map may be used to represent 16 types.
[0070] According to another embodiment of the present invention, type map information for a lower-level program unit is cumulative with respect to type map information for a higher-level program unit. By way of example, a package-level 4-bit type map may be used to represent the 16 most-used types in a package. A class-level 4- bit type map may be used to represent the 16 most-used types in a class, exclusive of the 16 types represented by the package-level type map. As a further example, a bitmapped package-level 4-bit type map may be used to represent the 4 most-used types in a package. A bitmapped class-level 4-bit type may be used to represent the 4 most-used types in a class, exclusive of the 4 types represented by the package level type map.
[0071] According to one embodiment of the present invention, a trailer APDU indicates the last APDU associated with a program unit. According to another embodiment of the present invention, a header APDU precedes one or more APDUs associated with a program unit and defines the expected sequence of logical program unit APDUs to follow.
Program Element Order
[0072] Figures 15A - 17C illustrate determining the order of program elements in a CAP file in accordance with one embodiment of the present invention. Figures 15A - 17C provide more detail for reference numeral 1015 of FIG. 10 and reference numeral 1121 of FIG. 11. Figure 15A illustrates a CAP file before ordering, FIG. 15B illustrates a use graph of the program elements in the CAP file of FIG. 15A and FIG. 15C illustrates the ordering of program elements in the original CAP file based at least in part on the use graph of FIG. 15B. According to one embodiment of the present invention, the original CAP file is ordered based at least in part on the corresponding use graph. The ordered file is communicated to the target device. According to another embodiment of the present invention, the original CAP file is modified to include an order indicator that indicates the load order for the CAP file content. The modified CAP file is communicated to the target device. According to another embodiment of the present invention, the original CAP file and an order indicator that indicates the load order for the CAP file content are communicated to the target device.
[0073] Turning now to FIG. 16, a flow diagram that illustrates a method for ordering program units for optimized verification and linking in accordance with one embodiment of the present invention is presented. At 1600, a program including multiple program units targeted to a device such as a smart card or the like is received. At 1605, a use graph of the program is obtained. At 1610, the program units are ordered to create an ordered program. The ordering is based at least in part on the use graph obtained at 1605. At 1615, the ordered program is communicated to the device.
[0074] According to one embodiment of the present invention, a "depth-first" approach for ordering program elements is followed. Using FIGS. 15A-15C as an example, method A.B.C (1540) is the main method and it calls method A.B.A (1542). Method A.B.A (1542) calls method A.B.B (1544) first and method A.A.B (1546) second. Neither method A.B.B (1544) nor method A.A.B (1546) calls other methods. Method A.B.C (1540) also calls method A.A.A (1548), followed by method A.A.C (1550). Following the use graph of FIG. 15B, and proceeding in a depth-first, left-to-right manner, the resulting order is: A.B.B (1544), A.A.B (1546), A.B.A (1542), A.A.A (1548), A.A.C (1550), A.B.C (1540). This is the order reflected in the ordered package illustrated in FIG. 15C.
[0075] Figures 17A - 17C illustrate determining the order CAP file content based on a use diagram to create a more flattened ordered CAP file. Figures 17A - 17C are similar to FIGS. 15A - 15C except that the ordered CAP file 1502 of FIG. 15C retains the class structure of the original CAP file 1500, whereas the ordered CAP file 1702 of FIG. 17C has been flattened and thus does not retain the original class stracture in the CAP file 1700. Figure 17A illustrates a CAP file comprising package-stractured data. Figure 17B illustrates a use diagram corresponding to the program within the CAP file of FIG. 17A. Figure 17C illustrates the CAP file of FIG. 17A ordered based upon the use diagram of FIG. 17B in accordance with one embodiment of the present invention.
[0076] As shown in FIG. 17C, the first-used method is method A.B.B 1754. The use of method A.B.B 1754 requires class A.B data 1724 and class A.B fields 1726, so this information is placed before method A.B.B 1728 in the ordered CAP file 1702. The next-used method is method A.A.B 1756. The use of method A.A.B 1756 requires class A. A data 1730 and class A. A fields 1733. Since the required class and field data does not occur earlier in the ordered CAP file, the required class and field data is placed before method A.A.B 1734 in the ordered CAP file 1702. Placement of succeeding methods in the ordered CAP file 1702 proceeds according to the order of use, without regard to which class a method belongs to. In the present example, no further class or field data needs to be loaded because class and field data for the only two classes present in the original CAP file 1700 has already been placed in the ordered CAP file 1702.
[0077] The program elements and use graph shown in FIGS. 15A - 17C are for puφoses of illustration only. Those of ordinary skill in the art will recognize a use graph may be used to represent the use of other portions of a program. By way of example, a use graph may also represent the use of fields or other program constructs. Additionally, portions of a program from different packages may be ordered in a fashion similar to that shown in FIG. 17C, with package data for a particular package being positioned in the resulting file before any program units of the package. Also, those of ordinary skill in the art will recognize that many combinations of program elements and calling relationships between those program elements are possible.
[0078] According to another embodiment of the present invention, APDUs are arbitrarily ordered, with each APDU including context information. By way of example, an APDU may include information identifying the APDU contents as the fourth method of the second class. Including context information in an APDU facilitates loading all static data first (all the fields, classes and names) and then loading all the methods, ensuring information used by the methods for use in verification and linking is available first.
[0079] According to one embodiment of the present invention, a host computer inserts an ordering indicator in an augmented CAP file containing program data. A loading terminal uses the ordering indicator to determine the ordering of APDUs created as a result of the CAP file disassembly process. According to one embodiment of the present invention, the ordering indicator is based at least in part on a use graph of the program. By way of example, type map information may be loaded relatively late in the loading process, thus minimizing the amount of memory required. Alternatively, type map information may be loaded relatively early in the loading process, thus increasing the probability that the type information will be resident on the card when the types are referenced.
[0080] According to one embodiment of the present invention, one or more field definition APDUs 1325 and field initialization APDUs 1330 corresponding to a particular class are processed before any corresponding method definition APDU 1315 or method code APDU 1320 of the class.
CAP File Disassembly
[0081] Figures 18 and 19 are flow diagrams that illustrate disassembling a CAP file into logical APDUs from the perspective of a host computer in accordance with embodiments of the present invention. Figure 18 illustrates disassembling a CAP file that does not include verification data and FIG. 19 illustrates disassembling a CAP file that includes verification data.
[0082] Turning now to FIG. 18, a flow diagram that illustrates a method for disassembling a CAP file into logical APDUs in accordance with one embodiment of the present invention is presented. The process illustrated within box 1800 is performed per package. At 1805, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 1810 is performed per class. At 1815, one or more class definition APDUs comprising class definition data are created for a class. At 1820, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 1825 is performed per method. At 1835, one or more method definition APDUs comprising method definition data are created for a method. At 1840, one or more code APDUs comprising the method code are created for the method. At 1830, one or more data initialization APDUs are created.
[0083] According to embodiments of the present invention, verification data may be created for program units. The verification data may be created for program units such as packages, classes, methods, or the like, or any combination thereof. As mentioned previously, the verification data for a program unit may be inserted in an APDU stream before the corresponding program unit code APDU or program unit definition APDU. In one embodiment, the verification data is inserted immediately before the corresponding program unit code APDU or program unit definition APDU. Alternatively, the verification data for a program unit may be inserted in an APDU stream after the corresponding program unit code APDU or program unit definition APDU. In one embodiment, the verification data is inserted immediately after the corresponding program unit code APDU or program unit definition APDU. This is explained in more detail below with reference to FIG. 19.
[0084] Turning now to FIG. 19, a flow diagram that illustrates a method for disassembling a CAP file into logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented. Figure 19 is similar to FIG. 18, except that verification data is included in FIG. 19 at reference numerals 1940, 1945 and 1955. The process illustrated within box 1900 is performed per package. At 1905, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 1910 is performed per class. At 1915, one or more class definition APDUs comprising class definition data are created for a class. At 1920, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 1925 is performed per method. At 1930, one or more method definition APDUs comprising method definition data are created for a method. At 1935, one or more code APDUs comprising the method code are created for the method. At 1940, one or more method verification APDUs comprising method verification data are created for a method. At 1945, one or more class verification APDUs comprising class verification data are created for a class. At 1950, one or more data initialization APDUs are created. At 1955, one or more package verification APDUs comprising package verification data are created for a package.
[0085] According to embodiments of the present invention, one or more verification APDUs are inserted into the APDU stream before and/or after the corresponding one or more code or definition APDUs. Using FIG. 19 as an example, one or more package verification APDUs may be inserted into the APDU stream (1955) after inserting the corresponding one or more package definition APDUs (1905). Alternatively, one or more package verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more package definition APDUs. Similarly, one or more class verification APDUs may be inserted into the APDU stream (1945) after inserting the corresponding one or more class definition APDUs (1915). Alternatively, one or more class verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more class definition APDUs. As a further example, one or more method verification APDUs may be inserted into the APDU stream (1940) after inserting the corresponding one or more method definition APDUs (1930). Alternatively, one or more method verification APDUs may be inserted into the APDU stream before inserting the corresponding one or more method definition APDUs. A verification APDU that precedes or succeeds the corresponding one or more code or definition APDUs may comprise, by way of example, one or more type maps.
[0086] Figures 20A and 20B are flow diagrams that illustrate methods for computing an authentication fingeφrint over an APDU data stream in accordance with embodiments of the present invention. Figures 20A and 20B provide more detail for reference numeral 1108 of FIG. 11. Figure 20A illustrates computing an authentication fingeφrint when verification APDUs are used to determine the authentication fingeφrint. Figure 20B illustrates computing an authentication fingeφrint when verification APDUs are not used to determine the authentication fingeφrint. The process illustrated by FIGS. 20A and 20B are the same processes used by a loading terminal (reference numerals 1128 and 130 of FIG. 11) and by a target smart card (reference numeral 1142 of FIG. 11) to compute an authentication fingeφrint, as described below. [0087] Turning now to FIG. 20, a flow diagram that illustrates a method for computing an authentication fingeφrint over an APDU data stream in accordance with one embodiment of the present invention is presented. Referring to FIG. 20A, at 200 an authentication fingeφrint is initialized. At 2005, a logical APDU is received., At 2010, the fingeφrint is computed over the logical APDU payload. The fingeφrint computation uses the result of the previously computed fingeφrint. At 2015, a determination is made regarding whether another logical APDU remains to be processed. Processing of additional APDUs continues at 2005.
[0088] Referring to FIG. 20B, at 2020 an authentication fingeφrint is initialized. At 2025, a logical APDU is received. At 2030, a determination is made regarding whether the APDU is a verification APDU. If the APDU is not a verification APDU, the fingeφrint is computed over the logical APDU payload at 2035. The fingeφrint computation uses the result of the previously computed fingeφrint. At 2040, a determination is made regarding whether another logical APDU remains to be processed. Processing of additional APDUs continues at 2025.
Loading Terminal
[0089] Turning now to FIG. 21, a flow diagram that illustrates a method for communicating program data from a host computer to a loading terminal from the perspective of a loading terminal in accordance with one embodiment of the present invention is presented. Figure 21 provides additional detail for reference numerals 1030- 1045 of FIG. 10 and reference numerals 1118-1136 of FIG. 11. At 2100, an augmented CAP file is received. At 2105, any authentication codes and fingeφrints are separated from the augmented CAP file. At 2110, linking information is obtained. The linking information comprises information needed to link methods, such as the card's present callable routines and how to reference them. The linking information may be obtained from an external source. By way of example, a loading terminal may communicate via the Web with a central repository having knowledge of a particular target smart card's linking information. As a further example of obtaining linking information from an external source, a loading terminal may obtain the information from the target smart card itself.
[0090] Still referring to FIG. 21, at 2115 the augmented CAP file is disassembled into one or more logical APDUs. At 2120, the one or more logical APDUs are communicated to a smart card and an authentication fingeφrint is computed over the APDU payload. The process in 2115 and 2120 is similar to processes 1205 and 1210 of FIG. 12 performed by the host computer as described above, as well as the processes 2905 of FIG. 29 and 3005 of FIG. 30 performed by the target smart card as described below. The similarity of the processes guarantees that if the APDU payload remains the same, the same authentication fingeφrint will be generated regardless of the entity performing the computation. Conversely, if the APDU payload changes between when each entity performs the computation, a different fingeφrint will be generated, signaling a change in the payload.
[0091] Still referring to FIG. 21, process 2125 applies when a CAP file optionally includes an authentication fingeφrint. If the CAP file includes an authentication fingeφrint, a determination is made regarding whether the fingeφrint extracted from the augmented CAP file in 2105 matches the fingeφrint computed at 2120. If the fmgeφrints match, at 2130 a target smart card authentication code appropriate for the particular target smart card is extracted from the CAP file. At 2135, the fingeφrint, authentication code, or both, are sent to the target smart card. At 2140, initialization instractions are performed and the resultant data is loaded. At 2145, a proof of loading is received from the smart card. According to one embodiment of the present invention, the proof of loading comprises the storage commitment fingeφrint.
[0092] As illustrated in FIG. 21, the loading terminal disassembles an augmented CAP file into logical APDUs (2115) and then computes an authentication fingeφrint over the logical APDU payload upon transmitting the logical APDUs to the target smart card (2120). Alternatively, the computation of the authentication fingeφrint may be interleaved with the disassembly process (2115). As a further alternative, both the transmission of APDUs to the target smart card and the computation of the authentication fingeφrint may be interleaved with the disassembly process (2115).
[0093] As mentioned previously, the augmented CAP file received by a loading terminal may include verification data. The loading terminal may also receive a CAP file without verification data, compute verification data, create one or more APDUs containing the data and send the one or more APDUs to the target smart card. The determination regarding whether to include verification data in the authentication fingeφrint computation is based on whether the CAP file received by the loading terminal includes verification data, and on whether the target smart card requires verification data. If the received CAP file includes verification data, the authentication fingeφrint is additionally computed over the verification data. If the received CAP file does not include verification data, the authentication fingeφrint is not computed over verification data, regardless of whether the loading terminal produces verification data that is sent to the target smart card.
[0094] The loading terminal may also receive a CAP file, compute link data, create one or more APDUs containing the data and send the one or more APDUs to the target smart card. Figures 22-27 illustrate methods for disassembling an augmented CAP file into one or more logical APDUs from the perspective of a loading terminal in accordance with embodiments of the present invention. Figures 22-27 provide more detail for reference numeral 2115 of FIG. 21. As mentioned previously, the program elements of the CAP file to be disassembled may be ordered for optimized verification and linking (reference numeral 1121 of FIG. 11) prior to the disassembling processes illustrated in FIGS. 22-27. Figure 22 illustrates disassembling an augmented CAP file into one or more logical APDUs. Figure 23 illustrates disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data. Figure 24 illustrates disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data. Figure 25 illustrates disassembling an augmented CAP file into one or more logical APDUs including APDUs comprising link data. Figure 26 illustrates disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data. Figure 27 illustrates disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data.
[0095] Turning now to FIG. 22, a flow diagram that illustrates a method for disassembling an augmented CAP file into one or more logical APDUs in accordance with one embodiment of the present invention is presented. Figure 22 is similar to the process performed by the host computer as illustrated in FIG. 18. The process illustrated within box 2200 is performed per package. At 2205, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2210 is performed per class. At 2215, one or more class definition APDUs comprising class definition data are created for a class. At 2220, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2225 is performed per method. At 2230, one or more method definition APDUs comprising method definition data are created for a method. At 2235, one or more code APDUs comprising the method code are created for the method. At 2240, one or more data initialization APDUs are created.
[0096] Turning now to FIG. 23, a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented. Figure 23 is similar to the process performed by the host computer as illustrated in FIG. 19. The process illustrated within box 2300 is performed per package. At 2305, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2310 is performed per class. At 2315, one or more class definition APDUs comprising class definition data are created for a class. At 2320, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2325 is performed per method. At 2330, one or more method definition APDUs comprising method definition data are created for a method. At 2335, one or more code APDUs comprising the method code are created for the method. At 2340, one or more method verification APDUs comprising method verification data are created for a method. At 2345, one or more class verification APDUs comprising class verification data are created for a class. At 2350, one or more data initialization APDUs are created. At 2355, one or more package verification APDUs comprising package verification data are created for a package.
[0097] Turning now to FIG. 24, a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data in accordance with one embodiment of the present invention is presented. Figure 24 is similar to FIG. 23, except that in FIG. 24, verification data is computed (2440, 2445, 2455), whereas in FIG. 23, verification data used to create one or more verification APDUs (2340, 2345, 2355) is extracted from the augmented CAP file. The process illustrated within box 2400 is performed per package. At 2405, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2410 is performed per class. At 2415, one or more class definition APDUs comprising class definition data are created for a class. At 2420, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2425 is performed per method. At 2430, one or more method definition APDUs comprising method definition data are created for a method. At 2435, one or more code APDUs comprising the method code are created for the method. At 2440, method verification data is computed and one or more method verification APDUs comprising method verification data are created for a method. At 2445, class verification data is computed and one or more class verification APDUs comprising class verification data are created for a class. At 2450, one or more data initialization APDUs are created. At 2455, package verification data is computed and one or more package verification APDUs comprising package verification data are created for a package. [0098] Turning now to FIG. 25, a flow diagram that illustrates a method for disassembling an augmented CAP file into logical one or more APDUs including APDUs comprising link data in accordance with one embodiment of the present invention is presented. FIG. 25 is similar to FIG. 22, except that per-method link APDUs are created (2540) in FIG. 25. The process illustrated within box 2500 is performed per package. At 2505, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2510 is performed per class. At 2515, one or more class definition APDUs comprising class definition data are created for a class. At 2520, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2525 is performed per method. At 2530, one or more method definition APDUs comprising method definition data are created for a method. At 2535, one or more code APDUs comprising the method code are created for the method. At 2540, per-method link APDUs are created. At 2545, one or more data initialization APDUs are created.
[0099] Turning now to FIG. 26, a flow diagram that illustrates a method for disassembling an augmented CAP file including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention is presented. Figure 26 represents the combination of FIGS. 23 and 25. The process illustrated within box 2600 is performed per package. At 2605, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2610 is performed per class. At 2615, one or more class definition APDUs comprising class definition data are created for a class. At 2620, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2625 is performed per method. At 2630, one or more method definition APDUs comprising method definition data are created for a method. At 2635, one or more code APDUs comprising the method code are created for the method. At 2640, one or more method verification APDUs comprising method verification data are created for a method. At 2645, per-method link APDUs are created. At 2650, one or more class verification APDUs comprising class verification data are created for a class. At 2655, one or more data initialization APDUs are created. At 2660, one or more package verification APDUs comprising package verification data are created for a package.
[0100] Turning now to FIG. 27, a flow diagram that illustrates a method for disassembling an augmented CAP file not including verification data into one or more logical APDUs including APDUs comprising verification data and APDUs comprising link data in accordance with one embodiment of the present invention is presented. Figure 27 represents the combination of FIGS. 24 and 25. The process illustrated within box 2700 is performed per package. At 2705, one or more package definition APDUs comprising package definition data are created for a package. The process illustrated within box 2710 is performed per class. At 2715, one or more class definition APDUs comprising class definition data are created for a class. At 2720, one or more field definition APDUs comprising field definition data are created for the class. The process illustrated within box 2725 is performed per method. At 2730, one or more method definition APDUs comprising method definition data are created for a method. At 2735, one or more code APDUs comprising the method code are created for the method. At 2740, method verification data is computed and one or more method verification APDUs comprising method verification data are created for a method. At 2745, per-method link APDUs are created. At 2750, class verification data is computed and one or more class verification APDUs comprising class verification data are created for a class. At 2755, one or more data initialization APDUs are created. At 2760, package verification data is computed and one or more package verification APDUs comprising package verification data are created for a package.
[0101] Turning now to FIG. 28, a flow diagram that illustrates a method for creating one or more method link APDUs in accordance with one embodiment of the present invention is presented. Figure 28 provides more detail for reference numeral 2540 of FIG. 25, reference numeral 2645 of FIG. 26 and reference numeral 2745 of FIG. 27. At 2800, verifiable linking instractions are computed based on logical memory layout and information from the card. The loading terminal may have previously obtained this information as described above with respect to reference numeral 2110 of FIG. 21. At 2805, a link APDU that includes the verifiable linking instractions is created.
Smart Card [0102] Turning now to FIG. 29, a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card in accordance with one embodiment of the present invention is presented. Figure 29 provides additional detail for reference numerals 1050-1065 of FIG. 10 and reference numerals 1140-1150 of FIG. 11. At 2900, load initialization is performed. At 2905, one or more logical APDUs are processed to prepare the data in their data fields for loading. The processing comprises computing an authentication fmgeφrint. At 2910, an authentication fingeφrint APDU is received. Alternatively, the authentication fingeφrint may be received as part of load initialization (2600), or as part of processing APDUs (2605).
[0103] Still referring to FIG. 29, at 2915 a determination is made regarding whether the received authentication fingeφrint matches the authentication fingeφrint computed at 2905. If the received authentication fingeφrint does not match the computed authentication fingeφrint, a failure indication is made at 2945. If the received authentication fingeφrint matches the computed authentication fingeφrint, a target smart card authentication code is received at 2920 and authentication is performed based on the target smart card authentication code at 2925. At 2930, a determination is made regarding whether the authentication was successful. If the authentication was unsuccessful, a failure indication is made at 2945. If the authentication was successful, the program data is committed to the smart card memory at 2935 and a loading proof is provided at 2940. The program data may be committed to the smart card memory by associating the program data with a storage commitment fingeφrint computed over the finally stored program data. According to one embodiment of the present invention, the loading proof comprises the storage commitment fingeφrint. According to another embodiment of the present invention, the loading proof comprises an authentication code based at least in part on the storage commitment fingeφrint.
[0104] Turning now to FIG. 30, a flow diagram that illustrates a method for communicating program data from a loading terminal to a smart card from the perspective of a smart card using an authentication fingeφrint that is a HMAC in accordance with one embodiment of the present invention is presented. Figure 30 is similar to FIG. 29, except that determinations 2930 and 2915 in FIG. 29 are equivalent to determination 3015 in FIG. 30. Since a HMAC is both a fingeφrint and a message authentication code, the program data may be committed to the smart card memory when the received authentication fingeφrint matches the computed authentication fmgeφrint. At 3000, load initialization is performed. At 3005, one or more logical APDUs are processed to prepare the data in their data fields for loading. The processing comprises computing an authentication fingeφrint. At 3010, an authentication fingeφrint APDU is received. Alternatively, the authentication fingeφrint may be received as part of load initialization (2600), or as part of processing APDUs (2605).
[0105] Still referring to FIG. 30, at 3015 a determination is made regarding whether the received authentication fingeφrint matches the authentication fingeφrint computed at 3005. If the received authentication fmgeφrint does not match the computed authentication fingeφrint, a failure indication is made at 3030. If the received authentication fingeφrint matches the computed authentication fingeφrint, the program data is committed to the smart card memory at 3020 and a loading proof is provided at 3025. The program data may be committed to the smart card memory by associating the program data with a storage commitment fingeφrint computed over the finally stored program data. According to one embodiment of the present invention, the loading proof comprises the storage commitment fingeφrint. According to another embodiment of the present invention, the loading proof comprises an authentication code based at least in part on the storage commitment fingeφrint.
[0106] Turning now to FIG. 31, a flow diagram that illustrates a method for performing load initialization in accordance with one embodiment of the present invention is presented. Figure 31 provides more detail for reference numeral 2900 of FIG. 29 and reference numeral 3000 of FIG. 30. At 3100, a request for loading is received. At 3105, the request is authenticated to determine whether the loading process should proceed. At 3110, a determination is made regarding whether the authentication in 3105 was successful. If the authentication was not successful, the process ends with failure at 3130. If the authentication was successful, at 3115 load parameters are checked to determine whether the load is capable of succeeding, based on known characteristics of the card and the program data to be loaded. By way of example, if the card has less memory than what is required by the program data to be loaded, an indication that the load will fail is made. Additionally, if the program data to be loaded requires classes that are not presently on the card and are not part of the program data to be loaded, an indication that the load will fail is made. At 3120, a determination is made regarding whether the load is capable of succeeding based upon the result of process 3115. If the load is capable of succeeding, preparations for loading are made at 3125. Exemplary preparations include initializing one or more authentication fingeφrints and one or more storage commitment fingeφrints. If the load is not capable of succeeding, the loading process ends with failure at 3130.
[0107] Alternatively, the order of processes 3105 and 3115 may be switched so that process 3115 is performed before process 3105. However, load initialization ends with failure 3130 if either of processes 3105 and 3115 fails .
[0108] Turning now to FIG. 32, a flow diagram that illustrates a method for processing an APDU stream in accordance with one embodiment of the present invention is presented. Figure 32 provides more detail for reference numeral 2905 of FIG. 29 and reference numeral 3005 of FIG. 30. At 3200, a logical APDU is received. At 3205, the logical APDU is pre-processed. The pre-processing may include, by way of example, finalizing processing of the previous program unit if the current APDU is the first APDU of another program unit. The pre-processing may also include, by way of example, decryption. The result of the pre-processing is an indication of whether the logical APDU is valid. At 3210, a determination is made regarding whether the logical APDU is valid. If the logical APDU is invalid, loading is aborted at 3215. If the logical APDU is valid, an authentication fingeφrint is computed at 3210 and the received logical APDU is processed at 3225 to prepare the data in the logical APDU data field for storage. The processing may include, by way of example, resolving references to other program units. At 3230, a determination is made regarding whether a stored result is required. Some APDUs may not require persistent storage. By way of example, an APDU that merely includes information about a preceding or succeeding APDU may not require persistent storage. If a stored result is required, the result is stored at 3225. At 3240, a storage commitment ftngeφrint is computed over the stored result using the result of the previously computed storage commitment fingeφrint.
[0109] Turning now to FIG. 33, a flow diagram that illustrates a method for computing an authentication fingeφrint in accordance with one embodiment of the present invention is presented. Figure 33 provides more detail for reference numeral 3220 of FIG. 32. At 3300, a determination is made regarding whether the APDU is a link APDU. If the APDU is not a link APDU, at 3305 a determination is made regarding whether the APDU is a verification APDU. If the APDU is a verification APDU, at 3310 a determination is made regarding whether verification APDUs are part of the authentication fingeφrint. If the APDU is not a link APDU or a verification APDU, or if the APDU is a verification APDU and verification APDUs are part of the authentication fingeφrint, at 3315 the authentication fingeφrint is computed over the logical APDU payload using the result of the previously computed authentication fingeφrint.
[0110] As illustrated in FIG. 32, the receipt of logical APDUs (3200) is interleaved with the computation of an authentication fmgeφrint (3220) and computation of a storage commitment fingeφrint (3240). Alternatively, the smart card may receive one or more logical APDUs and then compute an authentication fingeφrint and storage commitment fingeφrint over the one or more received APDUs.
[0111] Turning now to FIG. 34, a flow diagram that illustrates a method for processing a logical APDU in accordance with one embodiment of the present invention is presented. Figure 34 provides more detail for reference numeral 3225 of FIG. 32. At 3400, verification information is accepted. At 3405, the verification information is used to verify a logical APDU. At 3410, a determination is made regarding whether the logical APDU was successfully verified. If the logical APDU was successfully verified, linking information is accepted at 3415 and at 3420, the linking information is used to link.
Virtual Method Jump Table
[0112] The data stractures as described with respect to FIG. 7 illustrate linking to static methods, or methods having a single call address. Object-oriented languages such as the Java™ language support virtual methods, or methods that may have multiple copies. In the Java™ language, a virtual method may be declared in a class and a subclass of the class may override or replace the virtual method with its own instance of the virtual method. An instance of the subclass will reference the version of the method overridden in the subclass, while an instance of the class will reference the virtual method declared in the class. [0113] According to one embodiment of the present invention, the capability to link virtual methods is provided by creating a jump table for each virtual method that is overridden at least once. The jump table includes the address of each instance of a virtual method. Object constructors are rewritten to accept a "type" parameter, constructor calls are rewritten to provide type information, and virtual method program calls are rewritten to include an indication of the current type of the called object. The indication of the current type is used as an index into the corresponding virtual method jump table, where the address of the appropriate virtual method code is obtained. This is explained in more detail below with reference to FIGS. 35-37.
[0114] Turning now to FIG. 35, data stractures for linking a program including virtual methods in accordance with one embodiment of the present invention is presented. As shown in FIG. 35, subclass N (3505) extends class M (3500) and does not override method A (3525) or B (3530). Subclass O (3510) extends class M (3500) and overrides method A (3525). Any calls to method O.A (3550) actually calls method O.A (3550), not method M.A (3525). Jump table 3320 is indexed by a value of a type identifier in the class instance data. Each entry of jump table 3520 includes the address of the virtual method instance corresponding to the index, for each virtual method in a class having at least one instance. Every call to method M.A (3525) that has been overridden includes a type identifier. The type identifier is used as an index in the jump table 3320 to obtain the address of the code corresponding to the virtual method instance. The calls in subclass N (3505) and subclass O (3510) are rewritten to call with the type identifier. The calls may be rewritten by a host computer or a loading terminal before loading the program on a smart card, such as when an augmented CAP file is produced. Alternatively, the calls may be rewritten by a loading terminal. The target smart card may also rewrite the calls after the program data has been loaded. The type identifier is obtained from a "current type of the object" field 3345 in the called object 3515.
[0115] Searching for the appropriate virtual method instance is thus made more deterministic by giving each subtype and each method a type identifier. Using the example illustrated in FIG. 35, when class "M" (3500) or class "N" (3505) objects are instantiated, both objects are instantiated with the type identifier having a value of zero. When the "O" (3510) object is instantiated, the type identifier associated with the instance is the value one. When object "O" (3510) calls the virtual method, the type identifier is used as an index into the jump table 3520 to determine which virtual method instance to call, thus obviating the need to perform an exhaustive search for the appropriate virtual method instance.
[0116] Turning now to FIG. 36, a block diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention is presented. Figure 36 is similar to FIG. 7, except that FIG. 36 includes a jump table (3676, 3680, 3682) for each virtual method having at least one virtual method instance. Referring to card memory 3600, code for methods A1A (3602), A2A (3612) and B2A (3628) include calls to virtual methods A1C (3608), B1A (3620) and BID (3626), respectively. Referring to modified card memory 3650, code for methods A1A (3652), A2A (3660) and B2A (3674) has been modified to refer to the jump table associated with the called virtual method (3676, 3680, 3682) and a type indicator of the called object.
[0117] Turning now to FIG. 37, a flow diagram that illustrates modifying a stored program having link data to resolve dynamic references in accordance with one embodiment of the present invention is presented. At 3700, a program is received. At 3705, classes in the program are enumerated. Box 3710 is performed per class. At 3720, object constructor calls are rewritten to provide type information. At 3725, object constructors are rewritten to accept a "type" parameter. Box 3715 is performed per virtual method in a class. At 3720, a determination is made regarding whether the virtual method has been overridden with an instance of the virtual method. If the virtual method has been overridden, at 3725 a virtual method jump table for the virtual method having at least one virtual method instance is created. At 3730, program calls to the virtual method are rewritten to refer to the jump table associated with the called virtual method and a type indicator of the called object. If the virtual method has not been overridden, the virtual method may be linked in the same manner as a static method.
[0118] According to another embodiment of the present invention, a call to a virtual method that has been overridden at least once is replaced with a call instruction that uses the type indicator of the called object as an index into a table positioned in the instruction stream inline with the call instraction. Program Unit Storage Commitment Fingeφrint
[0119] According to embodiments of the present invention, a program unit storage commitment fingeφrint is associated with a program unit. The program unit storage commitment fingeφrint may be used to indicate commitment of the program unit. In other words, the program unit storage commitment fingeφrint may be used to indicate the program unit has been finally loaded onto the target smart card. The program unit storage commitment fingeφrint may also be used to indicate whether the program unit data has been tampered with or is otherwise unfit for execution. The program unit storage commitment fingeφrint is computed over the program unit data and associated with the program unit at the time the program unit is finally stored in a persistent mutable memory and ready for use. The program unit storage commitment fingeφrint may be stored in an area of memory contiguous with the associated program data. Alternatively, a reference to the program unit commitment fingeφrint may be stored with the associated program data. As a further alternative, program units may be stored in a tabular form, with each entry including a storage unit and the corresponding fingeφrint. Those of ordinary skill in the art will recognize other techniques for associating program units with commitment fingeφrints are possible.
[0120] Upon use of the program unit, the program unit storage commitment fingeφrint initially associated with the program unit is matched against the result of computing a storage commitment fingeφrint over the program unit data. A mismatch indicates the program unit data has been tampered with or is otherwise unfit for execution.
[0121] A program unit may comprise any logical program stracture. Using Java™ technology as an example, a program unit may comprise a package, a class, a method or any combination thereof. Additionally, a program unit may be stored in noncontiguous memory.
[0122] According to one embodiment of the present invention, "use" of a program unit comprises executing the program unit. According to another embodiment of the present invention, "use" of a program unit comprises creating an instantiation of another program unit based at least in part on the program unit. Using Java™ technology as an example, "use" of a program unit may comprise object instantiation. According to another embodiment of the present invention, "use" of a program unit comprises reading the program unit data.
Hierarchical Program Unit Storage Commitment Fingeφrint
[0123] According to embodiments of the present invention, a storage commitment fingeφrint of a higher level program unit may be based at least in part on at least one storage commitment fingeφrint of a lower level program unit. This is illustrated below with respect to FIG. 38.
[0124] Turning now to FIG. 38, a block diagram that illustrates a hierarchy of program unit storage commitment fingeφrints in accordance with one embodiment of the present invention is presented. Reference numerals 3800-3808 represent classes, reference numerals 3810-3812 represent packages and reference numeral 3814 represents a load comprising one or more packages. Class storage cornmitment fingeφrints 3818-3826 are formed by computing a fingeφrint over class-level data in classes 3800-3808, respectively, and the collection of method storage commitment fϊngeφrints in classes 3800-3808, respectively. Package storage commitment fingeφrints 3828-3830 are formed by computing a fingeφrint over package-level data in packages 3810-3812, respectively, and the collection of class storage commitment fingeφrints in packages 3810-3812, respectively. Load storage commitment fingeφrint 3816 is formed by computing a fingeφrint over the collection of package storage commitment fingeφrints in load 3814.
[0125] Alternatively, one or more storage commitment fingeφrints of a higher level program unit may be based on the data of a lower level program unit. Using Java™ technology as an example, a class storage commitment fingeφrint may be based over class-level data and method-level data for methods belonging to the class.
[0126] Turning now to FIG. 39, a block diagram that illustrates a data stracture including program code and program unit storage corrrmitment fingeφrints in accordance with one embodiment of the present invention is presented. Card memory 3900 comprises a storage area for a load unit 3902 that comprises package "A" 3904 and package "B" 3906. Packages 3904 and 3906 comprise classes 3908-3910 and 3912- 3914, respectively. Classes 3908, 3910, 3912 and 3914 comprise methods 3916-3922, 3924-3926, 3928-3934 and 3936-3938, respectively. Method storage commitment fingeφrints 3940-3964 are computed over method code 3916-3938, respectively. Class storage commitment fingeφrints 3966, 3968, 3970 and 3972 are computed over method storage commitment fingeφrints 3940-3946, 3948-3950, 3954-3960 and 3962-3964, respectively. Class storage commitment fingeφrints 3966, 3968, 3970 and 3972 may also be computed over any field definitions and initialized static data that is part of the respective class. Package storage commitment fingeφrints 3974 and 3976 are computed over class storage cornmitment fingeφrints 3966-3968 and 3970-3972, respectively. Load unit storage commitment fingeφrint 3978 is computed over package storage commitment fingeφrints 3974 and 3976.
[0127] Turning now to FIG. 40, a block diagram that illustrates a data stracture including program code and a load storage commitment fingeφrint in accordance with one embodiment of the present invention is presented. Figure 40 is similar to FIG. 39, except FIG. 40 does not include class storage commitment fingeφrints or package storage commitment fingeφrints. Load unit storage commitment fingeφrint 4042 is computed over stored method code 4016-3840 in packages "A" 4004 and package "B" 4006.
Runtime Integrity Checks
[0128] According to embodiments of the present invention, a program unit commitment fingeφrint is used to check the integrity of a program unit at runtime. Figures 41 and 42 illustrate the general case for this rantime integrity checking. Figures 43 and 44 illustrate embodiments of the present invention that use a dispatching mechanism to implement runtime integrity checking.
[0129] Figure 41 is a flow diagram that illustrates a method for using a program unit commitment fingeφrint to determine whether a program unit may be used, in accordance with one embodiment of the present invention. At 4100, a request for use of a program unit is received. According to one embodiment of the present invention, the "use" comprises creating an instantiation based at least in part on the program unit. According to another embodiment of the present invention, the "use" comprises executing the program unit code. According to another embodiment of the present invention, the "use" comprises reading the program unit data.
[0130] According to embodiments of the present invention, a program unit may be a program, a package, a class, a method an instance variable or a class variable. However, the illustration of a program unit with respect to Java™ technology is not intended to be limiting in any way. Those of ordinary skill in the art will recognize that a program may be partitioned in many ways.
[0131] Still referring to FIG. 41, at 4105 a determination is made regarding whether it is the first time the program unit use request has been received in the current session. If it is not the first time the program unit use request has been received in the current session, a stored determination of program unit data validity is used at 4130. If this is the first time the program unit use request has been received in the current session, at 4135 an indication that the program unit has been used in the current session is made. At 4110, a determination is made regarding whether the stored program unit data is valid. The result of this determination is checked at 4115. If the stored program unit data is not valid, a failure indication is made at 4120. If the stored program unit data is valid, the program unit is used at 4125.
[0132] According to another embodiment of the present invention, the validity of a stored program unit is determined upon receiving a request for use of the program unit, without regard to whether a previous use request for the same program unit was received in the current session.
[0133] According to one embodiment of the present invention, a fingeφrint device is configured to compute authentication fingeφrints, program storage commitment fingeφrints, or both. According to another embodiment of the present invention, a fingeφrint device comprises a computation unit that computes the storage commitment fingeφrint. The computation unit is linked to memory dedicated to storing committed data. The computation unit may be integrated with a memory device comprising the memory. Alternatively, the computation unit may be a standalone device in communication with a memory device comprising the memory. According to one embodiment of the present invention, the computation unit is configured to automatically and incrementally compute the fingeφrint for the memory upon detecting a write operation to the memory.
[0134] According to another embodiment of the present invention, the computation unit is configured to automatically and incrementally compute the fingeφrint for the memory before use of data in the memory, such as upon detecting a read operation for the memory. By way of example, upon receiving a read request for data stored at memory addresses specified by a memory range, the computation unit computes a fingeφrint over the data stored at the memory addresses specified by the memory range.
[0135] Turning now to FIG. 42, a flow diagram that illustrates a method for determining whether stored program unit data is valid in accordance with one embodiment of the present invention is presented. Figure 42 provides more detail for reference numeral 4110 of FIG. 41. At 4200, a fingeφrint is computed over the program unit data. At 4205, a determination is made regarding whether the computed fingeφrint matches a stored fingeφrint. If the computed fingeφrint does not match the stored fmgeφrint, at 4210 an indication that the stored program unit data is invalid is made. If the computed fingeφrint matches the stored fingeφrint, at 4215 an indication that the stored program unit data is valid is made.
Dispatch Table
[0136] In the context of the present invention, the term "gateway dispatcher" is defined as a program unit configured to determine whether the executable code of a called method is valid before calling the method. A gateway dispatcher may be part of a virtual machine or a lower level routine.
[0137] According to embodiments of the present invention, links to called routines may be hard-coded. According to alternative embodiments of the present invention, a dispatch table associated with a protection unit includes an entry for methods protected by the protection unit. A caller of a method in a protection unit calls the method by referring to the protection unit and an index in the table. The reference determines whether the executable code of a called method is valid (has been verified) before calling the method. A gateway dispatcher verifies the protection unit if the protection unit dispatch table has been loaded but the protection unit has not been verified. The gateway dispatcher loads the dispatch table and verifies the protection unit if the protection unit dispatch table has not been loaded. This is explained in more detail below with reference to FIGS. 43 and 44.
[0138] Turning now to FIG. 43, a block diagram that illustrates a smart card configured to ensure a called method has been verified prior to execution in accordance with one embodiment of the present invention is presented. Figure 43 illustrates a data stracture for implementing the "use program unit" process discussed previously with respect to reference numeral 4125 of FIG. 41. According to one embodiment of the present invention, entry points to a class or package are precomputed at load time. The entry points trigger a test to determine whether the method being called has been verified. Calls are linked to those entry points by rewriting code containing calls to the methods.
[0139] As shown in FIG. 43, there is a dispatch table entry for every callable routine in a protection unit. Each entry includes a check bit and a routine address. Once initialized, methods or routines within a protection unit can call each other. Methods that call outside a protection unit do so via a dispatch table (4300, 4305, 4310). If the check bit of the dispatch table entry corresponding to the called routine indicates a checked status, the routine address of the dispatch table entry is used to call the routine. If check bit indicates an unchecked status, verification of the code is performed. Storing the dispatch tables (4300, 4305, 4310) in an impersistent mutable memory such as a RAM 4345 and associating the value zero with an unchecked status guarantees the check bit indicates an unchecked status upon initialization. In other words, verification of program code is guaranteed to be session-based because the contents of RAM 4345 are destroyed after each session and the next session will start with the check bit indicating an unchecked status.
[0140] Having one check bit per entry allows the tables to be contiguous; referencing an entry requires just the base address of the table and an offset. Additionally, each entry includes a check bit because the corresponding routine may be the first routine within a protection unit to be called. [0141] According to one embodiment of the present invention, the check bit comprises the most significant bit and the method address comprises the least significant bits of a dispatch table entry. If the gateway dispatcher reads check bit value that indicates an unchecked status, the least-significant bits of the dispatch table entry are used to call the routine. This mechanism obviates the need for a second memory access to obtain the method address.
[0142] According to another embodiment of the present invention, each table has a per- table check bit that indicates whether the table has been validly initialized. Each table entry comprises a method address.
[0143] According to one embodiment of the present invention, protection units are per package. According to another embodiment of the present invention, protection units are per class. According to another embodiment of the present invention, protection units are per method.
[0144] According to another embodiment of the present invention, the program units protected by a protection unit corresponds with the program units included in a storage commitment fingeφrint. By way of example, if storage commitment fingeφrints are computed over methods in a class, protection units are per class. As a further example, if storage commitment fingeφrints are computed over classes in a package, protection units are per package.
[0145] The address of the next RAM-based dispatch table, as well as the current number and size of dispatch tables for other load units are examples of the type of information the card can provide for the link process mentioned above with respect to reference numeral 2110 of FIG. 21.
[0146] According to embodiments of the present invention, program code is rewritten to replace calls to routines outside a protection unit with calls to a gateway dispatcher. According to one embodiment of the present invention, the code is rewritten at conversion time, when a CAP file is created. According to another embodiment of the present invention, the code is rewritten at CAP file disassembly time. According to another embodiment of the present invention, the code is rewritten at load time, or at link time in the target smart card.
[0147] When a call is made to a routine outside a protection unit, it must be determined whether the called region is checked as well. The gateway dispatcher inspects the table that belongs to the called method to determine whether it may jump directly to the routine, or whether the called routine must be verified first. In the example illustrated in FIG. 43, a check bit value of zero is used to indicate an unchecked status. In this case, a value of zero may indicate the entry is corrupted. It may also indicate the entry is valid but that the code has not been verified. Thus, if the check bit has a value that indicates an unchecked status, the dispatch table template is obtained from a persistent mutable memory such as EEPROM, and the called routine is verified. This is shown in more detail below with reference to FIG. 44.
[0148] Turning now to FIG. 44, a flow diagram that illustrates a method for ensuring a called method has been verified prior to execution in accordance with one embodiment of the present invention is presented. Figure 44 presumes that program code has been rewritten such that calls between protection units have been replaced with calls to a gateway dispatcher. Figure 44 also presumes that a dispatch table template that points to the actual method for each of the entries is placed in EEPROM during the linking process. Figure 44 also presumes that upon reset or upon the first use of any entry in a dispatch table, the dispatch table template is copied to a preallocated space in an impersistent mutable memory such as RAM.
[0149] In the context of the present invention, a protection unit is collective if the unit of use is not the same as the unit of protection. By way of example, if the unit of use is a method and the unit of protection is a method, the protection unit is not collective. But if the unit of use is a method and the unit of protection is a class, the protection unit is collective.
[0150] Still referring to FIG. 44, at 4400 a determination is made regarding whether a calling method and a called method are within the same protection unit. This determination is made as part of the code rewriting process. If the two methods are within the same protection unit, the calling method calls the called method directly at 4405. If the two methods are not within the same protection unit, the code rewriting process replaces the call to the called routine (B) with a call to the gateway dispatcher. If the code has been rewritten in this way, at 4410 the calling method calls a gateway dispatcher. At 4415, the gateway dispatcher determines the dispatch table associated with the protection unit of the called method. At 4420, a determination is made regarding whether protection unit has been checked. If the protection unit has not been checked, it is checked at 4425. At 4430, the dispatch table corresponding to the protection unit is obtained from a persistent mutable memory such as EEPROM and loaded into an impersistent mutable memory such as RAM. At 4435, a determination is made regarding whether the protection unit is collective. If the protection unit is collective, at 4440 the check bits in the protection unit are made to indicate an unchecked status. Once the protection unit has been checked, at 4445 the dispatch table entry corresponding to the called method is examined. At 4450, a determination is made regarding whether the check bit of the table entry has a value that indicates a checked status. If the check bit has a value that indicates a checked status, at 4465 the called method is called using the address in the table entry. If the check bit value indicates an unchecked status, verification of the protection unit comprising the method is performed at 4455 and the check bit of methods in the protection unit are made to indicate a checked status at 4460. At 4465, the called method is called using the address in the table entry.
[0151] The illustration of embodiments of the present invention with respect to Java Card™ technology is for puφoses of illustration and is not intended to be limiting in any way. Any program file comprising program data may be used in place of a CAP file comprising structured program data. By way of example, an archive file such as a Java™ archive (JAR) file may be used. Additionally, any communication protocol that defines a protocol data unit may be used in place of the APDU protocol. Additionally, program data for programs written in languages other than the Java™ language may be used. Moreover, the target device need not be a smart card. The target device may be any device capable of receiving protocol data units and executing a program based at least in part on the received data.
[0152] While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art having the benefit of this disclosure that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims.

Claims

CLAIMS What is claimed is:
1. A system for communicating program data between a first device and a second device, the system comprising: a first device configured to: disassemble a first program file comprising program data into a first at least one logical data unit; partition each of said first at least one logical data unit into a first at least one protocol data unit, the format of said first at least one protocol data unit defined by a communication protocol and including a payload portion; compute a first fingeφrint over the payload portion of said first at least one protocol data unit of said first at least one logical data unit; and send a second program file comprising said program data and one or more members of the group comprising said first fingeφrint and a first authentication code based at least in part on said first fingeφrint; a second device configured to: receive said second program file and at least one of said group; disassemble said program data into a second at least one logical data unit; and partition each of said second at least one logical data unit into a second at least one protocol data unit; and a third device comprising a memory, said third device configured to: receive at least one of said group and said second at least one protocol data unit; compute a second fingeφrint over the payload portion of said second at least one protocol data unit; and commit said program to said memory based at least in part on whether said one or more members match said second fingeφrint or a second authentication code based at least in part on said second fingeφrint.
2. The system of claim 1 wherein said first device comprises a host computer; said second device comprises a loading terminal; and said third device comprises a smart card.
3. The system of claim 2 wherein said smart card comprises a Java Card™ technology- enabled smart card.
4. The system of claim 2 wherein said smart card comprises a CDMA (Code Division Multiple Access) technology-enabled smart card.
5. The system of claim 2 wherein said smart card comprises a SIM (Subscriber Identity Module) card.
6. The system of claim 2 wherein said smart card comprises a WIM (Wireless Interface Module).
7. The system of claim 2 wherein said smart card comprises a USIM (Universal Subscriber Identity Module).
8. The system of claim 2 wherein said smart card comprises a UIM (User Identity Module).
9. The system of claim 2 wherein said smart card comprises a R-UIM (Removable User Identity Module).
10. The system of claim 1 wherein said program data comprises a class file.
11. The system of claim 1 wherein said first program file comprises a JAR file; and said second program file comprises a JAR file.
12. The system of claim 1 wherein said first program file comprises a CAP file; and said second program file comprises a CAP file.
13. The system of claim 1 wherein said first authentication code further comprises at least one loading device authentication code for use by said second device in authenticating said second program file received from said first device.
14. The system of claim 1 wherein said first authentication code further comprises at least one target device authentication code for use by a third device in authenticating data received from said second device, said received data based at least in part on said first program file.
15. The system of claim 1 wherein said protocol comprises an application protocol data unit (APDU) protocol; and said protocol data units comprise application protocol data units (APDUs).
16. The system of claim 15 wherein said protocol further comprises using a trailer APDU to indicate a last APDU associated with a program unit.
17. The system of claim 15 wherein said protocol further comprises using a header APDU to indicate an expected sequence of one or more logical program APDUs to follow said header APDU.
18. The system of claim 1 wherein said first fingeφrint comprises a checksum; and said second fingeφrint comprises a checksum.
19. The system of claim 1 wherein said first fingeφrint comprises a cyclic redundancy code (CRC); and said second fingeφrint comprises a CRC.
20. The system of claim 1 wherein said first fingeφrint comprises a message digest; and said second fingeφrint comprises a message digest.
21. The system of claim 1 wherein said first fingeφrint comprises a keyed hash-based message authentication code
(HMAC); and said second fingeφrint comprises a HMAC.
22. A system for communicating program data between a first device and a second device, the system comprising: a first device configured to: disassemble a first program file comprising program data into at least one logical data unit; partition each of said at least one logical data unit into at least one protocol data unit, the format of said at least one protocol data unit defined by a communication protocol and including a payload portion; compute a first fingeφrint over the payload portion of the protocol data units of said at least one logical data unit; and send said protocol data units of said at least one logical data unit and one or more members of the group comprising said first fingeφrint and a first authentication code based at least in part on said first fingeφrint to said second device according to said protocol; and a second device comprising a memory, said second device configured to: receive at least one of said group and said protocol data units; compute a second fingeφrint over the payload portion of said protocol data units; and commit said program to said memory based at least in part on whether said one or more members match said second fingeφrint or a second authentication code based at least in part on said second fingeφrint.
23. The system of claim 22 wherein said second device comprises a smart card.
24. The system of claim 23 wherein said smart card comprises a Java Card™ technology-enabled smart card.
25. The system of claim 23 wherein said smart card comprises a CDMA (Code Division Multiple Access) technology-enabled smart card.
26. The system of claim 23 wherein said smart card comprises a SIM (Subscriber Identity Module) card.
27. The system of claim 23 wherein said smart card comprises a WIM (Wireless Interface Module).
28. The system of claim 23 wherein said smart card comprises a USIM (Universal Subscriber Identity Module).
29. The system of claim 23 wherein said smart card comprises a UIM (User Identity Module).
30. The system of claim 23 wherein said smart card comprises a R-UIM (Removable User Identity Module).
31. The system of claim 22 wherein said program data comprises a class file.
32. The system of claim 22 wherein said program file comprises a JAR file.
33. The system of claim 22 wherein said program file comprises a CAP file.
34. The system of claim 22 wherein said protocol comprises an application protocol data unit (APDU) protocol; and said protocol data units comprise application protocol data units (APDUs).
35. The system of claim 34 wherein said protocol further comprises using a trailer APDU to indicate a last APDU associated with a program unit.
36. The system of claim 34 wherein said protocol further comprises using a header APDU to indicate an expected sequence of one or more logical program APDUs to follow said header APDU.
37. The system of claim 22 wherein said first fingeφrint comprises a checksum; and said second fingeφrint comprises a checksum.
38. The system of claim 22 wherein said first fingeφrint comprises a cyclic redundancy code (CRC); and said second fmgeφrint comprises a CRC.
39. The system of claim 22 wherein said first fingeφrint comprises a message digest; and said second fingeφrint comprises a message digest.
40. The system of claim 22 wherein said first fingeφrint comprises a keyed hash-based message authentication code
(HMAC); and said second fingeφrint comprises a HMAC.
41. A system for communicating program data between a first device and a second device, the system comprising: a first device configured to: disassemble a first program file comprising program data into a first at least one logical data unit; partition each of said first at least one logical data unit into a first at least one protocol data unit, the format of said first at least one protocol data unit defined by a communication protocol and including a payload portion, the order of protocol data units within said first at least one protocol data unit determined according to a predetermined order; compute a first fingeφrint over the payload portion of said first at least one protocol data unit of said first at least one logical data unit; and send a second program file comprising said program data and one or more members of the group comprising said first fingeφrint and a first authentication code based at least in part on said first fingeφrint; a second device configured to: receive said second program file and at least one of said group; disassemble said program data into a second at least one logical data unit; and partition each of said at second least one logical data unit into a second at least one protocol data unit, the order of protocol data units within said second at least one protocol data unit identical to the order of protocol data units within said first at least one protocol data unit, the content of said first at least one protocol data unit identical to the content of said second at least one protocol data unit; and a third device comprising a memory, said third device configured to: receive said one or more members and said second at least one protocol data unit; compute a second fingeφrint over the payload portion of said second at least one protocol data unit; and con-αnit said program to said memory based at least in part on whether said one or more members match said second fingeφrint or a second authentication code based at least in part on said second fingeφrint.
42. The system of claim 41 wherein said first device comprises a host computer; said second device comprises a loading terminal; and said third device comprises a smart card.
43. The system of claim 42 wherein said smart card comprises a Java Card™ technology-enabled smart card.
44. The system of claim 42 wherein said smart card comprises a CDMA (Code Division Multiple Access) technology-enabled smart card.
45. The system of claim 42 wherein said smart card comprises a SIM (Subscriber Identity Module) card.
46. The system of claim 42 wherein said smart card comprises a WIM (Wireless Interface Module).
47. The system of claim 42 wherein said smart card comprises a USIM (Universal Subscriber Identity Module).
48. The system of claim 42 wherein said smart card comprises a UIM (User Identity Module).
49. The system of claim 42 wherein said smart card comprises a R-UIM (Removable User Identity Module).
50. The system of claim 41 wherein said program data comprises a class file.
51. The system of claim 41 wherein said program file comprises a JAR file.
52. The system of claim 41 wherein said program file comprises a CAP file.
53. The system of claim 41 wherein said first authentication code further comprises at least one loading device authentication code for use by said second device in authenticating said second program file received from said first device.
54. The system of claim 41 wherein said first authentication code further comprises at least one target device authentication code for use by a third device in authenticating data received from said second device, said received data based at least in part on said first program file.
55. The system of claim 41 wherein said protocol comprises an application protocol data unit (APDU) protocol; and said protocol data units comprise application protocol data units (APDUs).
56. The system of claim 55 wherein said protocol further comprises using a trailer APDU to indicate a last APDU associated with a program unit.
57. The system of claim 55 wherein said protocol further comprises using a header APDU to indicate an expected sequence of one or more logical program APDUs to follow said header APDU.
58. The system of claim 41 wherein said first fingeφrint comprises a checksum; and said second fingeφrint comprises a checksum.
59. The system of claim 41 wherein said first fingeφrint comprises a cyclic redundancy code (CRC); and said second fingeφrint comprises a CRC.
60. The system of claim 41 wherein said first fingeφrint comprises a message digest; and said second fingeφrint comprises a message digest.
61. The system of claim 41 wherein said first fingeφrint comprises a keyed hash-based message authentication code
(HMAC); and said second fϊngeφrint comprises a HMAC.
PCT/US2004/001049 2003-01-16 2004-01-14 System for communicating program data between a first device and a second device WO2004066129A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/346,581 2003-01-16
US10/346,581 US7484095B2 (en) 2003-01-16 2003-01-16 System for communicating program data between a first device and a second device

Publications (2)

Publication Number Publication Date
WO2004066129A2 true WO2004066129A2 (en) 2004-08-05
WO2004066129A3 WO2004066129A3 (en) 2005-03-24

Family

ID=32712182

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2004/001049 WO2004066129A2 (en) 2003-01-16 2004-01-14 System for communicating program data between a first device and a second device

Country Status (2)

Country Link
US (1) US7484095B2 (en)
WO (1) WO2004066129A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106162602A (en) * 2014-08-14 2016-11-23 三星电子株式会社 The method and apparatus downloaded for the configuration file of group device

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07271865A (en) 1994-04-01 1995-10-20 Mitsubishi Corp Method for managing copyright of data base
US7302415B1 (en) 1994-09-30 2007-11-27 Intarsia Llc Data copyright management system
US6424715B1 (en) 1994-10-27 2002-07-23 Mitsubishi Corporation Digital content management system and apparatus
DE69532434T2 (en) 1994-10-27 2004-11-11 Mitsubishi Corp. Device for file copyright management system
US8595502B2 (en) * 1995-09-29 2013-11-26 Intarsia Software Llc Data management system
US8121955B2 (en) * 2003-01-16 2012-02-21 Oracle America, Inc. Signing program data payload sequence in program loading
DE10357257A1 (en) * 2003-12-08 2005-06-30 Giesecke & Devrient Gmbh Java smart card chip with memory area reserved for global variables
US7644416B2 (en) * 2005-02-10 2010-01-05 Google Inc. Access to a target object with desired functionality
EP1736881A1 (en) * 2005-06-15 2006-12-27 Research In Motion Limited Controlling collection of debugging data
US7559055B2 (en) * 2005-06-15 2009-07-07 Research In Motion Limited Controlling collection of debugging data
US20070033291A1 (en) * 2005-07-22 2007-02-08 Axalto Inc. System and method for support of legacy communications protocols in a smart card
US8032872B2 (en) * 2006-01-09 2011-10-04 Oracle America, Inc. Supporting applets on a high end platform
EP1928152B1 (en) * 2006-11-30 2013-05-29 Cassis International PTE Ltd. Process of communication between a device running Java ME and a server over the air with APDU under SOAP messages from/to an operator on a host, related system
US9158920B2 (en) * 2007-06-28 2015-10-13 Intel Corporation System and method for out-of-band assisted biometric secure boot
ITMI20080536A1 (en) * 2008-03-28 2009-09-29 Incard Sa METHOD TO PROTECT A CAP FILE FOR AN INTEGRATED CIRCUIT CARD.
EP2182696A1 (en) * 2008-10-31 2010-05-05 Gemalto SA Method of establishing a link between the applications of a subscriber authentication card and an IMS network
US8549477B2 (en) * 2009-10-27 2013-10-01 Oracle International Corporation Mapping usage patterns using code features
US9635549B2 (en) 2011-09-01 2017-04-25 Nokia Technologies Oy Providing subscriber identity module function
US9288102B2 (en) 2013-02-18 2016-03-15 Microsoft Technology Licensing, Llc Controlling devices using cloud services and device-agnostic pipe mechanisms
CN110389935B (en) * 2019-07-25 2021-04-16 上海连尚网络科技有限公司 Method, equipment and computer storage medium for starting small program
CN110389936B (en) * 2019-07-25 2021-05-14 上海连尚网络科技有限公司 Method, equipment and computer storage medium for starting small program

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6005942A (en) * 1997-03-24 1999-12-21 Visa International Service Association System and method for a multi-application smart card which can facilitate a post-issuance download of an application onto the smart card
EP1022638A2 (en) * 1999-01-12 2000-07-26 International Business Machines Corporation Method and system for securely handling information between two information processing devices
WO2003003694A2 (en) * 2001-06-26 2003-01-09 Versada Networks, Inc. Detecting and transporting dynamic presence information over a wireless and wireline communications network

Family Cites Families (79)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US691587A (en) * 1900-07-12 1902-01-21 Charles Berst Punching-register.
US691664A (en) * 1900-11-02 1902-01-21 Georg Ritter Telephone system.
US5067162A (en) * 1986-06-30 1991-11-19 Identix Incorporated Method and apparatus for verifying identity using image correlation
US5421016A (en) * 1991-12-12 1995-05-30 International Business Machines Corporation System and method for dynamically invoking object methods from an application designed for static method invocation
US6131159A (en) * 1992-05-08 2000-10-10 Paradyne Corporation System for downloading programs
EP0757336B1 (en) * 1995-08-04 2000-11-22 Belle Gate Investment B.V. Data exchange systems comprising portable data processing units
ATE152539T1 (en) * 1994-02-08 1997-05-15 Belle Gate Invest Bv DATA EXCHANGE SYSTEM WITH PORTABLE DATA PROCESSING UNITS
US6006033A (en) * 1994-08-15 1999-12-21 International Business Machines Corporation Method and system for reordering the instructions of a computer program to optimize its execution
US5748964A (en) * 1994-12-20 1998-05-05 Sun Microsystems, Inc. Bytecode program interpreter apparatus and method with pre-verification of data type restrictions
US6948070B1 (en) * 1995-02-13 2005-09-20 Intertrust Technologies Corporation Systems and methods for secure transaction management and electronic rights protection
US5764991A (en) 1995-06-30 1998-06-09 Canon Kabushiki Kaisha Processing object oriented code and virtual function code
DE69503374T2 (en) * 1995-08-28 1999-04-15 Ofra Feldbau Setup and method for authenticating the sending and content of a document
US5721781A (en) * 1995-09-13 1998-02-24 Microsoft Corporation Authentication system and method for smart card transactions
US5812662A (en) * 1995-12-18 1998-09-22 United Microelectronics Corporation Method and apparatus to protect computer software
US5930509A (en) * 1996-01-29 1999-07-27 Digital Equipment Corporation Method and apparatus for performing binary translation
US5889999A (en) * 1996-05-15 1999-03-30 Motorola, Inc. Method and apparatus for sequencing computer instruction execution in a data processing system
WO1997045817A1 (en) 1996-05-24 1997-12-04 Eduard Karel De Jong System with and method of cryptographically protecting communications
US5781723A (en) * 1996-06-03 1998-07-14 Microsoft Corporation System and method for self-identifying a portable information device to a computing unit
US5761513A (en) * 1996-07-01 1998-06-02 Sun Microsystems, Inc. System and method for exception handling in dynamically linked programs
US6463581B1 (en) * 1996-10-03 2002-10-08 International Business Machines Corporation Method for determining reachable methods in object-oriented applications that use class libraries
CN1183449C (en) * 1996-10-25 2005-01-05 施卢默格系统公司 using a high level programming language with a microcontroller
US6202060B1 (en) * 1996-10-29 2001-03-13 Bao Q. Tran Data management system
US6367012B1 (en) * 1996-12-06 2002-04-02 Microsoft Corporation Embedding certifications in executable files for network transmission
US6802061B1 (en) * 1996-12-12 2004-10-05 Microsoft Corporation Automatic software downloading from a computer network
US6081800A (en) * 1997-02-28 2000-06-27 Oracle Corporation Creating bitmaps from multi-level identifiers
US6141681A (en) * 1997-03-07 2000-10-31 Advanced Micro Devices, Inc. Method of and apparatus for transferring and interpreting a data package
US5950009A (en) * 1997-03-10 1999-09-07 International Business Machines Coporation Method and apparatus for profile-based reordering of program portions in a computer program
US6092147A (en) * 1997-04-15 2000-07-18 Sun Microsystems, Inc. Virtual machine with securely distributed bytecode verification
US5910988A (en) * 1997-08-27 1999-06-08 Csp Holdings, Inc. Remote image capture with centralized processing and storage
US6314562B1 (en) * 1997-09-12 2001-11-06 Microsoft Corporation Method and system for anticipatory optimization of computer programs
US6233733B1 (en) * 1997-09-30 2001-05-15 Sun Microsystems, Inc. Method for generating a Java bytecode data flow graph
US5991774A (en) * 1997-12-22 1999-11-23 Schneider Automation Inc. Method for identifying the validity of an executable file description by appending the checksum and the version ID of the file to an end thereof
US5999732A (en) * 1998-03-23 1999-12-07 Sun Microsystems, Inc. Techniques for reducing the cost of dynamic class initialization checks in compiled code
US6400836B2 (en) * 1998-05-15 2002-06-04 International Business Machines Corporation Combined fingerprint acquisition and control device
US6332218B1 (en) 1998-06-30 2001-12-18 Sun Microsystems, Inc. System and method for automatically instantiating classes in a virtual machine
US6574618B2 (en) * 1998-07-22 2003-06-03 Appstream, Inc. Method and system for executing network streamed application
US6205465B1 (en) * 1998-07-22 2001-03-20 Cisco Technology, Inc. Component extensible parallel execution of multiple threads assembled from program components specified with partial inter-component sequence information
GB2341249A (en) * 1998-08-17 2000-03-08 Connected Place Limited A method of generating a difference file defining differences between an updated file and a base file
US6161217A (en) * 1998-09-14 2000-12-12 Sun Microsystems, Inc. Accurate method for inlining virtual calls
US6223340B1 (en) * 1998-10-09 2001-04-24 Sun Microsystems, Inc. Method for directly inlining virtual calls without on-stack replacement
US6481632B2 (en) * 1998-10-27 2002-11-19 Visa International Service Association Delegated management of smart card applications
WO2000034896A1 (en) * 1998-12-04 2000-06-15 Technology Enabling Company, Llc Systems and methods for organizing data
US6272674B1 (en) * 1998-12-14 2001-08-07 Nortel Networks Limited Method and apparatus for loading a Java application program
US6961664B2 (en) 1999-01-19 2005-11-01 Maxygen Methods of populating data structures for use in evolutionary simulations
US6880155B2 (en) * 1999-02-02 2005-04-12 Sun Microsystems, Inc. Token-based linking
US20010037454A1 (en) 2000-05-01 2001-11-01 Botti John T. Computer networked system and method of digital file management and authentication
US6526571B1 (en) * 1999-03-16 2003-02-25 International Business Machines Corporation Method for identifying calls in java packages whose targets are guaranteed to belong to the same package
US6721891B1 (en) * 1999-03-29 2004-04-13 Activcard Ireland Limited Method of distributing piracy protected computer software
FI114434B (en) 1999-05-11 2004-10-15 Nokia Corp communication equipment
US6487714B1 (en) * 1999-05-24 2002-11-26 International Business Machines Corporation Mechanism for dynamic selection of an object's method
US6507946B2 (en) * 1999-06-11 2003-01-14 International Business Machines Corporation Process and system for Java virtual method invocation
US7430670B1 (en) * 1999-07-29 2008-09-30 Intertrust Technologies Corp. Software self-defense systems and methods
US7366702B2 (en) * 1999-07-30 2008-04-29 Ipass Inc. System and method for secure network purchasing
US6981212B1 (en) * 1999-09-30 2005-12-27 International Business Machines Corporation Extensible markup language (XML) server pages having custom document object model (DOM) tags
DE19947986A1 (en) * 1999-10-05 2001-04-12 Ibm Method of downloading of application parts via distributed systems on to a chip-card, requires provision of secret code or session key by the server prior to loading command-sequence of commands for downloading
US6792536B1 (en) * 1999-10-20 2004-09-14 Timecertain Llc Smart card system and methods for proving dates in digital files
US6595856B1 (en) 2000-01-04 2003-07-22 Sigma Game, Inc. Electronic security technique for gaming software
US6643652B2 (en) * 2000-01-14 2003-11-04 Saba Software, Inc. Method and apparatus for managing data exchange among systems in a network
US6733446B2 (en) * 2000-01-21 2004-05-11 Medtronic Minimed, Inc. Ambulatory medical apparatus and method using a telemetry system with predefined reception listening periods
FR2805059A1 (en) * 2000-02-10 2001-08-17 Bull Cp8 METHOD FOR LOADING A SOFTWARE PART IN A CHIP CARD, PARTICULARLY OF THE TYPE SAID "APPLET"
US6895581B1 (en) * 2000-03-30 2005-05-17 Microsoft Corporation Replaceable classes and virtual constructors for object-oriented programming languages
JP2004514194A (en) * 2000-04-28 2004-05-13 モルドフロウ コーポレイション Networkable application software system and method
FR2809200B1 (en) * 2000-05-17 2003-01-24 Bull Cp8 METHOD FOR SECURING A LANGUAGE OF THE TYPE TYPE, IN PARTICULAR IN AN ON-BOARD SYSTEM AND ON-BOARD SYSTEM FOR IMPLEMENTING THE METHOD
US6880086B2 (en) * 2000-05-20 2005-04-12 Ciena Corporation Signatures for facilitating hot upgrades of modular software components
AU7182701A (en) * 2000-07-06 2002-01-21 David Paul Felsher Information record infrastructure, system and method
US20030028811A1 (en) * 2000-07-12 2003-02-06 Walker John David Method, apparatus and system for authenticating fingerprints, and communicating and processing commands and information based on the fingerprint authentication
JP3707727B2 (en) * 2000-10-30 2005-10-19 インターナショナル・ビジネス・マシーンズ・コーポレーション Program optimization method and compiler using the same
US6985956B2 (en) * 2000-11-02 2006-01-10 Sun Microsystems, Inc. Switching system
US7506175B2 (en) * 2000-11-06 2009-03-17 International Business Machines Corporation File language verification
US6807561B2 (en) * 2000-12-21 2004-10-19 Gemplus Generic communication filters for distributed applications
US20020147918A1 (en) * 2001-04-05 2002-10-10 Osthoff Harro R. System and method for securing information in memory
US7263597B2 (en) 2001-04-19 2007-08-28 Ciena Corporation Network device including dedicated resources control plane
US6836884B1 (en) * 2001-06-04 2004-12-28 Microsoft Corporation Method and system for editing software programs
US6828960B2 (en) * 2001-09-28 2004-12-07 Hewlett-Packard Development Company, L.P. Electronic writing instrument with fingerprint scanner
US20030095690A1 (en) * 2001-11-16 2003-05-22 Acer Inc. Wireless fingerprint identity apparatus and method
US6865659B2 (en) * 2002-06-07 2005-03-08 Sun Microsystems, Inc. Using short references to access program elements in a large address space
US20040083469A1 (en) * 2002-10-23 2004-04-29 Ping-Sheng Chen Method for updating firmware of optical disk system
US20040088562A1 (en) * 2002-10-31 2004-05-06 Schlumberger Malco, Inc. Authentication framework for smart cards
US8121955B2 (en) * 2003-01-16 2012-02-21 Oracle America, Inc. Signing program data payload sequence in program loading

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6005942A (en) * 1997-03-24 1999-12-21 Visa International Service Association System and method for a multi-application smart card which can facilitate a post-issuance download of an application onto the smart card
EP1022638A2 (en) * 1999-01-12 2000-07-26 International Business Machines Corporation Method and system for securely handling information between two information processing devices
WO2003003694A2 (en) * 2001-06-26 2003-01-09 Versada Networks, Inc. Detecting and transporting dynamic presence information over a wireless and wireline communications network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHIQUN CHEN: "Technology for Smart Cards: Architecture and Programmer's Guide" [Online] 6 June 2000 (2000-06-06), ADDISON WESLEY , XP002305506 Retrieved from the Internet: URL:http://java.sun.com/developer/Books/co nsumerproducts/javacard/ch03.pdf> [retrieved on 2004-11-15] paragraphs [03.4], [3.10.3] *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106162602A (en) * 2014-08-14 2016-11-23 三星电子株式会社 The method and apparatus downloaded for the configuration file of group device
CN106162602B (en) * 2014-08-14 2020-11-10 三星电子株式会社 Method and device for downloading configuration file of group device

Also Published As

Publication number Publication date
US7484095B2 (en) 2009-01-27
US20040143641A1 (en) 2004-07-22
WO2004066129A3 (en) 2005-03-24

Similar Documents

Publication Publication Date Title
US7272830B2 (en) Ordering program data for loading on a device
US8473417B2 (en) Signing program data payload sequence in program loading
US7484095B2 (en) System for communicating program data between a first device and a second device
US6640279B2 (en) Virtual machine with securely distributed bytecode verification
JP4303284B2 (en) Method for issuing command to security element and mobile terminal
US7850066B2 (en) Smartcard system
US6981245B1 (en) Populating binary compatible resource-constrained devices with content verified using API definitions
US20040199787A1 (en) Card device resource access control
US8943486B2 (en) Multiple instruction execution mode resource-constrained device
US20040143739A1 (en) Run time code integrity checks
US7165246B2 (en) Optimized representation of data type information in program verification
US7281244B2 (en) Using a digital fingerprint to commit loaded data in a device
US7222331B2 (en) Linking of virtual methods
EP2009565A1 (en) Method for securely loading a client applet in an electronic portable device
CN109583175B (en) Method and apparatus for smart card OS diversification system for security authentication
US20230236815A1 (en) Hiding and unhiding java card applet instances
AU2001290842B2 (en) Remote incremental program binary compatibility verification using API definitions
Jang Secure Object Sharing on Java Card
MXPA99003796A (en) Using a high level programming language with a microcontroller

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase