Method and apparatus for loading a trustable operating system

Information

  • Patent Grant
  • 8407476
  • Patent Number
    8,407,476
  • Date Filed
    Tuesday, November 10, 2009
    15 years ago
  • Date Issued
    Tuesday, March 26, 2013
    11 years ago
Abstract
An article of manufacture is provided for securing a region in a memory of a computer. According to one embodiment, the article of manufacture comprises a machine-accessible medium including data that, when accessed by a machine, causes the machine to: halt all but one of a plurality of processing elements in a computer, where the halted processing elements enter into a special halted state; load content into the region only after the halting of all but the one of the plurality of processing elements and the region is protected from access by the halted processing elements; place the non-halted processing element into a known privileged state; and cause the halted processing elements to exit the halted state after the non-halted processing element has been placed into the known privileged state.
Description
FIELD OF THE INVENTION

This invention relates to microprocessors. In particular, the invention relates to processor security.


BACKGROUND

Advances in microprocessor and communication technologies have opened up many opportunities for applications that go beyond the traditional ways of doing business. Electronic commerce and business-to-business transactions are now becoming popular, reaching the global markets at a fast rate. Unfortunately, while modern microprocessor systems provide users convenient and efficient methods of doing business, communicating and transacting, they are also vulnerable to unscrupulous attacks. Examples of these attacks include virus, intrusion, security breach, and tampering, to name a few. Computer security, therefore, is becoming more and more important to protect the integrity of the computer systems and increase the trust of users.


In the context of operating systems, computer security is determined initially by establishing that you are loading (or have loaded) a trustable operating system. A trustable operating system is where the user or a third party may later inspect the system and determine whether a given operating system was loaded, and if so, whether or not the system was loaded into a secure environment.


However, when booting a normal operating system it is necessary to boot a wide variety of code components. Even if you could choose what code component should be loaded, the operating system contains such an extremely large amount of code that it is difficult to establish the operating system's specific identity and whether you should choose to trust it, i.e. whether it was loaded into a secure environment.


In a multi-processor environment, it may be particularly difficult to determine whether the operating system can be trusted. This is because each of the central processing units (CPUs), or sometimes even a system device, can execute a code stream that can potentially alter and compromise the integrity of the code that was loaded. Consequently, at least at the operating system level, it is often necessary to assume that the operating system is trustworthy. Such assumptions may prove to be false and can lead to catastrophic failures in computer security.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be described by way of exemplary embodiments, but not limitations, illustrated in the accompanying drawings in which like references denote similar elements, and in which:



FIG. 1 is a diagram illustrating a generalized overview of the organization of typical operating system components and corresponding privilege levels;



FIG. 2 is a block diagram illustrating one generalized embodiment of a computer system incorporating the invention, and in which certain aspects of the invention may be practiced;



FIG. 3 is a flow diagram illustrating certain aspects of a method to be performed by a computing device executing one embodiment of the illustrated invention shown in FIG. 2;



FIG. 4 is a flow diagram illustrating certain other aspects of a method to be performed by a computing device executing one embodiment of the illustrated invention shown in FIG. 2;



FIG. 5 is a flow diagram illustrating certain aspects of a method to be performed by a computing device executing another embodiment of the illustrated invention shown in FIG. 2; and



FIG. 6 is a block diagram illustrating one generalized embodiment of a computer system in which certain aspects of the invention illustrated in FIGS. 2-5 may be practiced.





DETAILED DESCRIPTION

In the following description various aspects of the present invention, a method and apparatus for loading a trustable operating system, will be described. Specific details will be set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced with only some or all of the described aspects of the present invention, and with or without some or all of the specific details. In some instances, well-known features may be omitted or simplified in order not to obscure the present invention.


Parts of the description will be presented using terminology commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art, including terms of operations performed by a computer system and their operands, such as transmitting, receiving, retrieving, determining, generating, recording, storing, and the like. As well understood by those skilled in the art, these operands take the form of electrical, magnetic, or optical signals, and the operations involve storing, transferring, combining, and otherwise manipulating the signals through electrical, magnetic or optical components of a system. The term system includes general purpose as well as special purpose arrangements of these components that are standalone, adjunct or embedded.


Various operations will be described as multiple discrete steps performed in turn in a manner that is most helpful in understanding the present invention. However, the order of description should not be construed as to imply that these operations are necessarily performed in the order they are presented, or even order dependent. Lastly, repeated usage of the phrase “in one embodiment” does not necessarily refer to the same embodiment, although it may.


One principle for providing security in a computer system or platform is the concept of enforcing privilege levels. Privilege levels restrict which system resources (e.g. privileged instructions, memory, input/output devices and the like) that a particular software component can access. FIG. 1 is a diagram illustrating a generalized overview of the organization of typical operating system components and corresponding privilege levels. In a system without virtual-machine (VM) technology 100, the operating system 120 includes a small resident program component called a privileged software nucleus 125 that operates with the highest privilege level 170, i.e. the privileged software nucleus 125 can execute both privileged and non-privileged instructions and access memory and I/O devices. Another type of system component, the device drivers 130, also execute with a high privilege level 170, particularly if the system supports direct memory access (DMA) transactions, in which a device driver 130 may write the contents of its device directly to memory without involving a processor (e.g. without using the privileged software nucleus 125 to access memory). Still other types of system components, such as the applications 140, operate with a lower privilege level 180 and are only able to execute non-privileged or lesser-privileged instructions or to make supervisory calls (SVCs) to the privileged software nucleus 125 in the operating system 120 to execute the privileged instructions or, more generally, to access privileged system resources on behalf of the application 140.


In a system with VM technology 110, another type of system component executes with the highest privilege: the virtual-machine monitor (VMM) 150. In a VM system 110, the operating system 120 actually executes with less privilege than the VMM 150. In some VMM implementations, the VMM 150 may be broken into a VMM core component 150 and one or more VMM extensions 160 that execute with less privilege than the VMM core component 150 but more than the operating system 120. In this way, the VMM core component 150 maintains its integrity in the presence of faulty VMM extensions 160.



FIG. 2 is a block diagram illustrating one generalized embodiment of a computer system 200 incorporating the invention, and in which certain aspects of the invention may be practiced. It should be understood that the distinction between the various components of computer system 200 is a logical distinction only; in practice, any of the components may be integrated into the same silicon die, divided into multiple die, or a combination of both, without departing from the scope of the invention. In the illustrated computer system 200, either the central processing units (CPU) 210/220/230 or the devices 240/245/250 have the necessary high privilege levels 170 that enable them to initiate transactions in memory 270. The memory controller 260 is responsible for forwarding the memory transaction from memory 270 to the appropriate destination.


