Methods and systems for providing data objects on a token

Information

  • Patent Grant
  • 8180741
  • Patent Number
    8,180,741
  • Date Filed
    Tuesday, June 6, 2006
    18 years ago
  • Date Issued
    Tuesday, May 15, 2012
    12 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Lovel; Kimberly
    • Uddin; Mohammed R
    Agents
    • Lowenstein Sandler PC
Abstract
A computer system, method and/or computer-readable medium provide independent data objects to a token in compressed form. The independent data objects are representative of security information associated with the token. The system includes an interface operable to communicate with a token, and a processor cooperatively operable with the interface. The processor is configured to determine a set of independent data objects that are associated with the token, and to aggregate the set of independent data objects associated with the token into a group. Also, the processor is configured for compressing the group into a unit of contiguous data, and writing the unit of contiguous data to the token via the interface.
Description
FIELD OF THE INVENTION

The present invention relates in general to data stored on a token, and more specifically to data stored in a memory of a token utilizing data compression.


BACKGROUND OF THE INVENTION

Security information such as digital certificates, keys, identifiers, and related data can be stored in a token, for example a smartcard, security token, USB (universal serial bus) token or the like. The security information stored in the token can be utilized in connection with communications to provide a greater degree of security.


Initialization involving a token typically includes accessing at least some of the security information stored on the token. Reading from or writing to a token, however, can be unacceptably slow. Despite the relatively long access times, it can be prudent to rely on the token to provide security.


In addition, a token tends to have a limited memory capacity. A maximum memory capacity of, for example, 32K is not uncommon. Higher capacity tokens tend to be more expensive and therefore less desirable. Consequently, the amount of memory occupied by stored instructions and data can be a constraint in designing an application using a token.


SUMMARY OF THE INVENTION

Accordingly, one or more embodiments relate generally to a computer system, method and/or computer-readable medium that provides independent data objects to a token in compressed form. The independent data objects are representative of security information associated with the token. The system includes an interface operable to communicate with a token, and a processor cooperatively operable with the interface. The processor is configured to determine a set of independent data objects that are associated with the token, and to aggregate the set of independent data objects associated with the token into a group. Also, the processor is configured for compressing the group into a unit of contiguous data, and writing the unit of contiguous data to the token via the interface.


Embodiments also provide a device, method, and/or computer-readable medium for providing independent data objects to a token, wherein the independent data objects are representative of security information associated with the token. A set of independent data objects that are associated with a token is determined. The set of independent data objects are aggregated into a group. The group is compressed into a unit of contiguous data. The unit of contiguous data is written to the token.


Other embodiments also provide a device, method and/or computer-readable medium for reading individual data objects that are representative of security information associated with the token and stored on a token together in compressed form. A contiguous unit of compressed data is read from the token. The contiguous unit of compressed data is decompressed to form decompressed data. The independent data objects are extracted from the decompressed data.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate various exemplary embodiments of the invention and together with the description, serve to explain the principles of the invention. In the figures:



FIG. 1 illustrates a simplified and representative environment associated with a computer system;



FIG. 2 is a block diagram illustrating portions of a computer;



FIG. 3 is a block diagram illustrating portions of a computer and a token;



FIG. 4 is a flow chart illustrating a procedure for providing data objects to a token;



FIG. 5 is a flow chart illustrating a procedure for a timely update of token data; and



FIG. 6 is a flow chart illustrating a procedure for reading individual data objects stored on a token.





DETAILED DESCRIPTION

In overview, the present disclosure concerns secure systems such as may be operated in connection with certifying and/or authenticating identifiers associated with users and/or computers and/or tokens. Such secure systems may be utilized in connection with other services such as communications, secured access, and/or telecommunications. Such secure systems can include computer systems which support the use of tokens to access independent data objects representing certificates, keys, identifiers, and related data, for example by providing end-user interfaces, managing keys, and providing authentication. More particularly, various inventive concepts and principles are embodied in systems, devices, and methods therein for reading and/or writing independent data objects to/from a token.


The instant disclosure is provided to further explain in an enabling fashion the best modes of performing one or more embodiments of the present invention. The disclosure is further offered to enhance an understanding and appreciation for the inventive principles and advantages thereof, rather than to limit in any manner the invention. The invention is defined solely by the appended claims including any amendments made during the pendency of this application and all equivalents of those claims as issued.


It is further understood that the use of relational terms such as first and second, and the like, if any, are used solely to distinguish one from another entity, item, or action without necessarily requiring or implying any actual such relationship or order between such entities, items or actions. It is noted that some embodiments may include a plurality of processes or steps, which can be performed in any order, unless expressly and necessarily limited to a particular order; i.e., processes or steps that are not so limited may be performed in any order.


