Some of the embodiments of the invention relate to how processors read and write state data from and to a storage of a computer system. Other embodiments are also described.
Due to various design considerations, some processors may write private-state data to regions in publicly-accessible storage. The format, semantics and location of this private-state may vary between design implementations. In literature describing the processor, such storage regions are often marked as “RESERVED” indicating that their contents should not be read or modified because they contain private-state. Unfortunately, because this data is written to publicly-accessible storage, software applications, operating systems or external agents (e.g., input-output devices) may access the storage region and use the private-state stored therein inappropriately. Access and use of this private-state by such non-approved entities may lead to erroneous and/or undesirable effects for processor and platform manufacturers and end users.
The embodiments of the invention are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings in which like references indicate similar elements. It should be noted that references to “an” embodiment of the invention in this disclosure are not necessarily to the same embodiment, and they mean at least one.
Processor state, as written to a storage, such as memory, during operation of a processor may include two types of information or data. One type is referred to herein as architectural data, while the other is called implementation-specific data (also herein referred to as “private data” or “private-state data”).
Architectural data is state information which is common to all processors of a given class as designated by the manufacturer, i.e. having substantially the same high-level interface between hardware and software. This interface is called the instruction set architecture (ISA). The use of the same ISA on a variety of processor implementations facilitates the ability of software written expressly for one implementation to run on later implementations unmodified.
An ISA defines the state available to software running on the processor, its format and semantics, and available operation interfaces (e.g., instructions, events). Part of this ISA specification describes how the processor may use one or more regions in the machine's storage (e.g., memory) to facilitate its operations. These storage regions may be accessible to software and other devices in the data processing machine in which the processor resides (e.g., input-output devices, etc.). The processor may use these storage regions to store both architectural and private-state data.
For example, consider processors that have the ISA of the Intel® Pentium® processor as manufactured by Intel Corporation, herein referred to as the IA-32 ISA. The processor may utilize regions in storage during certain operations. For example, when an IA-32 ISA processor enters system management mode, it stores various values to a region of storage called the system management (SMM) state save area. A variety of architectural data is stored (e.g., various machine registers such as ESI, EBP, etc.) in locations and formats which are specified in documentation for the ISA. Additionally, a variety of private data is stored to the system management state save area. In documentation for the ISA, these private-state areas are labeled “Reserved”; the contents, format and semantics of this private data are not specified in the ISA documentation. These “reserved” regions of storage are referred to herein as “private-state regions”.
Different processors may be designed to have different private-state data, also herein called “private data”. This may be done, for example, to improve performance or reduce manufacturing cost. For example, new internal registers may be added, some of the old ones may be used differently, and the format or location of their content that is to be written to storage may be changed for greater efficiency. As a result, the private data for these more recent processors will be different, in content, format, semantics or location, from those of the older versions.
Difficulty can arise when private-state data is stored in publicly-accessible areas such as main memory or other storage. Here it is possible for software such as, for example, the basic input-output system (BIOS), operating systems, virtual machine manager or hypervisor, device drivers, or applications and hardware such as I/O devices or other external agents to access (i.e., read and/or write) this private-state data. Use of this private-state data by such entities may lead to erroneous and/or undesirable effects for processor and platform manufacturers and end users. For example, if an application depends on particular private-state data available in one processor implementation, it might function incorrectly when the application is run on a different processor implementation which implements the private-state differently (or does not implement it at all). Software that depends on private data may also fail due to internal processor-to-memory coherency behaviors/policies that change from implementation to implementation. Software reliance on private-state data may complicate and/or hobble implementation alternatives available to the processor manufacturer with regard to private-state usage. Therefore, processor manufacturers often document such private data (and its storage in memory regions) as RESERVED, indicating that it is subject to change in future implementations.
The above-mentioned ability to run old software on a newer machine assumes that the old software did not improperly access a machine's private data (which can change with newer versions of the machine). However, it has been found that software developers are writing application and operating system programs that do the opposite, namely accessing and relying upon private data, as it is stored in, for example, main memory. This creates a problem because older software may not run properly on a newer machine, even though the newer machine has the same architectural data as the older machine and can still “understand” older mechanisms for accessing stored state data (e.g., load and store instructions as defined in the ISA). That is because some or all of the private data may have changed in the newer machine, causing software to function incorrectly. In addition, the manufacturer may be reluctant to add improvements to future versions of its processor because doing so would risk incompatibility problems with older software.
According to an embodiment of the invention, a data processing machine and a method of operation are described which may discourage a software developer from writing software that relies upon private-state data (e.g., a certain value, its location, its semantics or its format) that is stored in a publicly-accessible region of storage. This may allow future versions of the machine to exhibit different behavior with respect to private data that may be needed as the machine's internal hardware design evolves, yet still exhibit the same ISA needed to run older software.
Some embodiments of the invention may encourage use of architected interfaces to data stored as private-state data. For example, instructions may be provided to access data that may be stored as private-state data by specifying the identity of the data to be accessed, rather than the location of the data within the private-state data region. This allows implementation freedom in how the data is stored (e.g., within the private-state region) while providing an architectural mechanism to access the data. For example, suppose that a data element stored in the system management state save area of the IA-32 ISA (as described above) is the value of the CS segment base address. The storage location of this data element within the state save area is not detailed in the ISA specification. Instead, an instruction may be provided by the ISA which indirectly addresses the data. The data element may be encoded and stored in the state save area in any manner that a processor implementation desires (or it may not be stored in the private-state area in memory at all, and instead retained in, for example, a special register or location within the processor).
The invention permits private-state data to be encoded in a manner that thwarts speedy software decode of the data as compared with the prescribed, architected interfaces. Embodiments of the invention may vary the encoding complexity depending on the target processor and platform. Once the target processor is known, one skilled in the art can choose an embodiment of the invention that ensures that software-based methods to decode the chosen encoding take longer than using the prescribed interfaces (e.g., instructions). For example, non-prescribed software methods may be able to decode certain private-state data in 400 clocks (e.g., using certain instructions and algorithms) while architecturally prescribed instructions and methods would work in a fraction of that time. An embodiment of the invention lies in the use of certain metrics to measure the cost of private state decode, including, for example, the metrics of time (speed) and power consumption.
Herein the term “encoding” includes concepts such as encrypting, ciphering, formatting, or the assignment or interpretation of specific bit patterns. Encodings by embodiments of this invention are said herein to “obfuscate” the private data.
Referring now to
Processor 110 can be any type of processor capable of executing software, such as a microprocessor, digital signal processor, microcontroller, or the like. The processor 110 may include microcode, programmable logic or hard-coded logic for performing the execution of certain method embodiments of the present invention. Though
The one or more I/O devices 140 may be, for example network interface cards, communication ports, video controllers, disk controllers, system buses and controllers (e.g., PCI, ISA, AGP) or devices integrated into the platform chipset logic or processor (e.g., real-time clocks, programmable timers, performance counters). Some or all of the I/O devices 140 may have direct memory access (DMA) capability, allowing them to read and/or write the storage 130 independent of, or under the control of, the processor 110 or software 120.
Storage 130 can be a hard disk, a floppy disk, random-access memory (RAM), cache memory, read-only memory (ROM), flash memory, static random access memory (SRAM), any combination of the above devices, or any other type of storage medium accessible by processor 110. Storage 130 may store instructions and/or data for performing the execution of method embodiments of the present invention. The storage 130 may be a publicly accessible area of a register file of the processor, or it may be an area outside of the processor such as main memory.
Data about a state of the machine 112, such as the contents of certain internal registers 114, is written to a private-state region 132 in storage 130, where the state data as written is “encoded” or “obfuscated.” Thus, although the location where the state data is written is public in that it may be accessed by I/O devices 140 or software 120 (e.g., operating system 122, application software 124) running on the platform hardware 102, the encoding makes it difficult for the state data to be reverse engineered (i.e., decoded) in a timely manner. When the state data is to be recovered from the storage 130, a specified decode process, e.g. a processor-initiated decode process defined by the manufacturer of the processor, is applied. Control over the decode process may be linked to specific processor functions, such as specific instructions and control signals, as discussed below. Non-prescribed methods (alternate software instructions and algorithms) for accessing the state data would not activate these controls and accordingly may be more costly.
The recovered state data may then be placed into the local state 112, which may or may not be accessible to software 120 or I/O devices 140. The local state 112 may be, for example, a region in an internal cache or registers which are not available for ungoverned access through the instruction set architecture (ISA). In some cases local state is not accessible by software or other external agents (e.g., I/O devices). In some cases, some or all of the local state is accessible to software or other external agents. In other cases local state may be indirectly accessible through specific interfaces (e.g., instructions). Because it is internal to the processor and not in “public” storage, the processor can strictly dictate access to the local state.
Although the state data as written to the publicly accessible area of the storage 130 is in an encoded form, a manufacturer-defined instruction that may be part of the ISA for the processor may be used by software to recover the data from the storage 130. The encoding should be strong enough so as to discourage software developers from circumventing such an instruction, when seeking to access the state data. An example of the internal logic needed for reading or recovering the state data from storage, using a micro-operation or hardware control signal, will be described below with reference to
In one embodiment, the encoding process used need only be strong enough to cause an author of software 120 to apply, in writing the software, a technique that may be prescribed by a manufacturer of the processor for accessing the state data from memory, rather than circumventing the technique. In other cases, the encoding may be stronger if the manufacturer intends to make it even more difficult for the software developer to access and rely upon the state data (including a certain value, its location, its semantics or its format) that is in memory.
Control signals used to control the encoding and decoding of the private-state may be coupled with or accessed by, for example, hardware state machines, processor instructions (also known as macro instructions), operational modes (e.g., PAL modes) or mode bits or operational groups of instructions, microcode or microcode operations (uops), and hardware control signals or events.
Various types of encoding processes may be used. The data written to the private-state region of storage may be changed prior to storage. This type of encoding process is called data encoding. Alternatively, the addresses used to access private-state in private-state regions may be changed. This type encoding process is called address obfuscation and the transformation from the original address to the obfuscated address is referred to as address mapping. Data encoding and address obfuscation are described below.
Encoding processes may be either static or dynamic. Static encodings do not change over time as a machine is running (and performing the encoding processes). (Static encodings may change or be reconfigured during the processor initialization/reset or boot phase, but not afterwards during running operation.) A process that generates static encodings is called static obfuscation. Alternatively, the encoding process may produce encoding results which change over time while the processor is running. These processes are referred to herein as dynamic obfuscation.
For example, a storage format of the contents of a given element of private-state, as written in the storage 130, may change while the machine is executing. This is referred to herein as dynamic obfuscation. For example, the format may change between big-endian and little-endian according to a random or pseudo-random sequence (which the processor generates and tracks), whenever the state data needs to be written to storage; this change may only affect the memory region(s) to which the private data is read and written. Again, the intent here is to make it difficult to quickly reverse engineer and decode the state data from a region of storage that is publicly accessible in storage 130.
In an embodiment, when private-state data is to be written to storage, it is written to a region of storage (e.g., main memory) with contiguous addresses. In other embodiments the private data region is non-contiguous, consisting of more than one distinct regions of storage. There is no requirement that the encoding fully populate the private-state region; i.e., some bits or bytes may remain unused. Some freedom in designing the encoding and/or obfuscation functions may be obtained by changing the private-state region size, by, for example, making it bigger than strictly required to store the private data. (For example, this would permit, as described later, larger MISR (multi-input shift register) polynomials to be used.)
In an embodiment of the invention, a multi-byte (e.g., 32-bit “long” integer) value of state data is split into several parts which are then stored in non-contiguous locations, rather than all in sequence. Thus, a 4-byte value may be split into four 1-byte values that are stored in non-contiguous locations within a private-state region. The locations at which the four 1-byte values are stored may change dynamically and in a random way while the machine is operating. Of course, the embodiment should be able to locate and decode such data. Note that the ISA may impose certain requirements regarding atomicity of the accesses in cases where single data values are stored or loaded using multiple memory accesses.
In an embodiment of the invention, the address bits used to access storage are encoded. This encoding of address bits may change address bit ordering (or groups of address bits). An example of this might be switching from little-endian to big-endian formats within a given memory region. Other address mixing mappings are possible, some involving more elaborate transformations.
Another type of address encoding maps a set of K unique addresses to another set of K unique addresses; that is, mathematically the mapping is bijective (both injective (one-to-one) and surjective (onto)). Here, the upper address bits may remain unchanged, while the lower-order address bits are modified. In such cases it is possible to construct mappings that map a given memory range back onto itself. That is, the base address offset of the memory range is the same and the memory region size is the same. This is an attractive solution because only the data within the memory range is “obfuscated”. That is, only the address bits within the range are mixed.
Address obfuscation mechanisms may be easier to use when the private-state regions have sizes or base addresses that are powers of the underlying N-ary logic. Most current processors use binary logic, hence private-state regions with sizes or base addresses that are powers of 2 are preferable. (Herein, binary logic and arithmetic are discussed, but N-ary logic and arithmetic could be used, where appropriate, and are assumed in the general case.) Filters and other mechanisms may be used to manage private-state regions with sizes or base addresses that are not powers of the N-ary logic. Such address bit manipulations can coexist with various memory organizations and virtual memory techniques (e.g., paging, segmentation, etc).
Address obfuscation mechanisms may change the layout of data within the storage, and serve to mix up the data, but sometimes only at granularities of the storage. In most current processors, main memory is byte addressable, hence the location of individual bytes of a data element may be rearranged within the private-state region, but the data bits within individual bytes are not changed by address obfuscation (though they may be altered by data encoding mechanisms).
In these address-mapping embodiments, the original address mappings may be extracted through some decode process. This extraction is the application of the inverse function of the address mapping function. The choice of mapping function may be made in light of this requirement; not all address mapping functions are reversible.
An embodiment of the invention encodes the data bits written to storage. These data encodings may reshape data stored within the private-state region without necessarily being constrained by addressability constraints such as the size of addressable storage. Segments of data may be swapped with other segments of data. For example, two nibbles (i.e., 4-bit segments within a byte) can be swapped within each byte. Data encodings may be bit-wise exclusive-OR'ed with a constant XOR mask. Data may also be bit-wise exclusive-OR'ed with the output of a multi-input feedback shift register (MISR). Data encodings may be made using a cryptographic function. In these embodiments, the original data can be extracted through some decode process. That decode process should ensure that it is faster than decode methods available to software running on the platform (e.g., use of ISA-defined load and store operations, mathematical operations, etc.). The tables 470 and 480 of
Some of the embodiments listed above may be implemented with static mappings. That is, they do not change during the time the processor or platform is running. Suitable mappings may be set at design time, during manufacture, post manufacture, or early in system operation (e.g., during system boot, at system power on, at processor reset). Different processors may or may not be configured with the same static mappings. If mappings are not bound until the system is operational (e.g., at system boot), it is possible for a new mapping to be chosen at each processor boot. In an embodiment, different control sets (e.g., operating modes, groups of instructions) can each use a different mapping configuration. Within a control set, the mapping remains constant. However, between instruction groups or modes, the mappings may (or may not) be distinct.
Other embodiments may be implemented with dynamic mappings that change while the processor is operating. In an embodiment, mapping configurations can only change if there are no outstanding encoded data currently stored in any private-state regions in storage. This embodiment may use a counter that is incremented when encoded data is written to a private-state region of the storage, making it active. The counter is decremented when the private-state region is no longer considered active. When the counter is zero, the mapping configuration may be changed. In an embodiment, the mapping configuration is stored for each private-state region in a mapping descriptor. The mapping descriptor may be stored in a known, un-encoded location within the private-state region itself or maintained separately by a tracking structure such as a queue or look-up table, which may reside inside or outside the processor. In an embodiment, different mappings for each private-state region are possible.
Referring to
An embodiment of the invention uses a microcode-generated or hardware-generated control signal which indicates to the processing logic that the data element requested requires decoding. Absence of this signal causes the NO path to block 250 to be taken.
If the data element is not to be decoded, then processing logic proceeds to processing block 250, where it loads the data element from storage at the address determined in processing block 202. The process may then terminate. The data loaded is not decoded; that is, no address or data decoding is performed. Note that the data read on this path may be ordinary (i.e., is not private-state data) or it may be private-state data in its encoded form (but accessed in a non-prescribed manner).
If, however, the data element is to be decoded, then processing logic next determines the address at which it is stored (the address may be obfuscated) based on the address determined in processing block 202 (processing block 210). Processing logic next loads the encoded data element from storage at the address determined in processing block 210 (processing block 220). Processing logic next decodes the data element loaded from the private-state region of storage in processing step 220 (processing block 230). The decoded value is a result of process 200. The process may then terminate. Often this decoded state is placed in a private state cache or the private, local state of the processor.
Referring to
An embodiment of the invention uses a microcode-generated or hardware-generated control signal to signal the processing logic that the data element being written requires encoding. Absence of this signal causes the NO path to block 350 to be taken.
If the data element is not to be stored in encoded form in a private-state region, then processing logic proceeds to processing block 350, where it stores the data element in unencoded (unmodified) form to storage at the address determined in processing block 302. The process may then terminate. The data written is not encoded.
If, however, the data element is to be stored in encoded form in a private-state region, then processing logic next encodes the data element (processing block 310) and determines an obfuscated address at which to store the data element (processing block 320). Processing logic then stores the now encoded data element to storage at the address determined in processing block 320 (processing block 330). The process may then terminate.
Note that the processing performed in processing block 310 and processing block 320 may be performed in the reverse order, i.e. obfuscation of the address value prior to encoding of the data. Some embodiments will perform one and not both of these processing blocks. Some embodiments may perform the processing blocks in parallel.
Turning now to
In
As described above, the obfuscation of data stored in the encoded private-state region 418 may be achieved in a variety of ways.
The table 470 in
Si(t+1)=Si−1(t)+Ii+(Pi·Sw−1(t)), 1≦i≦w−1
S0(t+1)=I0+(P0·Sw−1(t))
Here the operator “+” represents modulo 2 addition (XOR) and “·” represents modulo 2 multiplication (AND). Parameter “t” represents time (clock ticks), Si the state of the i'th flip-flop, Ii the i'th input vector bit, and Pi the i'th polynomial coefficient. The Pw coefficient is implicitly 1. To achieve the address mixing embodiment of
Primitive polynomials of order w are useful in that they can generate a “maximal sequence”; that is, they can generate all w-bit wide binary combinations or patterns. Primitive polynomials of up to degree 300 (300 bits wide) and even higher orders may be used.
To illustrate the above function, using
Storage and recovery of the encoded private-state data in memory 408, as shown in
An address generation unit (AGU) 504 receives a special micro-operation and, in this embodiment, computes a logical address having a high component and a low component. In an embodiment, the logical address is a virtual address. In another embodiment, as shown in
An address obfuscation/encoding unit 514 is to receive in this embodiment the low portion of the linear address value that is associated with the given private-state data of the processor. In response, the address obfuscation unit 514 translates this low component of the linear address to provide another portion of the physical address 509. The value of this portion of the physical address is a mixed or encoded version of the linear address, as described above with reference to
In an embodiment, the special micro-operation or uop signal (control signal) determines if the address encoding unit 514 is to encode the low-order address bits. If the control signal is not asserted, the low-order address bits can pass through un-encoded, or bypassing the unit 514. Even when the encoding control signal (or signals) are asserted, some address bits may pass though un-encoded. This might occur, for example, if only a subset of the address bits need encoding when the private-state memory region is smaller than the address space size addressable by the low-order bits. Other embodiments exist where address encoding occurs after linear-to-physical address translation and therefore can handle encodings of address spaces that are larger than a virtual-memory page. An advantage of the embodiment shown in
The high component of the physical address (generated by the TLB 508) and the low component of the physical address (generated by the address obfuscation/encoding unit 514) when concatenated, produce physical address 509, which points to the actual location in the memory 408 where the given state data is stored. The physical address 509 is, in this embodiment, first applied to the cache 410 and if this results in a miss, the contents of the location are fetched from the memory 408 or stored to memory 408 (depending on whether the operation is a load or store). Other arrangements of the memory hierarchy are possible.
Note that in this embodiment, a region that has been designated in the memory 408 for storage of the private-state data may occupy only a portion of a page, and may be aligned to a virtual memory page boundary. In that case, only the page-offset portion of the linear address (that is the low portion of the linear address), is passed through the address obfuscation/encoding unit 514, to produce the encoded physical page offset. Other implementations are possible. In addition, the address obfuscation/encoding unit 514 may contain range-selection logic, so that only addresses within specific regions of memory are encoded. With this logic, the storage region may not be required to be aligned to a virtual memory page boundary or, as discussed earlier, a power of 2 in size. Internally, the address obfuscation/encoding unit 514 may be implemented using microcode, software, lookup tables, fixed-function logic, programmable logic or any combination of these techniques (see
Still referring to
In some embodiments, special instructions may be provided in the processor's ISA for accessing some or all of the private-state data. These instructions when executed may result in the transfer of un-encoded data from the private-state area 516 (see
Although the above-described mechanism has logic components that are implemented inside a processor device, other organizations are possible in which some or all of the encoding logic is implemented in the system chipset, for example. In addition, special bus cycles may be defined for accessing the private-state region 418 of the memory 408 (
Turning now to
The logic diagram of
In
As described above, the mask register 610 and polynomial control register 604 may be changed dynamically at run time. For example, the values that are loaded may be derived from a pseudo-random data source during power-on reset processing. This may thwart attempts to access private-state data or to circumvent any prescribed access methods (such as a special ISA instructions described above).
The encoding of the content values of the private-state data may be accomplished in a way similar to those described above for address obfuscation. One approach is to XOR-in the logical address offsets (for aligned regions of private-state data), or XOR-in some constant seed value, with the contents of a given element of private-state to be encoded. A more sophisticated encoding mechanism may be used on a stream of private-state data values. A variant of a feedback shift register technique (linear, non-linear, multi-input, etc.) may be used with an initial seed. The initial seed is defined to be the initial state loaded into the feedback shift register. For each data value in succession, the shift register may be advanced and its contents bit-wise XOR-ed to the contents of the internal register. This is referred to as a Vigenre cipher and an example of this is shown in tables 470,480 of
In an embodiment of the invention, the processor may make use of the private-state region 132 in storage (see
In an embodiment of the invention, the processor may make use of the private-state region 132 in storage at any time after designation of the private-state region. For example, in a virtual machine system, the VMM may allocate a region in storage for the processor's use during virtual machine operation. The VMM may indicate the location of the private-state region to the processor (e.g., through executing an instruction defined in the ISA). After the processor receives this indication, it may be free to utilize the private-state region as it sees fit. For example, the processor may access the private-state region during transitions between a VM and the VMM (i.e., at mode switch points). Additionally, the processor may access the region during operation of a VM or the VMM. For example, the processor may access control information from the private-state region or the processor may store temporary values in the private-state region.
The ISA may also provide a mechanism by which the VMM may designate that a private-state region should no longer be used (e.g., by executing an instruction). In other embodiments, private-state regions may be designated using other methods. For example, a private-state region may be designated by writing to model-specific registers (MSRs), executing instructions in the ISA, writing to locations in storage, etc.
Although the above examples may describe embodiments of the present invention in the context of execution units and logic circuits, other embodiments of the present invention can be accomplished by way of software. For example, in some embodiments, the present invention may be provided as a computer program product or software which may include a machine or computer-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform a process according to an embodiment of the invention. In other embodiments, operations might be performed by specific hardware components that contain microcode, hardwired logic, or by any combination of programmed computer components and custom hardware components.
Thus, a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer), but is not limited to, floppy diskettes, optical disks, Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks, Read-Only Memory (ROMs), Random Access Memory (RAM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), magnetic or optical cards, flash memory, a transmission over the Internet, electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.) or the like.
Further, a design may go through various stages, from creation to simulation to fabrication. Data representing a design may represent the design in a number of manners. First, as is useful in simulations, the hardware may be represented using a hardware description language or another functional description language. Additionally, a circuit level model with logic and/or transistor gates may be produced at some stages of the design process. Furthermore, most designs, at some stage, reach a level of data representing the physical placement of various devices in the hardware model. In the case where conventional semiconductor fabrication techniques are used, data representing a hardware model may be the data specifying the presence or absence of various features on different mask layers for masks used to produce the integrated circuit. In any representation of the design, the data may be stored in any form of a machine-readable medium. An optical or electrical wave modulated or otherwise generated to transmit such information, a memory, or a magnetic or optical storage such as a disc may be the machine readable medium. Any of these mediums may “carry” or “indicate” the design or software information. When an electrical carrier wave indicating or carrying the code or design is transmitted, to the extent that copying, buffering, or re-transmission of the electrical signal is performed, a new copy is made. Thus, a communication provider or a network provider may make copies of an article (a carrier wave) embodying techniques of the present invention.
In the foregoing specification, the invention has been described with reference to various techniques for accessing data about the state of a data processing machine from publicly accessible storage. It will, however, be appreciated that various modifications and changes may be made thereto without departing from the broader spirit and scope of embodiments of the invention, as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
This application is a continuation of U.S. patent application Ser. No. 13/413,176, filed Mar. 6, 2012, entitled “ACCESSING PRIVATE DATA ABOUT THE STATE OF A DATA PROCESSING MACHINE FROM STORAGE THAT IS PUBLICLY ACCESSIBLE” which is a continuation of U.S. patent application Ser. No. 10/724,321, filed Nov. 26, 2003, entitled “ACCESSING PRIVATE DATA ABOUT THE STATE OF A DATA PROCESSING MACHINE FROM STORAGE THAT IS PUBLICLY ACCESSIBLE”, which issued on Apr. 10, 2012, as U.S. Pat. No. 8,156,343, the content of which is hereby incorporated by reference.
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 | Feb 1984 | A |
4521852 | Guttag | Jun 1985 | A |
4558176 | Arnold et al. | Dec 1985 | A |
4571672 | Hatada et al. | Feb 1986 | A |
4630269 | Gershenson et al. | Dec 1986 | A |
4759064 | Chaum | Jul 1988 | A |
4795893 | Ugon | Jan 1989 | A |
4802084 | Ikeqaya et al. | Jan 1989 | A |
4825052 | Chemin et al. | Apr 1989 | A |
4907270 | Hazard | Mar 1990 | A |
4907272 | Hazard et al. | Mar 1990 | A |
4910774 | Barakat | Mar 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 |
5091846 | Sachs et al. | Feb 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 |
5287363 | Wolf et al. | Feb 1994 | A |
5293424 | Holte 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 | Blomqren 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 |
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 | 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 |
5633929 | Kaliski, Jr. | May 1997 | A |
5655125 | Cloud et al. | Aug 1997 | A |
5657445 | Pearce | Aug 1997 | A |
5668971 | Neufeld | Sep 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 |
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 |
5860028 | Pecore | Jan 1999 | A |
5867577 | Patarin | Feb 1999 | A |
5872994 | Akiyama et al. | Feb 1999 | A |
5890189 | Nozue et al. | Mar 1999 | A |
5900606 | Rigal et al. | 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 |
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 |
5987557 | Ebrahim | Nov 1999 | A |
5987572 | Weidner et al. | 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 et al. | 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-Insley | 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 et al. | 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 | Nakamura | Jun 2001 | B1 |
6269392 | Cotichini et al. | Jul 2001 | B1 |
6272533 | Browne | 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 |
6289438 | Takayanagi | Sep 2001 | B1 |
6292874 | Barnett | Sep 2001 | B1 |
6301646 | Hostetter | Oct 2001 | B1 |
6308270 | Guthery | 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 et al. | Jan 2002 | B1 |
6339816 | Bausch | Jan 2002 | B1 |
6357004 | Davis | Mar 2002 | B1 |
6363485 | Adams et al. | Mar 2002 | B1 |
6374286 | Gee et al. | Apr 2002 | B1 |
6374317 | Ajanovic et al. | Apr 2002 | B1 |
6378068 | Foster et al. | 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 | McGouqh | Sep 2002 | B1 |
6463535 | Drews | Oct 2002 | B1 |
6463537 | Tello | Oct 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 |
6678825 | Ellison et al. | Jan 2004 | B1 |
6684326 | Cromer et al. | Jan 2004 | B1 |
6779114 | Chow et al. | Aug 2004 | B1 |
6986028 | Ehlig et al. | Jan 2006 | B2 |
6986052 | Mittal | Jan 2006 | B1 |
6996725 | Ma et al. | Feb 2006 | B2 |
7076667 | Gama et al. | Jul 2006 | B1 |
7149878 | Jensen et al. | Dec 2006 | B1 |
7302516 | Hanaki | Nov 2007 | B2 |
7523111 | Walmsley | Apr 2009 | B2 |
20010018736 | Hashimoto et al. | Aug 2001 | A1 |
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 |
20020007456 | Peinado et al. | Jan 2002 | A1 |
20020023032 | Pearson et al. | Feb 2002 | A1 |
20020147916 | Strongin et al. | Oct 2002 | A1 |
20020166061 | Falik et al. | Nov 2002 | A1 |
20020169717 | Challener | Nov 2002 | A1 |
20030018892 | Tello | Jan 2003 | A1 |
20030055928 | Machida | Mar 2003 | A1 |
20030061385 | Gonze | Mar 2003 | A1 |
20030074548 | Cromer et al. | Apr 2003 | A1 |
20030097551 | Fuller, III et al. | May 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 |
20030163718 | Johnson et al. | Aug 2003 | A1 |
20030188179 | Challener et al. | Oct 2003 | A1 |
20030196085 | Lampson et al. | Oct 2003 | A1 |
20040042498 | Furuness et al. | Mar 2004 | A1 |
20040117539 | Bennett et al. | Jun 2004 | A1 |
Number | Date | Country |
---|---|---|
1309351 | Aug 2001 | CN |
4217444 | Dec 1992 | DE |
0473913 | Mar 1992 | EP |
0600112 | Jun 1994 | EP |
0700002 | Mar 1996 | EP |
1126356 | Mar 1996 | 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 |
1126356 | Aug 2001 | EP |
1146715 | Oct 2001 | EP |
1271277 | Jan 2003 | EP |
2000076139 | Mar 2000 | JP |
2001-230770 | Aug 2001 | JP |
2001-318787 | Nov 2001 | JP |
2002-232417 | Aug 2002 | JP |
2003-051819 | Feb 2003 | JP |
2003-108442 | Apr 2003 | JP |
9524696 | Sep 1995 | WO |
9729567 | Aug 1997 | WO |
9812620 | Mar 1998 | WO |
9834365 | Aug 1998 | WO |
9844402 | Oct 1998 | WO |
9905600 | Feb 1999 | WO |
9909482 | Feb 1999 | WO |
9918511 | Apr 1999 | WO |
9957863 | Nov 1999 | WO |
9965579 | Dec 1999 | WO |
0021238 | Apr 2000 | WO |
0062232 | Oct 2000 | WO |
0127723 | Apr 2001 | WO |
0127821 | Apr 2001 | WO |
0163994 | Aug 2001 | WO |
0175564 | Oct 2001 | WO |
0175565 | Oct 2001 | WO |
0175595 | Oct 2001 | WO |
02086684 | Oct 2001 | WO |
0201794 | Jan 2002 | WO |
0217555 | Feb 2002 | WO |
02060121 | Aug 2002 | WO |
03058412 | Jul 2003 | WO |
2005055024 | Jun 2005 | WO |
Entry |
---|
Saez, Sergio et al., “A Hardware Scheduler for Complex Real-Time Systems”, Proceedings of the IEEE International Symposium on Industrial Electronics, XP002190615, Jul. 1999, pp. 43-48. |
Sherwood, Timothy, et al., “Patchable Instruction ROM Architecture”, Department of Computer Science and Engineering, University of California. San DieaoLa Jolla CA Nov. 2001. |
IA-32 Intel® Architecture Software Developer's Manual, vol. 3: System Programming Guide, Intel Corporation—2003 (pp. 13-1 through 13-24). |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on Jun. 8, 2007, 3 pages of English Translation only. |
Office Action Received for Japanese Patent Application No. 2011-000154, mailed on Jan. 17, 2012, 3 pages of Japanese Office Action and 1 page of English Translation. |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on Nov. 1, 2012, 5 pages of Office Action and 6 pages of English Translation. |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on Mar. 21, 2013, 3 pages of Chinese Office Action and 4 pages of English Translation. |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on Jan. 8, 2010, 6 pages of Chinese Office Action and 8 pages of English Translation. |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on May 8, 2009, 11 pages of Chinese Office Action and 5 pages of English Translation. |
Office Action Received for German Patent Application No. 11 2004002259.2, mailed on Feb. 9, 2007, 2 pages of German Office Action and 2 pages of English Translation. |
Office Action Received for German Patent Application No. 11 2004 002 259.2, mailed on Sep. 8, 2008, 3 pages of German Office Action and 3 pages of English Translation. |
Office Action Received for German Patent Application No. 11 2004 002 259.2, mailed on Jul. 20, 2009, 3 pages of German Office Action and 3 pages of English Translation. |
Office Action Received for Korean Patent Application No. 10-2006-7010203, mailed on Apr. 10, 2008, 3 pages of Korean Office Action and 2 pages of English Translation. |
Office Action Received for Korean Patent Application No. 10-2006-7010203, mailed on May 11, 2009, 4 pages of Korean Office Action and 3 pages of English Translation. |
Office Action Received for Korean Patent Application No. 10-2006-7010203, mailed on Oct. 8, 2007, 3 pages of Korean Office Action and 2 pages of English Translation. |
Office Action Received for Korean Patent Application No. 10-2006-7010203, mailed on Dec. 19, 2008, 2 pages of Korean Office Action and 2 pages of English Translation. |
Office Action Received for Japenese Patent Application No. 2006-541379, mailed on Sep. 29, 2009, 6 pages of Japenese Office Action and 6 pages of English Translation. |
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2004/038734, mailed on Jun. 8, 2006, 7 pages. |
Office Action Received for German Patent Application No. 11 2004 002 259.2, mailed on Nov. 30, 2010, 1 page of German Office Action. |
European Patent Office, International Search Report and Written Opinion for International Application No. PCT/US2004/038734, 11 pages, May 25, 2005. |
Coulouris, George et al., “Distributed Systems, Concepts and Designs”, 2nd Edition, 1994, pp. 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, pp. 155-160. |
Fabry, RS., “Capability-Based Addressing”, Fabry RS, “Capability-Based Addressino” Communications of the ACM vol. 17 No. 7, Jul. 1974, pp. 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, pp. 9-16. |
HP Mobile Security Overview, “HP Mobile Security Overview”, Sep. 2002, 1-10. |
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), pp. 1-6. |
Intel Corporation, “IA-64 System Abstraction Layer Specification”, Intel Product Soecification Order No. 245359-001, Jan. 2000, pp. 1-112. |
Intel Corporation, “Intel 82802AB/82802AC Firmware Hub (FWH)”, Intel Product Datasheet Document No. 290658-004, Nov. 2000, pp. 1-6 and 17-28. |
Intel Corporation, “IntelIA-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. |
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, pp. 403-405, 506-515 and 570. |
Nanba, S. , et al., “VM/4: ACOS-4 Virtual Machine Architecture”, VM/4: ACOS 4 Virtual Machine Architecture IEEE, 1985, pp. 171-178. |
RSA Security “Hardware Authenticators”, pp. 1-2. |
RSA Security, “RSA SecurID Authenticators”, pp. 1-2. |
Schneier, Bruce, “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley John & Sons Inc. XP002939871, ISBN 0471117099, Oct. 1995, pp. 47-52. |
Schneier, Bruce, “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley John & Sons Inc. XP002939871, ISBN 0471117099, Oct. 1995, 47-52 Code in C, Wiley John & Sons Inc. XP002138607, ISBN 0471117099, Oct. 1995, pp. 56-65. |
Schneier, Bruce, “Applied Cryptography: Protocols, Algorithms, and Source Code C”, Wiley John & Sons Inc. XP0021111449; ISBN 0471117099, Oct. 1995, pp. 169-187. |
Schneier, Bruce, “Applied Cryptography: Protocols, Algorithms, and Source Code in C”, 2nd Edition' Wiley John & Sons Inc. XP002251738; ISBN 0471128457, Nov. 1995, pp. 28-33, 176-177, 216-217, 461-473 and 518-522. |
Berg, Cliff, “How Do I Create a Signed Applet?”, Dr. Dobb's Journal., Aug. 1997, pp. 1-9. |
Brands, Stefan, “Restrictive Blinding of Secret-Key Certificates”, Springer-Verlag XP002201306, 1995, Chapter 3. |
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, pp. 209-221. |
Compaq Computer Corporation, et al., “Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1a”, Dec. 2001, pp. 1-321. |
Davida, George I., et al., “Defending Systems Against Viruses through Cryptographic Authentication”, Proceedings of the Symposium on Security and Privacy. IEEE Compo Soc. Press, ISBN 0-8186-1939-2, May 1989. |
Goldberg, Robert P., “Survey of Virtual Machine Research”, Computer Maaazine, Jun. 1974, pp. 34-35. |
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 Technoloaies 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. |
Heinrich, Joe, “MIPS R4000 Microprocessor User's Manual, Second Edition”, Chaoter 4 “Memory Management” Jun. 11, 1993, pp. 61-97. |
IBM, “Information Display Technique for a Terminate Stay Resident Program IBM,” Information Display Technique for a Terminate Stay Resident Program 7A Dec. 1, 1991 , pp. 156-158. |
Intel, “Intel386 DX Microprocessor 32-Bit CHMOS Microprocessor With Inteorated Memory Management”, 1995, pp. 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 Boxborouah MA, May 7, 1990, pp. 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. |
Lawton, Kevin, et al., “Running Multiple Operating Systems Concurrently on an IA32 PC Using Virtualization Techniques”, htto:/lwww.olex86.ora/research/oaoer.txt Nov. 29, 1999, pp. 1-31. |
Luke, Jahn , et al., “Replacement Strategy for Aging Avionics Computers”, IEEE AES Systems Magazine XP002190614, Mar. 1999. |
Menezes, Oorschot, “Handbook of Applied Cryptography”, CRC Press LLC, USA XP002201307, 1997, p. 475. |
Motorola, “M68040 User's Manual”, (1993),1-1 to 8-32 Franzis Verlag GMBH, Munchen, DE, vol. 40, No. 16, XPOO0259620, Aug. 6, 1991, pp. 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, pp. 1-17. |
Rosenblum, M., “Virtual Platform: A Virtual Machine Monitor for Commodity PC”, Proceedinas of the 11th Hotchios Conference, Aug. 17, 1999, pp. 185-196. |
Office Action Received for Chinese Patent Application No. 200480035019.4, mailed on Jul. 12, 2013, 10 pages of Chinese Office Action, and 10 pages of English Translation. |
Office Action Received for Chinese Patent Application No. 200480035019A, mailed on Dec. 4, 2013, 3 pages of Chinese Office Action, and 5 pages of English Translation. |
Office Action Received for Japanese Patent Application No. 2006-541379, mailed on Sep. 29, 2009, 6 pages of Japanese Office Action and 6 pages of English Translation. |
Number | Date | Country | |
---|---|---|---|
20130275772 A1 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13413176 | Mar 2012 | US |
Child | 13836863 | US | |
Parent | 10724321 | Nov 2003 | US |
Child | 13413176 | US |