The computer system 200 further includes a hash digest 280 of cryptographic hash values that identify the contents of one or more operating system components that have been loaded into regions in memory 270. It is noted that a cryptographic hash value is known in the art as being generated by a one-way function, mathematical or otherwise, which takes a variable-length input string, called a pre-image and converts it to a fixed-length, generally smaller, output string referred to as a hash value. The hash function is one-way in that it is difficult to generate a pre-image that matches the hash value of another pre-image. A hash digest signing engine 290 has a secure channel to access the hash digest 280 and will sign the contents of the hash digest 280 upon receiving a request to do so. Signing the contents of a hash digest 280 is known in the art, and is used to produce a digital signature that can be later used to authenticate the identity of the signer and to ensure that the content of the hash digest 280 has not been tampered with. By requesting such a signing, an outside entity may observe the state of system components reported by the hash and decide whether or not to trust the computer system 200, i.e. whether or not the signed contents of the hash digest 280 match the expected signature of the system components.


In order to insure that the state of the components reported by the hash are such that the computer system 200 can be trusted, each of the computer system's CPUs 210/220/230 incorporate or is capable of incorporating an embodiment of the method and apparatus of the present invention to facilitate the installation (or loading) of a trustable operating system.


In one embodiment, the method and apparatus of the present invention include a start secure operation (SSO) 206 and a join secure operation (JSO) 204, each of which are capable of operating on any of the computer system's CPUs 210/220/230. The SSO 206 and JSO 204 are logical operations that are performed atomically to insure the integrity of the computer system 200. The SSO 206 and JSO 204 may be implemented as a series of privileged instructions carried out in software, hardware, or a combination thereof without departing from the scope of the invention.


In one embodiment, the SSO 206 takes a region (or regions) of memory 270 that was specified in a memory region parameter 202 and causes the computer system 200 to perform a number of operations that enable one of the CPUs 210/220/230 to load and register one or more components of operating system code in the specified region of memory 270 while the JSO 204 prevents the other CPUs from interfering. Upon the loading of the one or more operating system components, the JSO 204 and SSO 206 further force the CPUs 210/220/230 to jump to a known entry point in the now secured specified region of memory 270, also referred to as a security kernel 275, in a known, privileged state, i.e. a known state that allows access to the computer system's 200 resources in accordance with the CPU's corresponding high privilege level 170.


In one embodiment, once the region or regions in memory 270 to be secured is identified, via memory region parameter 202 or otherwise, the SSO 206 places the code that is to be secured into the identified region in memory 270, i.e. places the operating system code (or a portion thereof) into the security kernel 275. The code may be any code that is desired to be trusted, such as the privileged software nucleus 125 of the operating system 120 or, in a system with VM 110, the VMM core 150, the VM monitor core code.


In one embodiment, once the code is placed in the security kernel 275, the SSO 206 securely launches the operating system by registering the identity of the operating system code, e.g. the privileged software nucleus 125 or the VMM core 150. The SSO 206 registers the identity of the code by computing and recording a hash digest 180 of the code, and cryptographically signing the hash digest 180 using the hash digest signing engine 290. Once registered, the operating system becomes a trustable operating system, capable of verification by an outside entity.


In a computer system 200 with more than one CPU, as illustrated in FIG. 2, the computer system 200 must also be capable of preventing CPUs 220/230, other than the CPU 210 executing the SSO 206, from interfering with the secure launch of the trustable operating system. Accordingly, each CPU 210/220/230 is further provided with a JSO 204. When an SSO 206 is initiated on CPU 210, the SSO 206 signals the other CPUs 220/230 to execute a JSO 204.


In one embodiment, the JSO 204 forces the respective CPUs 220/230 to enter a special halted state and to signal their entry into the halted state to the initiating SSO CPU 210. When the initiating SSO CPU 210 receives halted signals from all of the other CPUs 220/230, the SSO 206 commences loading a trustable operating system by placing the desired code in the security kernel 275 and registering it. Once the CPU 210 that initiated the SSO 206 completes loading the trustable operating system, i.e. when the identity of the code in the security kernel 275 has been registered, the SSO 206 forces the CPU 210 to jump to a known entry point in the security kernel 275, which now has a known privileged state as a result of the operation of the SSO 206. In addition, the SSO 206 signals the other CPUs 220/230 to exit their respective special halted states. Upon exiting the halted states, the JSO 204 forces the CPUs 220/230 to also jump to a known entry point in the security kernel 275.


In one embodiment, the memory region parameter 202 is specified as a range of addresses in memory 270, and includes one or more pairs of start and stop addresses. However, other ways of specifying which region or regions in memory 270 are to be secured may be employed without departing from the scope of the invention. For example, an alternate embodiment of the memory region parameter 202 may be specified as a starting address and region length.


Turning now to FIGS. 3-5, the particular methods of the invention are described in terms of computer software with reference to a series of flow diagrams. The methods to be performed by a computer constitute computer programs made up of computer-executable instructions. Describing the methods by reference to a flow diagram enables one skilled in the art to develop such programs including such instructions to carry out the methods on suitably configured computers (the processor of the computer executing the instructions from computer-accessible media). The computer-executable instructions may be written in a computer programming language or may be embodied in firmware logic, or in micro-engine code, or the like. If written in a programming language conforming to a recognized standard, such instructions can be executed on a variety of hardware platforms and for interface to a variety of operating systems. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein. Furthermore, it is common in the art to speak of software, in one form or another (e.g., program, procedure, process, application, and the like), as taking an action or causing a result. Such expressions are merely a shorthand way of saying that execution of the software by a computer causes the processor of the computer to perform an action or produce a result.



FIG. 3 is a flow diagram illustrating certain aspects of a method to be performed by a computing device executing one embodiment of the illustrated invention shown in FIG. 2. In particular, FIG. 3 illustrates some of the acts to be performed by a computer executing an SSO 206 that incorporates one embodiment of the invention. Processing begins at process 305, where one of the CPUs of computer system 200, for example CPU 210, prepares for executing an SSO 206 by insuring at process 310 that all of the other CPUs 220/230 of computer system 200 have performed a JSO 204. The JSO 204 causes the other CPUs 220/230 of computer system 200 to enter a halted state so that they cannot interfere with the SSO 206 and CPU 210 during the loading of the trustable operating system. In one embodiment, after all of the other CPUs 220/230 have been halted, the SSO 206 continues at process 315 to cause the CPU 210, or in some cases, the memory controller 260, to block the devices 240/245/250 of computer system 200 from accessing regions in memory 270 specified in memory region parameters 202, i.e. the security kernel 275. Blocking devices from accessing the security kernel 275 for the duration of the SSO 206 is typically only necessary in a computer system 200 that supports direct memory access (DMA). In one embodiment, blocking devices from accessing the security kernel 275 may also be performed by a standard chipset.


In one embodiment, at process 320, the SSO 206 erases the current contents of the hash digest 280 in preparation for recording current platform and hash digest information. At process 325, the SSO 206 records the platform information in the hash digest 280. The recording of platform information may or may not be necessary, depending on the architecture of the computer system 200, and can include the version number of the CPU 210 executing the SSO 206, and the like. At process 330, the SSO 206 further computes a cryptographic hash digest of the code now present in the security kernel 275, i.e. the privileged software nucleus 125 or VMM core 150. The SSO 206 further records the information, also in the hash digest 280. At process 335, upon recording the necessary information in the hash digest 280, the SSO 206 places the CPU 210 into a known privileged state. Once the CPU 210 is in the known privileged state, the SSO 206 can further force the CPU 210 to jump to a known entry point in the security kernel 275. The known entry point may be any addressable area of the security kernel 275. Once the CPU 210 has jumped to the known entry point, the SSO 206 is complete and signals the other CPUs 220/230 to resume activity and returns control to the CPU 210.