Much of the inventive functionality and many of the inventive principles when implemented, are best supported with or in software or integrated circuits (ICs), such as a digital signal processor and software therefore, and/or application specific ICs. It is expected that one of ordinary skill, notwithstanding possibly significant effort and many design choices motivated by, for example, available time, current technology, and economic considerations, when guided by the concepts and principles disclosed herein will be readily capable of generating such software instructions or ICs with minimal experimentation. Therefore, in the interest of brevity and minimization of any risk of obscuring the principles and concepts according to the present invention, further discussion of such software and ICs, if any, will be limited to the essentials with respect to the principles and concepts used by the exemplary embodiments.


As further discussed herein below, various inventive principles and combinations thereof are advantageously employed to make an efficient use of storage space on a token. Furthermore, the amount of time expended in initializing with the token can be reduced.


Further in accordance with exemplary embodiments, a computer system, such as a server acting as a registration authority, can compress and place independent data objects onto a token. Also, a computer system, such as a client interfacing with a user, can retrieve such compressed data objects from the token. Rather than compressing data objects individually, the data objects are aggregated into one space, and the space as a whole is compressed.


The phrase “data objects” as used herein refers to information representing certificates, public keys, standard cryptographic token interface data (such as according to PKCS (public key cryptography standard) #11), identifiers, and related data. This information is conventionally stored somewhere on the token.


Reference will now be made in detail to the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.


Referring now to FIG. 1, a simplified and representative environment associated with a computer system will be discussed and described. The environment includes a client 101, a token 103, and a server 107. The server 107 and client 101 are connected via a connection 105. The server 107 can have access to information stored locally at the server 107, and to information stored remotely, here represented by data system A 109 and data system B 111.


The server 107 may be a computing machine or platform configured to execute secure and/or unsecure (or open) applications through a multiple-user operating system (not shown) in conjunction with the client 101. The server 107 may be implemented using one or a combination of server platforms as known to those skilled in the art from Intel, Advanced Micro Devices, Hewlett-Packard, and/or others.


The server 107 may interact with the client 101 over the connection 105, for example a communication network. The connection 105 provides a communication channel for the server 107 and the client 101 to exchange data and commands, as well as for the server 107 to interface to the token 103.


The client 101 can be a computing machine or platform (machine) configured to execute secure and/or open applications through the multi-user operating system. The client 101 may be implemented on a personal computer, a workstation, a thin client, a thick client, or other similar computing platform. The client 101 may be configured to interface with the token 103. The client 101, the token 103 and the server 107 can be configured in accordance with known techniques so that the server 103 can connect to the token 103 transparently through the client 101. In accordance with known techniques, the connection 105 can be a secure connection.



FIG. 2 illustrates an example computer that can be utilized as the server 107. FIG. 3 utilizes an example computer and token that can be conveniently used as the client 101 and token 103.


Referring now to FIG. 2, a block diagram illustrating portions of a computer 201 will be discussed and described. The computer 201 may include an interface 207 and one or more controllers 203. The controller 203 can include a processor 205 and a memory 209. Also, the computer 201 can include optional peripherals such as a display (not illustrated) and/or various known input devices (not illustrated), such as a keypad, a computer mouse, a touchpad, a touch screen, a trackball, and/or a keyboard.


The processor 205 may comprise one or more microprocessors and/or one or more digital signal processors. The memory 209 may be coupled to the processor 205 and may comprise a read-only memory (ROM), a random-access memory (RAM), a programmable ROM (PROM), a flash memory, and/or an electrically erasable read-only memory (EEPROM). The memory 209 may include multiple memory locations for storing, among other things, an operating system, data and variables 211 for programs executed by the processor 205; computer programs for causing the processor to operate in connection with various functions such as aggregating data objects corresponding to the token into a group 213, compressing the group into a unit of contiguous data 215, connecting to the token 217, writing a unit of data to the token 219, updating the unit and changing the version number of the unit 221, retrieving data objects 223, determining a set of data objects associated with the token 225, and/or other processing; a location for a group of data objects 227; a location for a unit of contiguous data 229; and a location for miscellaneous other data 231 by the processor 205. The computer programs may be stored, for example, in ROM or PROM and may direct the processor 205 in controlling the operation of the computer 201.


The processor 205 may be programmed for aggregating a set of data objects corresponding to the token into a group 213. To achieve an efficient data compression, the group of data objects is structured so that the data objects are located in contiguous memory. More particularly, the data objects within the group can be contiguously located in the memory, although it is also envisioned that the data objects in the group can be formatted so there is empty information between data objects which does not increase the size of the compressed data. Therefore, compression can be performed on the group of data objects as a unit, rather than on individual data objects. The location of particular data objects within the group of data objects can be specified by a predetermined format, which also can be utilized to extract the data objects when the data is de-compressed. Accordingly, one or more embodiments provide that the independent data objects in the set are aggregated in the group according to a predetermined format.


The processor 205 can be programmed for compressing the group to form a unit of contiguous data 215. Any known compression technique can be utilized to compress the group, provided that the group of data is compressed rather than compressing individual data objects separately.


Also, the processor 205 can be programmed for connecting 217 to the token (not illustrated) via the interface 207. Known techniques can be utilized to establish and maintain a connection. Such a connection optionally can be a secure connection, for example utilizing cryptographic techniques. The token can be connected locally or remotely to the interface 207. If the token is located remotely, the connection can be end-to-end between the interface 207 and the token through an intermediate computer (not illustrated), such as discussed in connection with FIG. 3. Accordingly, the writing of the data to the token can be performed remotely via a secure connection over the interface.


Optionally, the processor 205 can be programmed for writing a unit of data to the token (not illustrated) 219. Techniques are known for writing data to tokens, when the computer 201 is connected to the token. For example, when the computer 201 and token are remotely connected via an intermediate computer (not illustrated), the token can be written in a manner transparent to the intermediate computer such as via a tunnel connection.


Optionally, the processor 205 can be programmed for updating the unit of contiguous data and/or changing the version number of the unit 221. One or more independent data objects can be modified, for example, when a user alters a certificate. Therefore, it can be desirable to update the unit of contiguous data. Various techniques can be utilized to determine that the unit is ready for updating, for example, checking whether any independent data object has been changed, flagging the unit when an independent data object was changed, expiration of a time limit, or the like. The unit of contiguous data can be updated, for example by retrieving, into the unit, the independent data objects related to the token corresponding to the unit; or by retrieving, into the unit, independent data objects known to have been modified. A version number can be associated with the unit of contiguous data and/or the group of data. The version number can be changed, for example, incremented or toggled, so that revised versions for the same token can be distinguished. The version number can be stored in the group of data, stored in the contiguous data (and compressed), stored in the compressed contiguous data, and/or stored separately. Accordingly, one or more embodiments provide for associating a version number with the unit written to the token, and writing the version number to the token in association with the unit, wherein the version number is changed when the unit for the token is changed.


Additionally, the processor 205 can be programmed for retrieving independent data objects 223. The independent data objects can be in various locations, for example located locally at the computer 201 and/or remotely (for example in data systems illustrated in FIG. 1). The processor can have information indicating the locations of the independent data objects, for example, a table of pointers and/or unique identifiers. The independent data objects can be retrieved from the locations. The term “independent” is used herein to indicate that a particular data object is not adjacent in memory to at least one other data object to be included in the set of independent data objects that is to be compressed. In some instances, independent data objects may be provided in different data structures, different databases, and/or in different memory devices. Accordingly, one or more embodiments provide for retrieving at least a portion of the set of independent data objects from non-contiguous locations in memory before the aggregating.


Further, the processor 205 can be programmed for determining a set of data objects associated with the token 225. The data objects that are associated with the token can include data objects specific to the token (such as PKCS #11 data and certificates), and/or data objects which are common to other tokens (such as public keys). The processor 205 can include one or more maps, tables, arrays and/or other storage structure(s) indicating data objects that are associated with tokens.


A portion of the memory 209 can be allocated for the group of data objects 227, and for the unit of contiguous data 229. Optionally, the group of data objects 227 and/or unit of contiguous data 229 can be for stored for each of multiple tokens.


Therefore, according to one or more embodiments, a computer system provides independent data objects to a token in compressed form, wherein the independent data objects are representative of security information associated with the token. The computer system includes an interface operable to communicate with a token; and a processor cooperatively operable with the interface. The processor is configured to determine a set of independent data objects that are associated with the token, aggregating the set of independent data objects associated with the token into a group, compressing the group into a unit of contiguous data, and writing the unit of contiguous data to the token via the interface.


It should be understood that various logical groupings of functional blocks are described herein. Different realizations may omit one or more of these, logical groupings. Likewise, in various realizations, functional blocks may be grouped differently, combined, or augmented. Furthermore, one or more functional blocks including those identified herein as optional can be omitted from various realizations. For example, the present description may describe or suggest a database or collection of data and information. One or more embodiments can provide that the database or collection of data and information can be distributed, combined, or augmented, or provided locally and/or remotely (illustrated in FIG. 1).


Referring now to FIG. 3, a block diagram illustrating portions of a computer 301 and a token 313 will be discussed and described. A description of the computer 301 is provided first, followed by a description of the token 313.


The computer 301 may include one or more controllers 303, and one or more interfaces, here represented by an interface A 307 and an interface B 309. The interface A 307 can be utilized in connection with a communication network, for example to connect to another computer. The interface B 309 can be utilized to connect to the token 313, for example utilizing known USB (universal serial bus) technology, a smart card reader, or the like. The computer 301 can include optional known peripherals for interfacing with a user, such as a display and input devices (not illustrated). The controller 303 can include a processor 305 and a memory 311. The processor 305 in the computer 301 may comprise one or more microprocessors and/or one or more digital signal processors; the memory 311 can be coupled to the processor 305 and may comprise a ROM, a RAM, a PROM, flash memory, and/or an EEPROM. The memory 311 may include multiple memory locations and stores an operating system, data and variables 325; computer programs including those discussed below which can direct the processor 305 in controlling the operation of the computer 301; a location for a unit of compressed data from the token 335; and a location for decompressed data from the token 337. The computer programs can include, for example, reading a unit of compressed data from the token 327, decompressing the unit of compressed data from the token 329, extracting data objects from the decompressed data 331, optionally checking the version of the compressed data on the token 333, and/or other processing. These are described in more detail below.


The computer 301 can be programmed to read a contiguous unit of compressed data from the token 327. For example, when the token 313 is connected to the computer 301 via the interface B 309, known techniques can be utilized to connect to and read data from the token. One or more particular blocks in the token 313 which are pre-defined for storing the compressed data can be read. In this example, the compressed data is read from the token into a location in the memory 311 of the computer 301 specified for storing the compressed data 335.


The computer 301 can be programmed for decompressing the unit of compressed data from the token 329. Standard techniques can be utilized to decompress the data. The compressed data stored in the memory 311 can be decompressed as a unit.


The computer 301 can be programmed for extracting data objects from the decompressed data 331. The predetermined format of the data objects which were initially grouped together is known. Therefore, the locations of the data objects in the decompressed data is known. An application can extract the data objects from the decompressed data according to the predetermined format. The decompressed data optionally can be parsed to extract the data objects. Accordingly, one or more embodiments can provide that the independent data objects in the decompressed data are parsed according to a predetermined format.


Optionally, the computer 301 can be programmed for checking the version of the compressed data on the token 333. The version can be checked, for example by comparing a prior version number with the version number associated with the compressed data on the token, by comparing a prior block of compressed data with the current compressed data, or similar. Thus, according to alternate embodiments, the checking includes comparing at least one block of the compressed data to a previously stored block from the same token; and/or the checking can include comparing a version associated with the compressed data to a previous version. If the version is unchanged from the prior version, it may not be necessary to read the compressed data from the token, to decompress the data, and/or to extract the data objects from the decompressed data. Accordingly, one or more embodiments can include checking whether the compressed data on the token is changed, and performing the reading, decompressing and extracting only if the compressed data on the token is changed.


The token 313 will now be described. The token 313 can include various elements which will be well understood to those of skill in this art, and accordingly such elements are omitted from this description. A memory 315 of any of the various types described herein is provided in the token. The memory 315 can include a basic operating system, data, and variables 317; executable code 319; a unit of compressed data 321; and other data 323.


The unit of compressed data 321 can be stored in block boundaries. A block of memory in the typical token 313 is, for example, typically 100 bytes or 255 bytes. Consider a simplified example where the block of memory is 100 bytes, and the data to be loaded onto the token 313 includes two certificates, where each certificate can be individually compressed to 102 bytes. When each individually compressed certificate is individually written to the token 313, each uses two 100 byte blocks, for a total of four blocks of memory in the token 313. On the other hand, when the two certificates are grouped and compressed to form a unit of contiguous data, the unit of contiguous data is 204 bytes or less (depending on the compression technique). The unit of contiguous data then uses a total of three blocks of memory in the token 313. Accordingly, one or more embodiments can provide that the writing of data to the token is performed by writing the data in blocks.



FIG. 4 and FIG. 5 together illustrate procedures for providing data objects to a token, where FIG. 4 is an example procedure for writing the data objects to the token, and FIG. 5 is an example of an upper level process that calls the procedure for writing the data objects at certain events. The procedures of FIG. 4 and FIG. 5 can advantageously be implemented on, for example, a processor of a computer described in connection with FIG. 2 or other apparatus appropriately arranged.


Referring now to FIG. 4, a flow chart illustrating a procedure 401 for providing data objects to a token will be discussed and described. Details which have been previously described will be omitted from the following detailed description of the procedure 401.


The procedure 401 can include determining 403 the independent data objects associated with the token. Once determined, the independent data objects can be retrieved 405 from memory locations, to form a set of data objects. The set of data objects can be aggregated 407 into a group. The group of data objects can be compressed 409 to form a unit of contiguous data. The procedure 401 can optionally include associating 411 a version number with the unit of contiguous data.


The procedure 401 can include establishing 413 a connection to the token. Optionally, the procedure can include verifying 415 that the token is as expected, for example by reading a unique identifier stored on the token and comparing the stored identifier to an identifier expected to be stored the token. Accordingly, one or more embodiments provide for connecting to the token and verifying that the token is the token corresponding to the unit of data.


If the token is the expected token, the unit of contiguous data can be written 417 to the token. The procedure can include optionally disconnecting 419 from the token.


The process of providing the data objects to the token can then be ended 421. Other embodiments can provide that the unit of contiguous data is created in a process separate from and/or independent of a process of writing the unit of contiguous data to the token.


One or more embodiments can include a method of providing independent data objects to a token, wherein the independent data objects are representative of security information associated with the token. The method includes determining a set of independent data objects that are associated with a token, aggregating the set of independent data objects into a group, compressing the group into a unit of contiguous data, and writing the unit of contiguous data to the token.


Referring now to FIG. 5, a flow chart illustrating a procedure 501 for a timely update of token data will be discussed and described. Conventional processing 503 related to the token can be performed. Various types of conventional processing can cause a change to the independent data objects associated with the token, and/or can cause an unpredictable change to the compressed data stored on the token. In the illustrated procedure 501, the data objects are provided to the token if 505 the token was enrolled, if 507 data for the token is to be recovered, or if 509 the token was loaded with executable instructions. The independent data objects associated with the token can change when the token is enrolled and/or when data is to be recovered to the token. On the other hand, when executable instructions (for example, operating system or applications) are loaded to the token, the executable instructions can overwrite the compressed data stored on the token. Hence, when one of these events occurs, the procedure 501 can call 511 the previously-described process for providing the data objects to the token.


Accordingly, the writing of the unit to the token can be performed when the token is enrolled, when data corresponding to the token is recovered to the token, and/or when the token is loaded with executable instructions.


Referring now to FIG. 6, a flow chart illustrating a procedure 601 for reading individual data objects stored on a token will be discussed and described. The procedure 601 can advantageously be implemented on, for example, a processor of a computer illustrated in connection with FIG. 3 or other apparatus appropriately arranged. Many details related to the procedure in FIG. 6 have been discussed above, and will not be repeated below.


The procedure 601 can include establishing 603 a local connection to the token. Optionally, the procedure 601 can determine 605 whether the compressed data on the token has changed. If the compressed data on the token has changed, the procedure can read 607 a contiguous unit of compressed data from the token, decompress 609 the contiguous unit, and extract 611 individual data objects from the decompressed data, optionally by parsing the decompressed data according to a predetermined format. The procedure 610 can then end 613.


Accordingly, there can be provided a method for reading individual data objects that are representative of security information associated with the token and stored on a token together in compressed form. The method can include reading a contiguous unit of compressed data from the token; decompressing the contiguous unit of compressed data to form decompressed data; and extracting independent data objects from the decompressed data.


Any of the above can be embodied on a computer readable medium, which includes storage devices and signals, in compressed or uncompressed form. Exemplary computer readable storage devices include conventional computer system RAM (random access memory), ROM (read-only memory), EPROM (erasable, programmable ROM), EEPROM (electrically erasable, programmable ROM), and magnetic or optical disks or tapes. Exemplary computer readable signals, whether modulated using a carrier or not, are signals that a computer system can be configured to access, including signals downloaded through the Internet or other networks. Concrete examples of the foregoing include distribution of executable software program(s) of the computer program on a CD-ROM or via Internet download. In a sense, the Internet itself, as an abstract entity, is a computer readable medium. The same is true of computer networks in general.


It should be noted that the term token denotes a small, portable device which typically has an embedded integrated circuit with a microprocessor, a memory and an internal operating system, which stores electronic data and programs, and which is typically utilized for security and/or establishing an identity. Examples of tokens include devices which are sometimes referred to as smartcards, contactless cards, cryptographic tokens, authentication tokens, USB (universal serial bus) tokens, USB keys, USB buttons, and the like, and variants or evolutions thereof. Tokens may transfer data in combination with a wireless protocol, a serial or parallel data transfer protocol such as USB, or variations and evolutions of data transfer protocols. Tokens can operate in connection with standards such as ISO/IEC (International Organization for Standardization/International Electrotechnical Commission) 7816, ISO/IEC 7810, ISO 14443 RFID (radio frequency identification ISO 15693 RFID, EMV (Europay Mastercard Visa) version 4.00, PC/SC (personal computer/smart card), and/or other standards; custom protocols and definitions; and variants and evolutions thereof.


Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

Claims
  • 1. A computer system, comprising: an interface operable to communicate with a token device and to provide independent data objects to the token device in compressed form, wherein the independent data objects are representative of security information associated with the token device; anda processor cooperatively operable with the interface and configured to determine a set of independent data objects that are associated with the token device, retrieve at least a portion of the set of independent data objects from non-contiguous memory, aggregate the set of independent data objects associated with the token device into a group, compress the group into a unit of contiguous data to be written to the token device as a set of blocks, and write the set of blocks to the token device via the interface, wherein the writing of the set of blocks to the token device is performed when at least one of the following occurs: when the token device is enrolled, when data corresponding to the token device is recovered to the token device, and when the token device is loaded with executable instructions.
  • 2. The system of claim 1, wherein the writing is performed via a secure connection over the interface.
  • 3. The system of claim 1, further comprising associating a version number with the unit of contiguous data to be written to the token device, writing the version number to the token device in association with the unit of contiguous data, updating the unit of contiguous data when at least one of the independent data objects is changed, and changing the version number when the unit of contiguous data for the token device is updated.
  • 4. The system of claim 1, wherein the independent data objects in the set are aggregated in the group according to a predetermined format.
  • 5. A method comprising: providing, by a processor, a set of independent data objects to a token device, wherein the set of independent data objects are representative of security information associated with the token device;determining, by the processor, the set of independent data objects that are associated with the token device;retrieving at least a portion of the set of independent data objects from non-contiguous memory;aggregating, by the processor, the set of independent data objects into a group;compressing, by the processor, the group into a unit of contiguous data to be written to the token device as a set of blocks; andwriting, by the processor, the set of blocks to the token device, wherein the writing of the set of blocks to the token device is performed when at least one of the following occurs: when the token device is enrolled, when data corresponding to the token device is recovered to the token device, and when the token device is loaded with executable instructions.
  • 6. The method of claim 5, further comprising: connecting to the token device; andverifying that the token device is the token device corresponding to the unit of contiguous data.
  • 7. The method of claim 6, wherein the connecting is performed via a secure connection.
  • 8. The method of claim 5, further comprising connecting to the token device via a secure connection.
  • 9. The method of claim 5, further comprising associating a version number with the unit of contiguous data to be written to the token device, and writing the version number to the token device in association with the unit of contiguous data, wherein the version number is changed when the unit of contiguous data for the token device is changed.
  • 10. The method of claim 5, wherein the independent data objects in the set are aggregated in the group according to a predetermined format.
  • 11. A non-transitory machine-accessible medium including instructions that, when executed by a machine, cause the machine to perform a method comprising: providing, by a processor of the machine, a set of independent data objects to a token device, wherein the set of independent data objects are representative of security information associated with the token device;determining, by the processor, the set of independent data objects that are associated with the token device;retrieving at least a portion of the set of independent data objects from non-contiguous memory;aggregating, by the processor, the set of independent data objects into a group;compressing, by the processor, the group into a unit of contiguous data to be written to the token device as a set of blocks; andwriting, by the processor, the set of blocks to the token device, wherein the writing of the set of blocks to the token device is performed when at least one of the following occurs: when the token device is enrolled, when data corresponding to the token device is recovered to the token device, and when the token device is loaded with executable instructions.
  • 12. The non-transitory machine-accessible medium of claim 11, wherein the method further comprises: connecting to the token device; andverifying that the token device is the token device corresponding to the unit of contiguous data.
  • 13. The non-transitory machine-accessible medium of claim 12, wherein the connecting is performed via a secure connection.
  • 14. The non-transitory machine-accessible medium of claim 11, wherein the method further comprises connecting to the token device via a secure connection.
  • 15. The non-transitory machine-accessible medium of claim 11, wherein the method further comprises associating a version number with the unit of contiguous data to be written to the token device, and writing the version number to the token device in association with the unit of contiguous data, wherein the version number is changed when the unit of contiguous data for the token device is changed.
  • 16. The non-transitory machine-accessible medium of claim 11, wherein the independent data objects in the set are aggregated in the group according to a predetermined format.
US Referenced Citations (206)
Number Name Date Kind
4108367 Hannan Aug 1978 A
4849614 Watanabe et al. Jul 1989 A
4924330 Seamons et al. May 1990 A
5247163 Ohno et al. Sep 1993 A
5355414 Hale et al. Oct 1994 A
5499371 Henninger et al. Mar 1996 A
5594227 Deo Jan 1997 A
5631961 Mills et al. May 1997 A
5666415 Kaufman Sep 1997 A
5721781 Deo et al. Feb 1998 A
5745576 Abraham et al. Apr 1998 A
5745678 Herzberg et al. Apr 1998 A
5768373 Lohstroh et al. Jun 1998 A
5862310 Crawford et al. Jan 1999 A
5923884 Peyret et al. Jul 1999 A
5937066 Gennaro et al. Aug 1999 A
5943423 Muftic Aug 1999 A
5991411 Kaufman et al. Nov 1999 A
5991882 O'Connell Nov 1999 A
6005942 Chan et al. Dec 1999 A
6005945 Whitehouse Dec 1999 A
6011847 Follendore, III Jan 2000 A
6016476 Maes et al. Jan 2000 A
6044155 Thomlinson et al. Mar 2000 A
6072876 Obata et al. Jun 2000 A
6141420 Vanstone et al. Oct 2000 A
6141743 Strongin Oct 2000 A
6178507 Vanstone Jan 2001 B1
6179205 Sloan Jan 2001 B1
6226744 Murphy et al. May 2001 B1
6377825 Kennedy et al. Apr 2002 B1
6490680 Scheidt et al. Dec 2002 B1
6502108 Day et al. Dec 2002 B1
6539093 Asad et al. Mar 2003 B1
6636975 Khidekel et al. Oct 2003 B1
6643701 Aziz et al. Nov 2003 B1
6687190 Momich et al. Feb 2004 B2
6691137 Kishi Feb 2004 B1
6698654 Zuppicich Mar 2004 B1
6734886 Hagan et al. May 2004 B1
6760752 Liu et al. Jul 2004 B1
6804687 Sampson Oct 2004 B2
6819766 Weidong Nov 2004 B1
6826686 Peyravian Nov 2004 B1
6829712 Madoukh Dec 2004 B1
6880037 Boyer Apr 2005 B2
6880084 Brittenham et al. Apr 2005 B1
6898605 Constantino May 2005 B2
6898714 Nadalin et al. May 2005 B1
6931133 Andrews et al. Aug 2005 B2
6941326 Kadyk et al. Sep 2005 B2
6970970 Jung et al. Nov 2005 B2
6978933 Yap et al. Dec 2005 B2
6986040 Kramer et al. Jan 2006 B1
7007105 Sullivan et al. Feb 2006 B1
7010600 Prasad et al. Mar 2006 B1
7050589 Kwan May 2006 B2
7051213 Kobayashi et al. May 2006 B1
7085386 Audebert et al. Aug 2006 B2
7114028 Green et al. Sep 2006 B1
7156302 Yap et al. Jan 2007 B2
7159763 Yap et al. Jan 2007 B2
7185018 Archbold et al. Feb 2007 B2
7251728 Toh et al. Jul 2007 B2
7278581 Ong Oct 2007 B2
7299364 Noble et al. Nov 2007 B2
7302585 Proudler et al. Nov 2007 B1
7356688 Wang Apr 2008 B1
7374099 de Jong May 2008 B2
7386705 Low et al. Jun 2008 B2
7437757 Holdsworth Oct 2008 B2
7451921 Dowling et al. Nov 2008 B2
7475250 Aull et al. Jan 2009 B2
7475256 Cook Jan 2009 B2
7480384 Peyravian et al. Jan 2009 B2
7502793 Snible et al. Mar 2009 B2
7571321 Appenzeller et al. Aug 2009 B2
7602910 Johansson et al. Oct 2009 B2
7702917 Tevosyan et al. Apr 2010 B2
7769996 Randle et al. Aug 2010 B2
7822209 Fu et al. Oct 2010 B2
7860243 Zheng et al. Dec 2010 B2
20010008012 Kausik Jul 2001 A1
20010036276 Ober et al. Nov 2001 A1
20010054148 Hoornaert et al. Dec 2001 A1
20020004816 Vange et al. Jan 2002 A1
20020007351 Hillegass et al. Jan 2002 A1
20020007359 Nguyen Jan 2002 A1
20020010679 Felsher Jan 2002 A1
20020029343 Kurita Mar 2002 A1
20020056044 Andersson May 2002 A1
20020059144 Meffert et al. May 2002 A1
20020064095 Momich et al. May 2002 A1
20020080958 Ober et al. Jun 2002 A1
20020099727 Kadyk et al. Jul 2002 A1
20020112156 Glen et al. Aug 2002 A1
20020120842 Bragstad et al. Aug 2002 A1
20020133707 Newcombe Sep 2002 A1
20020171546 Evans et al. Nov 2002 A1
20020184149 Jones Dec 2002 A1
20020188848 Buttiker Dec 2002 A1
20030005291 Burn Jan 2003 A1
20030012386 Kim et al. Jan 2003 A1
20030028664 Tan et al. Feb 2003 A1
20030035548 Kwan Feb 2003 A1
20030056099 Asanoma et al. Mar 2003 A1
20030075610 Ong Apr 2003 A1
20030093695 Dutta May 2003 A1
20030115455 Aull et al. Jun 2003 A1
20030115466 Aull et al. Jun 2003 A1
20030115467 Aull et al. Jun 2003 A1
20030115468 Aull et al. Jun 2003 A1
20030167399 Audebert et al. Sep 2003 A1
20030172034 Schneck et al. Sep 2003 A1
20040042620 Andrews et al. Mar 2004 A1
20040053642 Sandberg et al. Mar 2004 A1
20040066274 Bailey Apr 2004 A1
20040088562 Vassilev et al. May 2004 A1
20040096055 Williams et al. May 2004 A1
20040103324 Band May 2004 A1
20040103325 Priebatsch May 2004 A1
20040120525 Miskimmin et al. Jun 2004 A1
20040144840 Lee et al. Jul 2004 A1
20040146163 Asokan et al. Jul 2004 A1
20040153451 Phillips et al. Aug 2004 A1
20040162786 Cross et al. Aug 2004 A1
20040230831 Spelman et al. Nov 2004 A1
20050022123 Costantino Jan 2005 A1
20050033703 Holdsworth Feb 2005 A1
20050109841 Ryan et al. May 2005 A1
20050114673 Raikar et al. May 2005 A1
20050119978 Ates Jun 2005 A1
20050123142 Freeman et al. Jun 2005 A1
20050138386 Le Saint Jun 2005 A1
20050138390 Adams et al. Jun 2005 A1
20050144312 Kadyk et al. Jun 2005 A1
20050184163 de Jong Aug 2005 A1
20050184164 de Jong Aug 2005 A1
20050184165 de Jong Aug 2005 A1
20050188360 de Jong Aug 2005 A1
20050216732 Kipnis et al. Sep 2005 A1
20050262361 Thibadeau Nov 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050289652 Sharma et al. Dec 2005 A1
20060005028 Labaton Jan 2006 A1
20060010325 Liu et al. Jan 2006 A1
20060015933 Ballinger et al. Jan 2006 A1
20060036868 Cicchitto Feb 2006 A1
20060043164 Dowling et al. Mar 2006 A1
20060072747 Wood et al. Apr 2006 A1
20060073812 Punaganti Venkata et al. Apr 2006 A1
20060075133 Kakivaya et al. Apr 2006 A1
20060075486 Lin et al. Apr 2006 A1
20060101111 Bouse et al. May 2006 A1
20060101506 Gallo et al. May 2006 A1
20060173848 Peterson et al. Aug 2006 A1
20060174104 Crichton et al. Aug 2006 A1
20060206932 Chong Sep 2006 A1
20060208066 Finn et al. Sep 2006 A1
20060226243 Dariel Oct 2006 A1
20060291664 Suarez et al. Dec 2006 A1
20060294583 Cowburn et al. Dec 2006 A1
20070014416 Rivera et al. Jan 2007 A1
20070074034 Adams et al. Mar 2007 A1
20070112721 Archbold et al. May 2007 A1
20070113267 Iwanski et al. May 2007 A1
20070113271 Pleunis May 2007 A1
20070118891 Buer May 2007 A1
20070162967 de Jong et al. Jul 2007 A1
20070169084 Frank et al. Jul 2007 A1
20070189534 Wood et al. Aug 2007 A1
20070204333 Lear et al. Aug 2007 A1
20070230706 Youn Oct 2007 A1
20070271601 Pomerantz Nov 2007 A1
20070277032 Relyea Nov 2007 A1
20070280483 Fu Dec 2007 A1
20070283163 Relyea Dec 2007 A1
20070283427 Gupta et al. Dec 2007 A1
20070288745 Kwan Dec 2007 A1
20070288747 Kwan Dec 2007 A1
20080005339 Kwan Jan 2008 A1
20080019526 Fu Jan 2008 A1
20080022086 Ho Jan 2008 A1
20080022088 Fu et al. Jan 2008 A1
20080022121 Fu et al. Jan 2008 A1
20080022122 Parkinson et al. Jan 2008 A1
20080022128 Proudler et al. Jan 2008 A1
20080034216 Law Feb 2008 A1
20080046982 Parkinson Feb 2008 A1
20080056496 Parkinson Mar 2008 A1
20080059790 Parkinson Mar 2008 A1
20080059793 Lord et al. Mar 2008 A1
20080069338 Relyea Mar 2008 A1
20080069341 Relyea Mar 2008 A1
20080072283 Relyea Mar 2008 A1
20080077794 Arnold et al. Mar 2008 A1
20080077803 Leach et al. Mar 2008 A1
20080133514 Relyea Jun 2008 A1
20080148047 Appenzeller et al. Jun 2008 A1
20080189543 Parkinson Aug 2008 A1
20080209224 Lord Aug 2008 A1
20080209225 Lord Aug 2008 A1
20080229401 Magne Sep 2008 A1
20090003608 Lee et al. Jan 2009 A1
20090133107 Thoursie May 2009 A1
20100313027 Taylor Dec 2010 A1
Foreign Referenced Citations (3)
Number Date Country
9724831 Jul 1997 WO
0048064 Aug 2000 WO
2007096590 Aug 2007 WO
Related Publications (1)
Number Date Country
20070282881 A1 Dec 2007 US