Upon completion of SSO 206, an outside entity may send a request to the hash digest signing engine 290 to activate a secure channel to access the hash digest 280 and cause the digest signing engine 290 to read and cryptographically sign the content of the digest 280 recorded by the SSO 206. As noted earlier, by requesting such a signing, the outside entity may observe the state of components reported by the hash and decide whether or not to trust the computer system 200, i.e. whether or not a trustable operating system has been loaded.



FIG. 4 is a flow diagram illustrating certain aspects of a method to be performed by a computing device executing one embodiment of the illustrated invention shown in FIG. 2. In particular, FIG. 4 illustrates some of the acts to be performed by a computer executing a JSO 204 that incorporates one embodiment of the invention. Processing begins at process 405, where each of the computer system's 200 non-SSO CPUs, for example CPUs 220/230, enter a special halted state in response to the actions of the SSO 206 on CPU 210. The halted state prevents the CPUs 220/230 from interfering with the SSO 206 and CPU 210 during the loading of the trustable operating system. The CPUs 220/230 each signal the SSO 206 on CPU 210 as they enter the halted state. The JSO 204 continues at decision process 415, which waits until receiving a signal that the SSO 206 on CPU 210 has completed the initialization of a trustable operating system. Once the initialization is complete the JSO 204 continues at process 420 causing the CPUs 220/230 to exit the special halted state. At process 425, the JSO 204 causes the CPUs 220/230 to jump to a known entry point in the security kernel 275, after which the JSO 204 completes processing at termination 430 and returns control to the respective CPUs 220/230.


While FIGS. 3-4 describe a generalized embodiment of the SSO 206 and JSO 204 processes, FIG. 5 describes an example implementation of the SSO 206 and JSO 204 on a computer system 200 with VM 110, including VM systems with 32-bit CPUs and VMM extensions 160. Processing begins at process 505, where the SSO 206 on one of the computer system's 200 CPUs, say CPU 210, receives memory region parameters 202 in the form of a start physical address, denoted as parameter EAX, and an end physical address, denoted as parameter ECX. Taken together, the addresses specified in the EAX and ECX parameters specify the region in memory 270 that is to be secured. The SSO 206 takes preparatory actions at process 510 to provide the required environment within which the SSO 206 will operate. The preparatory actions depend upon the architecture of the computer system 200 and may include, but are not limited to, insuring that the starting physical address, EAX, has a value that is less than the ending physical address, ECX. In addition, the SSO 206 can insure that the protected mode of the CPU 210 is enabled while the paging, physical address extension and VM extension modes are disabled, and that the privilege level of the CPU 210 is temporarily set to zero. Other possible preparatory actions might include disabling direct memory access (DMA) to the region or regions in memory 270 that is or are to be secured, i.e. the security kernel 275, and disabling hardware interruptions to the CPU 210. Disabling hardware interruptions helps to insure that the SSO 206 and JSO 204 are performed atomically. Most importantly, the SSO 206 provides the required environment for loading a trustable operating system by causing each of the other CPUs 220/230 to commence a JSO 204 in order to insure that all of the non-SSO CPUs are halted, and thereby prevented from interfering with the operation of the SSO 206.


Upon completion of the preparatory actions, the SSO 206 continues at process 515 to create a cryptographic hash 280 for the specified region in memory 270 starting at address EAX and ending at address ECX. When securing multiple regions in memory 270, process 515 is repeated until all secured regions, i.e. the entire security kernel 275 are included in the cryptographic hash 280. At process 520, the SSO 206 records the cryptographic hash 280 in a chipset register that functions as the hash digest 280. The SSO 206 continues at process 525 by inducing the CPU 210 to enter a known state, and further at process 530 by causing the CPU 210 to jump to the hashed (i.e. the secured) region in memory 270, i.e. the security kernel 275. The SSO 206 concludes at process 535, where the CPU 210 will be in the known induced state with all interruptions disabled, and the security kernel 275 will be secured.



FIG. 6 illustrates one embodiment of an general purpose computer system 600 in which one embodiment of the invention illustrated in FIGS. 2-5 may be practiced. One embodiment of the present invention may be implemented on a personal computer (PC) architecture. However, it will be apparent to those of ordinary skill in the art that alternative computer system architectures or other processor, programmable or electronic-based devices may also be employed.


In general, such computer systems as illustrated in FIG. 6 include one or more processors 602 coupled through a bus 601 to a random access memory (RAM) 603, a read only memory (ROM) 604, and a mass storage device 607. Mass storage device 607 represents a persistent data storage device, such as a floppy disk drive, fixed disk drive (e.g., magnetic, optical, magneto-optical, or the like), or streaming tape drive. Processor 602 represents a central processing unit of any type of architecture, such as complex instruction set computer (CISC), reduced instruction set computer (RISC), very long instruction word (VLIW), or hybrid architecture. In one embodiment the processors 602 are compatible with an Intel Architecture (IA) processor, such as the Pentium™ series, the IA-32™ and the IA-64™. In one embodiment, the computer system 600 includes any number of processors such as the CPUs 210/220/230 illustrated in FIG. 2.


Display device 605 is coupled to processor(s) 602 through bus 601 and provides graphical output for computer system 600. Input devices 606 such as a keyboard or mouse are coupled to bus 601 for communicating information and command selections to processor 602. Also coupled to processor 602 through bus 601 is an input/output interface 610 which can be used to control and transfer data to electronic devices (printers, other computers, etc.) connected to computer system 600. Computer system 600 includes network devices 608 for connecting computer system 600 to a network 614 through which data may be received, e.g., from remote device 612. Network devices 608, may include Ethernet devices, phone jacks and satellite links. It will be apparent to one of ordinary skill in the art that other network devices may also be utilized.


One embodiment of the invention may be stored entirely as a software product on mass storage 607. Another embodiment of the invention may be embedded in a hardware product, for example, in a printed circuit board, in a special purpose processor, or in a specifically programmed logic device communicatively coupled to bus 601. Still other embodiments of the invention may be implemented partially as a software product and partially as a hardware product.


When embodiments of the invention are represented as a software product stored on a machine-accessible medium (also referred to as a computer-accessible medium or a processor-accessible medium) such as mass storage device 607, the machine-accessible medium may be any type of magnetic, optical, or electrical storage medium including a diskette, CD-ROM, memory device (volatile or non-volatile), or similar storage mechanism. The machine-accessible medium may contain various sets of instructions, code sequences, configuration information, or other data. Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described invention may also be stored on the machine-accessible medium. In one embodiment of the present invention, the machine-accessible medium includes instructions that when executed by a machine causes the machine to perform operations comprising the SSO 206 and JSO 204.


Accordingly, a novel method is described for loading a trustable operating system. From the foregoing description, those skilled in the art will recognize that many other variations of the present invention are possible. For example, when implementing the invention on a mainframe or comparable class of machine, it may not be necessary to disable direct memory access (DMA) to the region or regions in memory 270 that is or are to be secured, i.e. the security kernel 275, or to disable hardware interruptions to the CPU 210. On the other hand, when implementing the invention on a PC-architected machine, such additional protective mechanisms may be needed to provide an operating environment within which the invention may be practiced. Thus, the present invention is not limited by the details described. Instead, the present invention can be practiced with modifications and alterations within the spirit and scope of the appended claims.

Claims
  • 1. An article of manufacture, comprising: a non-transitory machine-accessible storage medium including instructions that, when accessed by a machine, cause the machine to execute a method for loading verifiably trustable software, the method comprising: causing all but one of a plurality of processing elements in a processing system to enter into a special halted state as part of a join secure operation;identifying a region in a memory of the processing system for use in trust measurement;protecting the identified region from access by the processing elements associated with the special halted state;using a signed cryptographic hash of the identified region to verify whether content in the identified region can be trusted;placing the non-halted processing element into a known privileged state; andafter the non-halted processing element has been placed into the known privileged state, generating a signal that causes the processing elements associated with the special halted state to exit the special halted state and resume activity, wherein each of the plurality of processing elements associated with the special halted state exits the special halted state as part of the join secure operation, in response to a signal from the non-halted processing element indicating that a start secure operation is complete, and wherein the join secure operation is performed atomically.
  • 2. The article of manufacture of claim 1 wherein the method for loading verifiably trustable software further comprises: causing the non-halted processing element to jump to a known entry point in the identified region in the memory.
  • 3. The article of manufacture of claim 1 wherein the instructions cause the processing elements associated with the special halted state to jump to a known entry point in the identified region in the memory upon exiting the special halted state.
  • 4. The article of manufacture of claim 1 wherein identifying the region in the memory comprises receiving a region parameter, the region parameter specifying a location of the region.
  • 5. The article of manufacture of claim 4 wherein the location comprises a range of addresses in the memory of the processing system within which the region is located.
  • 6. The article of manufacture of claim 4 wherein the location comprises a start address and a length of the memory of the processing system within which the region is located.
  • 7. The article of manufacture of claim 1 wherein the content is a component of an operating system to operate the processing system.
  • 8. The article of manufacture of claim 7 wherein the component of the operating system is one of a virtual machine monitor and a privileged software nucleus.
  • 9. The article of manufacture of claim 1 wherein the instructions further cause the machine to: block access to the identified region of memory for a duration of time even after the processing elements associated with the special halted state have entered the special halted state when the plurality of processing elements are implemented within a processing system that supports direct memory access (DMA).
  • 10. The article of manufacture of claim 1 wherein the operations of identifying the region for use in trust measurement and using the signed cryptographic hash of the identified region to verify whether the content can be trusted are uninterruptible.
  • 11. A method for loading verifiably trustable software, the method comprising: causing all but one of a plurality of processing elements in a processing system to enter into a special halted state as part of a join secure operation;identifying a region in a memory of the processing system for use in trust measurement;protecting the identified region from access by the processing elements associated with the special halted state;using a signed cryptographic hash of the identified region to verify whether content in the identified region can be trusted;placing the non-halted processing element into a known privileged state; andafter the non-halted processing element has been placed into the known privileged state, generating a signal that causes the processing elements associated with the special halted state to exit the special halted state and resume activity, wherein each of the plurality of processing elements associated with the special halted state exits the special halted state as part of the join secure operation, in response to a signal from the non-halted processing element indicating that a start secure operation is complete, and wherein the join secure operation is performed atomically.
  • 12. The method of claim 11, further comprising: causing the non-halted processing element to jump to a known entry point in the identified region in the memory.
  • 13. The method of claim 11, further comprising: causing the processing elements associated with the special halted state to jump to a known entry point in the identified region in the memory upon exiting the special halted state.
  • 14. The method of claim 11 wherein identifying the region of the memory comprises receiving a region parameter, the region parameter specifying a location of the region.
  • 15. The method of claim 14 wherein the location comprises a range of addresses in the memory of the processing system within which the region is located.
  • 16. The method of claim 14 wherein the location comprises a start address and a length of the memory of the processing system within which the region is located.
  • 17. The method of claim 11 wherein the content is a component of an operating system to operate the processing system.
  • 18. The method of claim 17 wherein the component of the operating system is one of a virtual machine monitor and a privileged software nucleus.
  • 19. The method of claim 11 further comprising: blocking access to the identified region of memory for a duration of time even after the processing elements associated with the special halted state have entered the special halted state when the plurality of processing elements are implemented within a processing system that supports direct memory access (DMA).
  • 20. The method of claim 11 wherein the operations of identifying the region for use in trust measurement and using the signed cryptographic hash of the identified region to verify whether the content can be trusted are uninterruptible.
  • 21. An apparatus comprising: a plurality of processing elements; anda memory comprising instructions to execute on the plurality of processing elements, wherein the instructions, when executed, cause the plurality of processing elements to execute a method for loading verifiably trustable software, the method comprising: causing all but one of the plurality of processing elements to enter into a special halted state as part of a join secure operation;identifying a region in the memory for use in trust measurement;protecting the identified region from access by the processing elements associated with the special halted state;using a signed cryptographic hash of the identified region to verify whether content in the identified region can be trusted;placing the non-halted processing element into a known privileged state; andafter the non-halted processing element has been placed into the known privileged state, generating a signal that causes the processing elements associated with the special halted state to exit the special halted state and resume activity, wherein each of the plurality of processing elements associated with the special halted state exits the special halted state as part of the join secure operation, in response to a signal from the non-halted processing element indicating that a start secure operation is complete, and wherein the join secure operation is performed atomically.
  • 22. The apparatus of claim 21 wherein the method for loading verifiably trustable software further comprises: causing the non-halted processing element to jump to a known entry point in the identified region in the memory.
  • 23. The apparatus of claim 21, wherein the instructions cause the processing elements associated with the special halted state to jump to a known entry point in the region in the memory upon exiting the special halted state.
  • 24. The apparatus of claim 21 wherein identifying the region of the memory comprises receiving a region parameter, the region parameter specifying a location of the region.
  • 25. The apparatus of claim 24 wherein the location comprises a range of addresses in the memory.
  • 26. The apparatus of claim 24 wherein the location comprises a start address and a length of the memory.
  • 27. The apparatus of claim 21 wherein the content is a component of an operating system.
  • 28. The apparatus of claim 27 wherein the component of the operating system is one of a virtual machine monitor and a privileged software nucleus.
  • 29. The apparatus of claim 21 wherein the instructions further cause the apparatus to perform operations comprising: blocking access to the identified region of memory for a duration of time even after the processing elements associated with the special halted state have entered the special halted state when the plurality of processing elements are implemented within a processing system that supports direct memory access (DMA).
  • 30. The apparatus of claim 21 wherein the operations of identifying the region for use in trust measurement and using the signed cryptographic hash of the identified region to verify whether the content can be trusted are uninterruptible.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No. 10/085,839 filed Feb. 25, 2002, now U.S. Pat. No. 7,631,196, the entire contents of which are incorporated herein by reference.

US Referenced Citations (259)
Number Name Date Kind
3699532 Schaffer et al. Oct 1972 A
3996449 Attanasio et al. Dec 1976 A
4037214 Birney et al. Jul 1977 A
4162536 Morley Jul 1979 A
4207609 Luiz et al. Jun 1980 A
4247905 Yoshida et al. Jan 1981 A
4276594 Morley Jun 1981 A
4278837 Best Jul 1981 A
4307447 Provanzano et al. Dec 1981 A
4319233 Matsuoka et al. Mar 1982 A
4319323 Ermolovich et al. Mar 1982 A
4347565 Kaneda et al. Aug 1982 A
4366537 Heller et al. Dec 1982 A
4403283 Myntti et al. Sep 1983 A
4419724 Branigin et al. Dec 1983 A
4430709 Schleupen et al. Feb 1984 A
4521852 Guttag Jun 1985 A
4529870 Chaum Jul 1985 A
4571672 Hatada et al. Feb 1986 A
4621318 Maeda Nov 1986 A
4759064 Chaum Jul 1988 A
4795893 Ugon Jan 1989 A
4802084 Ikegaya et al. Jan 1989 A
4825052 Chemin et al. Apr 1989 A
4843541 Bean et al. Jun 1989 A
4907270 Hazard Mar 1990 A
4907272 Hazard Mar 1990 A
4910774 Barakat Mar 1990 A
4974159 Hargrove et al. Nov 1990 A
4975836 Hirosawa et al. Dec 1990 A
5007082 Cummins Apr 1991 A
5022077 Bealkowski et al. Jun 1991 A
5075842 Lai Dec 1991 A
5079737 Hackbarth Jan 1992 A
5187802 Inoue et al. Feb 1993 A
5230069 Brelsford et al. Jul 1993 A
5237616 Abraham et al. Aug 1993 A
5255379 Melo Oct 1993 A
5276863 Heider Jan 1994 A
5287363 Wolf et al. Feb 1994 A
5293424 Hotley et al. Mar 1994 A
5295251 Wakui et al. Mar 1994 A
5317705 Gannon et al. May 1994 A
5319760 Mason et al. Jun 1994 A
5361375 Ogi Nov 1994 A
5386552 Garney Jan 1995 A
5421006 Jablon et al. May 1995 A
5434999 Goire et al. Jul 1995 A
5437033 Inoue et al. Jul 1995 A
5442645 Ugon et al. Aug 1995 A
5455909 Blomgren et al. Oct 1995 A
5459867 Adams et al. Oct 1995 A
5459869 Spilo Oct 1995 A
5469557 Salt et al. Nov 1995 A
5473692 Davis Dec 1995 A
5479509 Ugon Dec 1995 A
5488716 Schneider et al. Jan 1996 A
5504922 Seki et al. Apr 1996 A
5506975 Onodera Apr 1996 A
5511217 Nakajima et al. Apr 1996 A
5522075 Robinson et al. May 1996 A
5528231 Patarin Jun 1996 A
5533126 Hazard et al. Jul 1996 A
5555385 Osisek Sep 1996 A
5555414 Hough et al. Sep 1996 A
5560013 Scalzi et al. Sep 1996 A
5564040 Kubala Oct 1996 A
5566323 Ugon Oct 1996 A
5568552 Davis Oct 1996 A
5574936 Ryba et al. Nov 1996 A
5582717 Di Santo Dec 1996 A
5604805 Brands Feb 1997 A
5606617 Brands Feb 1997 A
5615263 Takahashi Mar 1997 A
5628022 Ueno et al. May 1997 A
5628023 Bryant et al. May 1997 A
5633929 Kaliski, Jr. May 1997 A
5657445 Pearce Aug 1997 A
5668971 Neufeld Sep 1997 A
5680547 Chang Oct 1997 A
5684948 Johnson et al. Nov 1997 A
5706469 Kobayashi Jan 1998 A
5717903 Bonola Feb 1998 A
5720609 Pfefferle Feb 1998 A
5721222 Bernstein et al. Feb 1998 A
5729760 Poisner Mar 1998 A
5737604 Miller et al. Apr 1998 A
5737760 Grimmer, Jr. et al. Apr 1998 A
5740178 Jacks et al. Apr 1998 A
5752046 Oprescu et al. May 1998 A
5757919 Herbert et al. May 1998 A
5764969 Kahle et al. Jun 1998 A
5796835 Saada Aug 1998 A
5796845 Serikawa et al. Aug 1998 A
5805712 Davis Sep 1998 A
5809546 Greenstein et al. Sep 1998 A
5815665 Teper et al. Sep 1998 A
5825875 Ugon Oct 1998 A
5825880 Sudia et al. Oct 1998 A
5835594 Albrecht et al. Nov 1998 A
5844986 Davis Dec 1998 A
5852717 Bhide et al. Dec 1998 A
5854913 Goetz et al. Dec 1998 A
5867577 Patarin Feb 1999 A
5867658 Lee Feb 1999 A
5872994 Akiyama et al. Feb 1999 A
5890189 Nozue et al. Mar 1999 A
5900606 Rigal May 1999 A
5901225 Ireton et al. May 1999 A
5903752 Dingwall et al. May 1999 A
5919257 Trostle Jul 1999 A
5935242 Madany et al. Aug 1999 A
5935247 Pai et al. Aug 1999 A
5937063 Davis Aug 1999 A
5944821 Angelo Aug 1999 A
5953422 Angelo et al. Sep 1999 A
5953502 Helbig, Sr. Sep 1999 A
5956408 Arnold Sep 1999 A
5970147 Davis Oct 1999 A
5978475 Schneier et al. Nov 1999 A
5978481 Ganesan et al. Nov 1999 A
5978484 Apperson et al. Nov 1999 A
5987557 Ebrahim Nov 1999 A
6014745 Ashe Jan 2000 A
6035374 Panwar et al. Mar 2000 A
6044478 Green Mar 2000 A
6055637 Hudson et al. Apr 2000 A
6058478 Davis May 2000 A
6061794 Angelo May 2000 A
6075938 Bugnion et al. Jun 2000 A
6085296 Karkhanis et al. Jul 2000 A
6088262 Nasu Jul 2000 A
6092095 Maytal Jul 2000 A
6093213 Favor et al. Jul 2000 A
6101584 Satou et al. Aug 2000 A
6108644 Goldschlag et al. Aug 2000 A
6115816 Davis Sep 2000 A
6125430 Noel et al. Sep 2000 A
6131166 Wong-Isley Oct 2000 A
6138239 Veil Oct 2000 A
6148379 Schimmel Nov 2000 A
6158546 Hanson et al. Dec 2000 A
6173417 Merrill Jan 2001 B1
6175924 Arnold Jan 2001 B1
6175925 Nardone et al. Jan 2001 B1
6178509 Nardone Jan 2001 B1
6182089 Ganapathy et al. Jan 2001 B1
6188257 Buer Feb 2001 B1
6192455 Bogin et al. Feb 2001 B1
6199152 Kelly et al. Mar 2001 B1
6205550 Nardone et al. Mar 2001 B1
6212635 Reardon Apr 2001 B1
6222923 Schwenk Apr 2001 B1
6249872 Wildgrube et al. Jun 2001 B1
6252650 Nakaumra Jun 2001 B1
6269392 Cotichini et al. Jul 2001 B1
6272533 Browne et al. Aug 2001 B1
6272637 Little et al. Aug 2001 B1
6275933 Fine et al. Aug 2001 B1
6282650 Davis Aug 2001 B1
6282651 Ashe Aug 2001 B1
6282657 Kaplan et al. Aug 2001 B1
6292874 Barnett Sep 2001 B1
6298443 Colligan et al. Oct 2001 B1
6301646 Hostetter Oct 2001 B1
6307214 Ohtani et al. Oct 2001 B1
6308270 Guthery et al. Oct 2001 B1
6314409 Schneck et al. Nov 2001 B2
6321314 Van Dyke Nov 2001 B1
6327652 England et al. Dec 2001 B1
6330670 England et al. Dec 2001 B1
6339815 Feng Jan 2002 B1
6339816 Bausch Jan 2002 B1
6357004 Davis Mar 2002 B1
6363485 Adams Mar 2002 B1
6374286 Gee et al. Apr 2002 B1
6374317 Ajanovic et al. Apr 2002 B1
6378068 Foster Apr 2002 B1
6378072 Collins et al. Apr 2002 B1
6389537 Davis et al. May 2002 B1
6397242 Devine et al. May 2002 B1
6397379 Yates, Jr. et al. May 2002 B1
6412035 Webber Jun 2002 B1
6421702 Gulick Jul 2002 B1
6435416 Slassi Aug 2002 B1
6445797 McGough et al. Sep 2002 B1
6463535 Drews et al. Oct 2002 B1
6463537 Tello Oct 2002 B1
6473508 Young et al. Oct 2002 B1
6473800 Jerger et al. Oct 2002 B1
6496847 Bugnion et al. Dec 2002 B1
6499123 McFarland et al. Dec 2002 B1
6505279 Phillips et al. Jan 2003 B1
6507904 Ellison et al. Jan 2003 B1
6529909 Bowman-Amuah Mar 2003 B1
6535988 Poisner Mar 2003 B1
6557104 Vu et al. Apr 2003 B2
6560627 McDonald et al. May 2003 B1
6609199 DeTreville Aug 2003 B1
6615278 Curtis Sep 2003 B1
6633963 Ellison et al. Oct 2003 B1
6633981 Davis Oct 2003 B1
6651171 England et al. Nov 2003 B1
6671808 Abbott et al. Dec 2003 B1
6678825 Ellison et al. Jan 2004 B1
6684326 Cromer et al. Jan 2004 B1
6795966 Lim et al. Sep 2004 B1
6804630 Lee et al. Oct 2004 B2
6938164 England et al. Aug 2005 B1
6988250 Proudler et al. Jan 2006 B1
6990579 Herbert et al. Jan 2006 B1
6996710 Ellison et al. Feb 2006 B1
7013481 Ellison et al. Mar 2006 B1
7028149 Grawrock et al. Apr 2006 B2
7036023 Fries et al. Apr 2006 B2
7103529 Zimmer Sep 2006 B2
7103771 Grawrock Sep 2006 B2
7133990 Link et al. Nov 2006 B2
7165181 Brickell Jan 2007 B2
7272831 Cota-Robles et al. Sep 2007 B2
20010021969 Burger et al. Sep 2001 A1
20010027511 Wakabayashi et al. Oct 2001 A1
20010027527 Khidekel et al. Oct 2001 A1
20010037450 Metlitski et al. Nov 2001 A1
20010056533 Yianilos et al. Dec 2001 A1
20020004900 Patel Jan 2002 A1
20020007456 Peinado et al. Jan 2002 A1
20020023032 Pearson et al. Feb 2002 A1
20020023212 Proudler Feb 2002 A1
20020147916 Strongin et al. Oct 2002 A1
20020166061 Falik et al. Nov 2002 A1
20020169717 Challener Nov 2002 A1
20030002668 Graunke et al. Jan 2003 A1
20030018892 Tello Jan 2003 A1
20030037089 Cota-Robles et al. Feb 2003 A1
20030037246 Goodman et al. Feb 2003 A1
20030074548 Cromer et al. Apr 2003 A1
20030093687 Westhoff et al. May 2003 A1
20030112008 Hennig Jun 2003 A1
20030115453 Grawrock Jun 2003 A1
20030126442 Glew et al. Jul 2003 A1
20030126453 Glew et al. Jul 2003 A1
20030159056 Cromer et al. Aug 2003 A1
20030188156 Yasala et al. Oct 2003 A1
20030188179 Challener et al. Oct 2003 A1
20030196085 Lampson et al. Oct 2003 A1
20030226040 Challener et al. Dec 2003 A1
20030231328 Chapin et al. Dec 2003 A1
20030235175 Naghian et al. Dec 2003 A1
20040003324 Uhlig et al. Jan 2004 A1
20040025022 Yach et al. Feb 2004 A1
20040117539 Bennett et al. Jun 2004 A1
20040128345 Robinson et al. Jul 2004 A1
20040128670 Robinson et al. Jul 2004 A1
20040193888 Wiseman et al. Sep 2004 A1
20050021968 Zimmer et al. Jan 2005 A1
20050071677 Khanna et al. Mar 2005 A1
20050132202 Dillaway et al. Jun 2005 A1
20050137889 Wheeler Jun 2005 A1
Foreign Referenced Citations (51)
Number Date Country
4217444 Dec 1992 DE
0473913 Mar 1992 EP
0600112 Jun 1994 EP
0602867 Jun 1994 EP
0892521 Jan 1999 EP
0930567 Jul 1999 EP
0961193 Dec 1999 EP
0965902 Dec 1999 EP
1030237 Aug 2000 EP
1055989 Nov 2000 EP
1056014 Nov 2000 EP
1085396 Mar 2001 EP
1146715 Oct 2001 EP
1209563 May 2002 EP
1271277 Jan 2003 EP
2620248 Mar 1989 FR
2700430 Jul 1994 FR
2714780 Jul 1995 FR
2742618 Jun 1997 FR
2752122 Feb 1998 FR
2763452 Nov 1998 FR
2830147 Mar 2003 FR
2000076139 Mar 2000 JP
200694114 Mar 2006 JP
WO9524696 Sep 1995 WO
WO9729567 Aug 1997 WO
WO9812620 Mar 1998 WO
WO9834365 Aug 1998 WO
WO9844402 Oct 1998 WO
WO9905600 Feb 1999 WO
WO9909482 Feb 1999 WO
WO9918511 Apr 1999 WO
WO9957863 Nov 1999 WO
WO9965579 Dec 1999 WO
0010283 Feb 2000 WO
WO0021238 Apr 2000 WO
WO0062232 Oct 2000 WO
WO0127723 Apr 2001 WO
WO0127821 Apr 2001 WO
WO0163994 Aug 2001 WO
WO0175564 Oct 2001 WO
WO0175565 Oct 2001 WO
WO0175595 Oct 2001 WO
WO0201794 Jan 2002 WO
0215021 Feb 2002 WO
WO0217555 Feb 2002 WO
WO02060121 Aug 2002 WO
WO02086684 Oct 2002 WO
WO03058412 Jul 2003 WO
03073269 Sep 2003 WO
03073269 Sep 2004 WO
Non-Patent Literature Citations (81)
Entry
International Preliminary Examination Report for PCT Application No. PCT/US2003/04612, mailed on Oct. 28, 2004, 7 pages.
Dyer et al., “Building the IBM 4758 Secure Coprocessor”, Computer, IEEE, vol. 34, Issue 10, Oct. 2001, pp. 57-66.
Schneier, “Applied Cryptography—Protocols, Algorithms, and Source Code in C”. Second Edition. John Wiley & Sons, Inc. 1996. pp. 38-39.
Tetrault, ATPM—Review: Virtual PC 4.0. Apr. 2001.
Office Action for U.S. Appl. No. 10/085,839, mailed on Mar. 7, 2006.
Office Action for U.S. Appl. No. 10/085,839, mailed on Jan. 26, 2007.
Office Action for U.S. Appl. No. 10/085,839, mailed on Nov. 26, 2007.
Written Opinion for PCT Application No. PCT/US03/04612, mailed on Sep. 10, 2004, 6 pages.
Tricore User Guide, v1.6.4, Jan. 2003, pp. 22-25, 98-101, 8 pages.
Office Action for German Patent Application No. 10392320.9, mailed on Dec. 1, 2005, 5 pages of Office Action and 5 pages of English Translation, 10 pages.
Office Action for German Patent Application No. 10392320.9, mailed on Jan. 17, 2007, 3 pages of Office Action and 2 pages of English Translation, 5 pages.
Office Action for German Patent Application No. 10392320.9, mailed on Jul. 9, 2008, 1 page of English Translation.
Office Action for German Patent Application No. 10392320.9, mailed on Aug. 31, 2009. 3 pages of Office Action and 4 pages of English Translation, 7 pages.
Examination Report issued for United Kingdom Patent Application No. GB0419314.0, mailed on Dec. 20, 2004, 3 pages.
Non-Final Office Action for U.S. Appl. No. 12/615,475, mailed on Sep. 24, 2010, 22 pages.
Final Office Action for U.S. Appl. No. 12/615,475, mailed on Sep. 22, 2011, 18 pages.
Advisory Action for U.S. Appl. No. 12/615,475, mailed on Dec. 6, 2011; 3 pages.
“Office Action for U.S. Appl. No. 10/185,123, dated Apr. 16, 2007”, 10 pages.
“Office Action for U.S. Appl. No. 10/663,206, dated Apr. 19, 2007”.
“Office Action for U.S. Appl. No. 10/814,569, dated Apr. 5, 2007”, 5 pages.
“PCT Search Report for PCT/US2005/010156, dated Aug. 22, 2006”, 6 pages.
“PCT/US2004/007040 Search Report”, (Mar. 14, 2005), 8 pages.
Ateniese, Giuseppe , et al., “A Practical and Provably Secure Coalition-Resistant Group Signature Scheme”, Advances in Cryptology—CRYPTO2000, vol. 1880 of Lecture Notes in Computer Sciemce, Int'; Assoc for Crypt Res, Spring-Verlag, Berlin, Germany, (2000), 255-270.
Berg, Cliff , “How Do I Create a Signed Applet?”, Dr. Dobb's Journal. (Aug. 1997), 1-9.
Brands, Stefan , “Restrictive Blinding of Secret-Key Certificates”, Springer-Verlag XP002201306, (1995), Chapter 3.
Carvalho, “Subject Domain Organisation and Teaching Strategy for Distance Learning in the UnB Virtual Project”, 2002 IEEE, Retrieved from Internet: http://Ittf.ieee.org/icalt2002/proceedings/t803—icalt042—End.pdf 2002, IEEE, pp. 327-330 (4 pages).
Chien, Andrew A., et al., “Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor”, 7th Annual IEEE Symposium, FCCM '99 Proceedings, XP010359180, ISBN 0-7695-0375-6, Los Alamitos, CA, (Apr. 21, 1999), 209-221.
Compaq Computer Corporation, “Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1a”, XP002272822, (Jan. 25, 2001), 1-321.
Coulouris, George , et al., “Distributed Systems, Concepts and Designs”, 2nd Edition, (1994), 422-424.
Crawford, John , “Architecture of the Intel 80386”, Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD '86), (Oct. 6, 1986), 155-160.
Davida, George I., “Defending Systems Against Viruses through Cryptographic Authentication”, Proceedings of the Symposium on Security and Privacy, IEEE Comp. Soc. Press, ISBN 0-8186-1939-2, (May 1989).
Fabry, R.S. , “Capability-Based Addressing”, Fabry, R.S., “Capability-Based Addressing,” Communications of the ACM, vol. 17, No. 7, (Jul. 1974), 403-412.
Frieder, Gideon , “The Architecture and Operational Characteristics of the VMX Host Machine”, The Architecture and Operational Characteristics of the VMX Host Machine, IEEE, (1982), 9-16.
Goldberg, Robert P., “Survey of Virtual Machine Research”, Computer Magazine, (Jun. 1974), 34-45.
Gong, Li , et al., “Going Behond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2”, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, CA, (Dec. 1997).
Gum, P. H., “System/370 Extended Architecture: Facilities for Virtual Machines”, IBM J. Research Development, vol. 27, No. 6, (Nov. 1983), 530-544.
Hall, Judith S., et al., “Virtualizing the VAX Architecture”, ACM SIGARCH Computer Architecture News, Proceedings of the 18th Annual International Symposium on Computer Architecture, vol. 19, Issue No. 3, Apr. 1991), 10 pages.
Heinrich, Joe , “MIPS R4000 Microprocessor User's Manual, Second Edition”, Chapter 4 “Memory Management”, (Jun. 11, 1993), 61-97.
HP Mobile Security Overview, “HP Mobile Security Overview”, (Sep. 2002), 1-10.
IBM, “Information Display Technique for a Terminate Stay Resident Program IBM Technical Disclosure Bulletin”, TDB-ACC-No. NA9112156, vol. 34, Issue 7A, (Dec. 1, 1991), 156-158.
IBM Corporation, “IBM ThinkPad T30 Notebooks”, IBM Product Specification, located at www.-1.ibm.com/services/files/cisco—t30—spec—sheet—070202.pdf, last visited Jun. 23, 2004, (Jul. 2, 2002), 1-6.
Intel Corporation, “IA-32 Intel Architecture Software Developer's Manual”, vol. 3: System Programming Guide, Intel Corporation—2003, 13-1 through 13-24.
Intel Corporation, “IA-64 System Abstraction Layer Specification”, Intel Product Specification, Order No. 245359-001, (Jan. 2000), 1-112.
Intel Corporation, “Intel 82802AB/82802AC Firmware Hub (FWH)”, Intel Product Datasheet, Document No. 290658-004, (Nov. 2000), 1-6, 17-28.
Intel Corporation, “Intel IA-64 Architecture Software Developer's Manual”, vol. 2: IA-64 System Architecture, Order No. 245318-001, (Jan. 2000), i, ii, 5.1-5.3, 11.1-11.8, 11.23-11.26.
Intel Corporation, “Intel386 DX Microprocessor 32-Bit CHMOS Microprocessor With Integrated Memory Management”, (1995), 5-56.
Karger, Paul. A., et al., “A VMM Security Kernal for the VAX Architecture”, Proceedings of the Symposium on Research in Security and Privacy, XP010020182, ISBN 0-8186-2060-9, Boxborough, MA, (May 7, 1990), 2-19.
Kashiwagi, Kazuhiko , et al., “Design and Implementation of Dynamically Reconstructing System Software”, Software Engineering Conference, Proceedings 1996 Asia-Pacific Seoul, South Korea Dec. 4-7, 1996, Los Alamitos, CA USA, IEEE Comput. Soc, US, ISBN 0-8186-7638-8, (1996).
Lawton, Kevin , et al., “Running Multiple Operating Systems Concurrently on an IA32 PC Using Virtualization Techniques”, http://www.plex86.org/research/paper.txt, (Nov. 29, 1999). 1-31.
Luke, Jahn , et al., “Replacement Strategy for Aging Avionics Computers”, IEEE AES Systems Magazine, XP002190614, (Mar. 1999).
Menezes, Alfred J., et al., “Handbook of Applied Cryptography”, CRC Press Series on Discrete Mathematices and its Applications, Boca Raton, FL, XP002165287, ISBN 0849385237, (Oct. 1996), 403-405, 506-515, 570.
Menezes, Alfred J., et al., “Handbook of Applied Cryptography”, CRC Press LLC, USA, (1997), 22, 28-30.
Micciancio, Daniele , et al., “Efficient and COncurrent Zero-Knowledge from any public coin HVZK protocol”, Retrieved from the Internet on Sep. 2, 2004: URL:http://eprint.iarc.org/2002/090.pdf>; XP-002313884; 20 pages; published Jul. 8, 2002, 20 pages.
Motorola, “M68040 User's Manual”, (1993), 1-1 to 8-32.
Nanba, S. , et al., “VM/4: ACOS-4 Virtual Machine Architecture”, VM/4: ACOS-4 Virtual Machine Architecture, IEEE, (1985), 171-178.
P16436PCT, PCT Search Report & Written Opinion mailed Mar. 14, 2005 for PCT Application No. PCT/US2004/007040, 23 pages.
Prabhakaran, Manoj , et al., “Concurrent Zero Knowledge Proffs with Logarithimic Round-Complexity”, Retrieved from the Internet on Sep. 22, 2004: URL:http://eprint.iacr.org/2002/055.pdf>; XP002313883; Published on May 6, 2002; 20 pages.
Richt, Stefan , et al., “In-Circuit-Emulator Wird Echtzeittauglich”, Elektronic, Franzis Verlag GMBH, Munchen, DE, vol. 40, No. 16, XP000259620, (Aug. 6, 1991), 100-103.
Robin, John S., et al., “Analysis of the Pentium's Ability to Support a Secure Virtual Machine Monitor”, Proceedings of the 9th USENIX Security Symposium, XP002247347, Denver, Colorado, (Aug. 14, 2000), 1-17.
Rosenberg, Jonathan B., “How Debuggers Work (Algorithms, Data Structures, and Architecture”, Chapters 3 and 5 Hardware Debugger Facilities, Wiley Computer Publishing, United States, (1996), pp. 42-43, 95, 96 and 99.
Rosenblum, M. , “Virtual Platform: A Virtual Machine Monitor for Commodity PC”, Proceedings of the 11th Hotchips Conference, (Aug. 17, 1999), 185-196.
RSA Security, “Hardware Authenticators”, www.rsasecurity.com/node.asp?id=1158, 1-2.
RSA Security, “RSA SecurID Authenticators”, www.rsasecurity.com/products/securid/datasheets/SID—DS—0103.pdf, 1-2.
RSA Security “Software Authenticators”, www.srasecurity.com/node.asp?id=1313, 1-2.
Saez, Sergio , et al., “A Hardware Scheduler for Complex Real-Time Systems”, Proceedings of the IEEE International Symposium on Industrial Electronics, XP002190615, (Jul. 1999), 43-48.
Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002939871; ISBN 0471117099, (Oct. 1995), 47-52.
Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002138607; ISBN 0471117099, (Oct. 1995), 56-65.
Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code C”, Wiley, John & Sons, Inc., XP0021111449; ISBN 0471117099, (Oct. 1995), 169-187.
Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, 2nd Edition: Wiley, John & Sons, Inc., XP002251738; ISBN 0471128457, (Nov. 1995), 28-33; 176-177; 216-217; 461-473; 518-522.
Sherwood, Timothy , et al., “Patchable Instruction ROM Architecture”, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA, (Nov. 2001).
Tung, Brian , “The Moron's Guide to Kerberos, Version 1.2.2”, Published Dec. 2006; Retrieved from the Internet on Oct. 4, 2006: http://www/web.archive.org/web/20000815233731/http://www.is.edu/˜brian/security/kerberos.html.; 11 pages.
Wenisch, Thomas F., “Store-Ordered Streaming of Shared Memory”, Proceedings of the 14th Int'l Conference on Parallel Architectures and Compilation Techniques (PACT'05) Sep. 2005, IEEE, pp. 75-84, (2005), 10 pages.
Zemor, Gilles , “Cours de Cryptography”, Published Nov. 2000; Cassinni, Paris, ISBN 2-844225-020-6; XP002313885; pp. 165-173.
Non Final Office Action for U.S. Appl. No. 12/615,475, mailed Apr. 9, 2012; 13 pages.
Notice of Allowance for U.S. Appl. No. 10/085,839, mailed on Jul. 23, 2009, 8 pages.
Office Action for U.S. Appl. No. 10/085,839, mailed on Feb. 25, 2009, 18 pages.
Office Action for U.S. Appl. No. 10/085,839, mailed on May 21, 2008, 20 pages.
Office Action for U.S. Appl. No. 10/085,839, mailed on Oct. 24, 2008, 19 pages.
Office Action for U.S. Appl. No. 10/085,839, mailed on Sep. 1, 2006, 18 pages.
Office Action for U.S. Appl. No. 12/615,475, mailed on Aug. 10, 2012, 13 pages.
Notice of Allowance mailed Oct. 25, 2012 for U.S. Appl. No. 12/615,475; 7 pages.
Related Publications (1)
Number Date Country
20100058076 A1 Mar 2010 US
Continuations (1)
Number Date Country
Parent 10085839 Feb 2002 US
Child 12615519 US