This invention relates generally to backup and restore operations on a data processing device. More particularly, the invention relates to a method and apparatus for performing secure incremental backup and restore operations on a data processing device.
Whenever performing backup and restore operations, security is always a concern. This is particularly true whenever performing these operations over a computer network connection. Security is important because much of the data a user might want to backup may be sensitive or confidential.
Additionally, computer networks have limited bandwidth. Network service providers must pay per megabit for bandwidth utilization. Currently whenever a backup or restore operation is performed, it is performed on the entire data set and therefore requires a lot of bandwidth.
What is needed is a method to perform a backup only on the data that has changed (i.e., incrementally) since a previous backup operation in order to reduce bandwidth utilization. Additionally, such operations should be performed securely.
Methods and apparatuses for performing secure incremental backup and restore operations is disclosed where a data processing device receives a manifest from a precious backup operation and determines what files have changed by comparing the files to be backed up to the manifest. The data processing device then transforms and encrypts only the new and modified files, updates the manifest, signs the manifest and sends the encrypted files along with the signed manifest to a host data processing system for backup. The host then deletes the files not contained in the updated manifest to complete the backup process. Also disclosed is a secure restore operations where a signed manifest is received at a data processing device which performs a restore of the entire backup as a set to prevent any tampering if the manifest is validated using a digital signature. Computer readable media and various data processing systems are also disclosed.
A better understanding of the present invention can be obtained from the following detailed description in conjunctions with the following drawings, in which:
Throughout the description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form to avoid obscuring the underlying principles of the present invention.
Various embodiments and aspects of the inventions will be described with reference to details discussed below, and the accompanying drawings will illustrate the various embodiments. The following description and drawings are illustrative of the invention and are not to be construed as limiting the invention. Numerous specific details are described to provide a through understanding of various embodiments of the present invention. However, in certain instances, well-known or conventional details are not described in order to provide a concise discussion of embodiments of the present inventions.
The present invention can relate to an apparatus for performing one or more of the operations described herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a machine (e.g. computer) readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a bus.
A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
Prior to describing the various different embodiments in connection with incremental secure backup and restore architectures, methods and computer readable media, a brief discussion will be provided in connection with the data processing devices which may be part of the backup and restore process. The term “host” and the term “device” are intended to refer generally to data processing devices rather than specifically to a particular form factor for the host versus a form factor for the device.
As shown in
It will be apparent from this description that aspects of the inventions may be embodied, at least in part, in software. That is, the techniques may be carried out in a computer system or other data processing device in response to its processor or processing system executing sequences of instructions contained in a memory, such as memory 49 or non-volatile memory 50 or the memory 63 shown in
The dock 54 and/or the wireless transceivers 55 provide a physical interface for coupling the data processing device shown in
At least certain embodiments of the inventions may be part of a digital media player, such as a portable music and/or video media player, which may include a media processing system to present the media, a storage device to store the media and may further include a radio frequency (RF) transceiver (e.g., an RF transceiver for a cellular telephone) coupled with an antenna system and the media processing system. In certain embodiments, media stored on a remote storage device may be transmitted to the media player through the RF transceiver. The media may be, for example, one or more of music or other audio, still pictures, or motion pictures.
The portable media player may include a media selection device, such as a click wheel input device on an iPod® or iPod Nano® media player from Apple Inc. of Cupertino, Calif., a touch screen input device, pushbutton device, movable pointing input device or other input device. The media selection device may be used to select the media stored on the storage device and/or the remote storage device. The portable media player may, in at least certain embodiments, include a display device which is coupled to the media processing system to display titles or other indicators of media being selected through the input device and being presented, either through a speaker or earphone(s), or on the display device, or on both display device and a speaker or earphone(s). Examples of a portable media player are described in U.S. patent application publication 2003/0095096 now U.S. Pat. No. 7,345,671 issued on Mar. 18, 2008, and U.S. patent application publication 2004/0224638, now U.S. Pat. No. 7,627,343 issued on Dec. 1, 2009, both of which are incorporated herein by reference.
In certain embodiments, the data processing device 60 may be implemented in a small form factor which resembles a handheld computer having a tablet-like input device which may be a multi-touch input panel device which is integrated with a liquid crystal display. Examples of such devices are provided in U.S. patent application Ser. No. 11/586,862, filed Oct. 24, 2006, and entitled “AUTOMATED RESPONSE TO AND SENSING OF USER ACTIVITY IN PORTABLE DEVICES,” issued as U.S. Pat. No. 7,633,076 on Dec. 15, 2009, which is assigned to the same assignee as the instant application. This foregoing application is hereby incorporated herein by reference.
In the following description, various software components which are used for both backup and restore operations are described. It will be understood that in at least certain embodiments, these various software components may be stored in the memory 49 and/or memory 50 shown in
Referring now to
From root 301, a user (not pictured) may access map info 303, screen backgrounds 305, personal information management data 307, favorites 309, WiFi 313, and cookies 317. Additionally, from map info 303 a user can access bookmarks 304. Bookmarks 304 may contain information relating to web sites frequently visited by the user or other similar information. Likewise from favorites 309, phone numbers 311 may be accessed, and from WiFi 313, WiFi hot spots 315 may be accessed by a user via root 301. Phone numbers 311 may include various phone numbers the user has stored in favorites 309. Likewise, WiFi hot spots 315 may contain a list of WiFi hot spots frequently visited by the user. Screen background 305 may contain a listing of the current screen background utilized by a data processing device as well as various other screen backgrounds previously utilized by the user. Personal information management data 307 may also be accessed and includes files and other data structures relating to managing the user's personal information. The files contained in
As discussed above, information contained on a data processing device including files and other objects stored in tree of objects 300 may be securely backed up in an incremental manner onto a host computer such as that depicted in
In this embodiment, MD Backup1411 is listed under its phash as the file name of the data as it is stored on the host. The reason the phash acts as the filename is so that the actual file name of the file will not be known to the host. That is, the host cannot tell which file corresponds to that particular backup entry. What's more, because the file path is hashed and used as the file name of the data stored on the host, the host has no way to determine which file relates to that particular manifest entry. As discussed above, this is advantageous because another person, such as a hacker, cannot determine this information without having access to the hash function. However, the hash function is stored on the device being backed up, such as data processing device 60, and is not accessible by the host. Therefore, the host has no way to determine which files have been backed up and no way to determine which files correspond to which entry. All the host can tell is the number of files that have been backed up as a set of opaque objects. MD Backup1411, in this embodiment, is stored under phash 3DB215 which is the hash of the path to the actual file as it is stored on the data processing device, such as data processing device 60. That is, 3DB215 is the hashed path of the path to MD Backup1411 as it is stored on Device “X” 405. MD Backup1411 is the actual backed-up file on the host computer. However, MD Backup1411 is the chash of the data stream sent to the host computer which is both transformed and encrypted. Thus, the file map entry represents a mapping from 3DB215 (the phash) to MD Backup1411 (the chash of the data transformed and encrypted). MD Backup 1411 is stored as a part of the backup of file1 in backup directory 403. Likewise, MD Backup2412 is backed up in the same manner, the result of which, is a group of transformed and encrypted files which are hashed and stored under the file name of the phash of the file path. This provides security for the user in that the user's backed-up settings and data may not be inspected at the host computer. The user settings and data may only be inspected after it is restored onto the data processing device.
As discussed above, a secure incremental backup may be performed on data such as that depicted in
In step 505, an empty manifest is created which will be updated as the backup process continues. Each time a new file is backed up, its file map will be placed in the manifest along with the other manifest information discussed above including certificate, signature, version and master encryption key(s). In step 507, the keys for encryption are obtained. For example a master encryption key (MEK) may be obtained according to one embodiment of the invention. The MEK may reside anywhere (all the algorithm requires is that there be a key to start the process). In this embodiment, the MEK is created with a random 16 byte value from a randomized algorithm stored in the /dev/random/ directory on the data processing device. The MEK need only be generated once the first time a backup operation is performed. Also, the MEK need not be one key, but may be “n” keys for “n” different encryptions. The MEK(s), in this embodiment, are encrypted and stored in the manifest. An object encryption key may also be obtained to encrypt the individual objects to be backed up. In one embodiment, the objects are files, so a file encryption key (FEK) is obtained to encrypt the individual files. In this embodiment, each individual file is encrypted separately and sent over to the host computer. An advantage of this is that the files are backed up and encrypted individually so they may be encrypted with a unique FEK. Each file has its own key and there is a master key for each backup set. The master key does not change after a backup set is created unless a full backup is performed.
Accordingly, a FEK is generated for each file to be backed up on the data processing device. The FEK may be obtained from one of several algorithms known in the art. In this embodiment, the FEK is a random 16 byte value obtained from a randomized algorithm which is stored on the data processing device in /dev/random/ directory. Similarly, an optional initialization vector (IV) to be used as part of the encryption process is obtained from a randomized algorithm which may be obtained from the /dev/random directory on the data processing device. An IV is a commonly known encryption method where there is some randomness added at the start of the data to keep hackers from figuring out the context of the data within an encryption scheme.
At step 511, the encryption is performed on the data for each file to be backed up. In this embodiment, the data is encrypted using the FEK on the file path concatenated with the contents of the file. That is, the file path is concatenated to the file bytes and then encrypted using the FEK according to the formula
Encrypted Data=Enc{FEK,file path//file bytes}.
As mentioned above, each file or other object to be backed up has its own unique FEK in order to make it possible to do incremental backups of individual files. Once the data from the file is encrypted, the object encryption key is wrapped to form the wrapped object encryption key. In one embodiment, the objects are files and the FEK is wrapped to form the wrapped file encryption key (WFEK). The WFEK is obtained by encrypting the initialization vector concatenated with the FEK using the MEK. That is, the WFEK is obtained from the formula
WFEK=Enc{MEK,IV//FEK}.
Once the data is encrypted the data stream for each file to be backed up may be formed. In one embodiment, the data stream is formed by concatenating the IV with the WFEK concatenated with the encrypted data for each individual file. That is, the data stream is obtained from the formula
Data stream=IV//WFEK//encrypted data.
At step 519, the manifest is updated with the object map information for each object to be backed up. In this embodiment, the objects are files, so a file map is created. As discussed above, the file map includes at least a mapping from the phash of each file to the chash for each object to be backed up. The mapping may additionally be a mapping to other metadata germane to the backed up data such as modification date. However, this is just an implementation detail and is not intended to limit the invention. At step 520, once the manifest is updated, the data stream for the file to be backed up is sent to the host. Once all the data streams for each of the files to be backed up is sent to the host, the manifest is signed using a digital signature and sent to a host computer in step 521. The manifest is signed with the data processing device's activation certificate. The device's activation certificate is a part of a certificate chain of public and private keys that goes back to a trusted root. The certificate may be any certificate known in the art such as the standard X.509 certificate with standard signature. Once the host computer receives the data stream for each file to be backed up, the data stream is stored in the backup directory, similar to backup directory 401 under the data streams phash as the file name. Once the host receives and verifies the validity of the manifest, the manifest is also stored on the host in a file similar to manifest.plist 407 of
Referring now to
If there is a valid manifest stored at the host computer, the host computer sends the signed manifest to the data processing device at step 611. The data processing device checks the validity of the manifest at step 613 and fails the backup whenever the manifest received from the host is not valid. The data processing device knows whether the manifest has been validly signed because the signature originated from the device. At step 617, the data processing device creates a new manifest to replace the old valid manifest received from the host computer. The new manifest file is initially empty when created and is updated as the backup operation proceeds.
At step 619, every entry in the old manifest is compared to the files to be backed up currently stored on the data processing device to determine the delta between what files are represented in the old manifest and what files are currently stored on the data processing device. That is, each of the files to be backed up on the data processing device are compared to the entries in the old manifest to determine which files have changed, which files have been added, and which files have been deleted since the earlier backup corresponding to the manifest was performed. There are several ways in which this comparison can be made. In one embodiment, the phash and chash are computed for each file to be backed up and the results are compared to the entries in the manifest. Alternatively, the metadata for each file may be compared to the metadata in the old manifest. For, example the modification date of each file on the data processing device may be compared to the modification date in the old manifest. Files with the same modification date can be quickly determined to be the same files as existed on the data processing device at the time of the previous backup operation. Incremental backups can be really fast if it is predetermined that the file will never change without a concomitant change in the modification date. In this case, all that is needed to check whether a file has changed is to check the modification date. At step 621, for each file to be backed up on the data processing device, it is determined if there is a match between the file and an entry in the manifest. If there is a match, the file that has not changed since the backup corresponding to the old manifest was performed. In this case, control continues to step 623 and the files are not sent to the host because they have not been changed and there is no need to send them. At step 625, the data processing device simply copies the entry in the old manifest corresponding to the file that has remained unchanged into the new manifest and control continues to step 635. If there is not a match, then the file was either modified or added to the data processing device since the previous backup was performed. For example, files with different phash and chash values are either modified files or new files that have been added since the old manifest was generated during a previous backup. In such a case, control continues to step 627 where each of the new or modified files is encrypted and transformed. The phash and chash of each of the new or modified files is computed at step 629. At step 631, a new entry is added to the new manifest corresponding to the new or modified file and the encrypted files are sent to the host at step 633.
At step 635, the new manifest is signed with a digital signature using the device's activation certificate which is part of a certificate chain leading back to a trusted root and the manifest is sent to the host. Optionally, the data processing device may also send a list of deleted files to the host to speed up host-side processing, but this is just an implementation detail and is not required for this embodiment of the present invention. At step 637, the host receives the manifest and encrypted files and stores them together as a backup. The host then deletes the files which are not contained in the manifest by comparing the received manifest to the old manifest. Alternatively, the host computer deletes the files in the deletion list. This completes the secure incremental backup process according to one embodiment of the invention.
As discussed above, the incremental backup involves only sending the files that have changed over to the host computer. In this way, bandwidth utilization is minimized. As discussed above, in one embodiment of the invention the data processing device communicates with a host computer over a wireless network. Wireless networks today provide a limited bandwidth as compared to wired networks. As a consequence, bandwidth utilization comes at a premium. The present invention is advantageous in this regard in that secure backups may be performed incrementally alleviating the need to do a full backup every time. Thus, bandwidth utilization is minimized because only the files that have changed since the previous backup are sent across the wireless network to a host computer. Furthermore, an incremental backup may be performed much faster than a full backup.
Referring now to
At step 709, the chash of the received data stream. As discussed above, in one embodiment the data stream is obtained from the formula
Data stream=IV//WFEK//encrypted data.
At step 711, the data processing device determines if the phash and chash of the data stream matches the phash and chash in the manifest. A file that hashes to phash that has the contents that hash to chash was a part of the backup set. If not, control continues to step 712 and the restore fails. If there is a match, control continues to step 713 where, in one embodiment, the IV is stripped off of the front of the received data stream. At step 715, the WFEK is decrypted using the MEK stored in the manifest to get the FEK for each file. Remember, each file that was backed up was encrypted with a unique FEK and any of the FEKs may be decrypted using the MEK. Once the WFEK is encrypted to get the FEK for each particular file, control continues to step 717. In this step, the FEK is used to decrypt the encrypted data which includes the file path concatenated with the file bytes. At step 719, the data processing device deconstructs the file path and the file data from the decrypted data. Control continues to
Referring to
As discussed above, the backup and restore operations of the present invention are done in a secure manner. Incremental secure backup and restore allows a user to make a backup of their user settings and data from a device and later restore the settings and data without fear that an attacker could introduce modified or additional files onto the device. This protects the device from any attacks which could cause applications to crash, behave unpredictably, or have their security compromised due to malformed data or configuration files. The secure feature of the present invention has two aspects. The first aspect is the prevention of inspection of the data sent to the host computer. The invention allows for the safe storage of the user's backup on their computer (or other host computer) in any encrypted form, that can be recovered onto any device the user allows to be restored. While stored on the computer, or stored on a server, the backup is unreadable as it is encrypted and can only be decrypted by a device when restored to a device with the proper software. Neither the host computer nor any other computer connected to the network that receives the backup from the data processing device can inspect its contents. The contents as transmitted and as stored on the host computer are stored as a set of opaque files. Both the files and the file path are encrypted when they are sent over the network and while they are stored on the host computer. So, not only is it not possible to tamper with the files, it is not possible to tamper with the file path or destination into which the file should be placed back onto the device and, as a result, it is not possible to tell which files were backed up. Additionally, the encrypted data is transformed and hashed (with a one-way hash in one embodiment) before it is sent over the network. Finally, the backup includes a manifest which is signed with a digital signature for authentication. The manifest is required to decrypt the data and the manifest and the data always go together as one backup set. Thus, the data is encrypted, transformed, hashed and signed before it is sent out onto the network and may not be inspected.
The second secure aspect is the tamper-proof aspect. In fact, it is possible to chose not to encrypt the data and have the backup still be tamper proof. That is because when a restore operation is performed, only the full set of files that were backed up may be restored. That is, the full set of files that came from the data processing device belong together and must be restored together. Piecewise restore operations are not permitted. It is not possible to mix and match files from different backups. For example, it is not possible to backup the old version of the address book with the new version of the calendar. Instead, the entire backup state of the device remains as a group. this is advantageous because it does not allow a person or party to attack the device by injecting files that should not be there, modifying files, or removing files from a backup set. It is only possible to restore a full backup set of files that resided together on the device. Another advantage of this is that it is even possible to back up files onto a machine or network that is not trusted and still be able to restore user settings and data onto the user's device without fear of tampering from another person or party. The user either gets the full set of files or nothing. In this way, the system of the present invention will catch all disk errors, mistakes by users, as well as attackers. In the case of files being injected into the backup by some other person or party, the present invention allows for policy choices as to whether to fail the entire backup or just reject the added files. In this case, the user may make a choice depending on the importance of the data and other factors.
Additionally, there is no limitation that the backup and restore be performed by the same data processing device. Alternate embodiments can encompass different mechanisms known in the art that allow a user to restore a backup onto a different device. This may be accomplished using a password or other certificate such as the device's activation certificate as long as the certificate is part of a chain leading back to a trusted root. For example, a password or other form of validation may be included to allow a user to restore data from a previous backup onto a different device. Thus, the algorithm is not device specific. This is advantageous because it allows, for example, a user with a broken device to purchase a new device and restore all the user's settings and data onto the new device. This is also advantageous from a business perspective because one of the barriers to purchasing a new data processing device such as a PDA is that a user does not want to have to manually enter all the user settings and data stored on the old data processing device. With PDAs and other handheld devices becoming more and more powerful, it is useful to be able to restore a user's settings and data onto a new device without manual entry.
Finally, the validity of a backup using a certified key can be verified without being able to restore the backup. The host computer can inspect the backup and tell if the backup set is valid without being able to inspect or restore the files.
Accordingly, the scope and spirit of the invention should be judged in terms of the claims which follow.
Number | Name | Date | Kind |
---|---|---|---|
5367698 | Webber et al. | Nov 1994 | A |
5537585 | Blickenstaff et al. | Jul 1996 | A |
5559991 | Kanfi | Sep 1996 | A |
5652879 | Harris et al. | Jul 1997 | A |
5765173 | Cane et al. | Jun 1998 | A |
5778395 | Whiting et al. | Jul 1998 | A |
5813009 | Johnson et al. | Sep 1998 | A |
5852819 | Beller | Dec 1998 | A |
5946700 | Pongracz et al. | Aug 1999 | A |
5974238 | Chase | Oct 1999 | A |
5991399 | Graunke et al. | Nov 1999 | A |
6023708 | Mendez et al. | Feb 2000 | A |
6034621 | Kaufman | Mar 2000 | A |
6049874 | McClain et al. | Apr 2000 | A |
6101507 | Cane et al. | Aug 2000 | A |
6108687 | Craig | Aug 2000 | A |
6178403 | Detlef | Jan 2001 | B1 |
6269405 | Dutcher et al. | Jul 2001 | B1 |
6295541 | Bodnar et al. | Sep 2001 | B1 |
6336124 | Alam et al. | Jan 2002 | B1 |
6393434 | Huang et al. | May 2002 | B1 |
6393462 | Mullen-Schultz | May 2002 | B1 |
6430576 | Gates et al. | Aug 2002 | B1 |
6513050 | Williams et al. | Jan 2003 | B1 |
6542906 | Korn | Apr 2003 | B2 |
6557028 | Cragun | Apr 2003 | B2 |
6564261 | Gudjonsson et al. | May 2003 | B1 |
6571245 | Huang et al. | May 2003 | B2 |
6654785 | Craig | Nov 2003 | B1 |
6708221 | Mendez et al. | Mar 2004 | B1 |
6714968 | Prust | Mar 2004 | B1 |
6721871 | Piispanen et al. | Apr 2004 | B2 |
6789258 | Zak, Jr. et al. | Sep 2004 | B1 |
6907450 | Lautenbacher | Jun 2005 | B1 |
6975727 | Vandergeest | Dec 2005 | B1 |
6985912 | Mullins et al. | Jan 2006 | B2 |
6990513 | Belfiore et al. | Jan 2006 | B2 |
7039679 | Mendez et al. | May 2006 | B2 |
7085835 | Bantz et al. | Aug 2006 | B2 |
7096867 | Smith et al. | Aug 2006 | B2 |
7100039 | Fisher | Aug 2006 | B2 |
7188193 | Getsin et al. | Mar 2007 | B1 |
7200668 | Mak et al. | Apr 2007 | B2 |
7263551 | Belfiore et al. | Aug 2007 | B2 |
7330997 | Odom | Feb 2008 | B1 |
7345671 | Robbin et al. | Mar 2008 | B2 |
7401104 | Shah et al. | Jul 2008 | B2 |
7454462 | Belfiore et al. | Nov 2008 | B2 |
7458091 | Getsin et al. | Nov 2008 | B1 |
7478170 | Ong et al. | Jan 2009 | B2 |
7483929 | Kulkarni et al. | Jan 2009 | B2 |
7490295 | Chaudhri et al. | Feb 2009 | B2 |
7502922 | Amin et al. | Mar 2009 | B1 |
7506010 | Kulkarni et al. | Mar 2009 | B2 |
7523096 | Badros et al. | Apr 2009 | B2 |
7523386 | Awada et al. | Apr 2009 | B2 |
7526916 | Scherer et al. | May 2009 | B2 |
7580946 | Mansour et al. | Aug 2009 | B2 |
7627343 | Fadell et al. | Dec 2009 | B2 |
7633076 | Huppi et al. | Dec 2009 | B2 |
7660831 | Freedman | Feb 2010 | B2 |
7778971 | Freedman et al. | Aug 2010 | B2 |
20010056425 | Richard | Dec 2001 | A1 |
20020002680 | Carbajal et al. | Jan 2002 | A1 |
20020087632 | Keskar | Jul 2002 | A1 |
20020116405 | Bodnar et al. | Aug 2002 | A1 |
20020123325 | Cooper | Sep 2002 | A1 |
20020124241 | Grey et al. | Sep 2002 | A1 |
20030095096 | Robbin et al. | May 2003 | A1 |
20030097579 | England et al. | May 2003 | A1 |
20030126301 | Mason et al. | Jul 2003 | A1 |
20040030852 | Coombs et al. | Feb 2004 | A1 |
20040054711 | Multer | Mar 2004 | A1 |
20040054739 | Friend et al. | Mar 2004 | A1 |
20040093342 | Arbo et al. | May 2004 | A1 |
20040117636 | Cheng | Jun 2004 | A1 |
20040139178 | Mendez et al. | Jul 2004 | A1 |
20040148375 | Levett et al. | Jul 2004 | A1 |
20040153481 | Talluri | Aug 2004 | A1 |
20040181580 | Baranshamaje | Sep 2004 | A1 |
20040186916 | Bjorner | Sep 2004 | A1 |
20040224638 | Fadell et al. | Nov 2004 | A1 |
20040225731 | Piispanen et al. | Nov 2004 | A1 |
20040225791 | Keskar et al. | Nov 2004 | A1 |
20050066169 | Kiehtreiber et al. | Mar 2005 | A1 |
20050125459 | Sutinen et al. | Jun 2005 | A1 |
20050147130 | Hurwitz et al. | Jul 2005 | A1 |
20050246398 | Barzilai et al. | Nov 2005 | A1 |
20050268307 | Gates et al. | Dec 2005 | A1 |
20060005191 | Boehm | Jan 2006 | A1 |
20060015818 | Chaudhri et al. | Jan 2006 | A1 |
20060026218 | Urmston | Feb 2006 | A1 |
20060059207 | Hirsch et al. | Mar 2006 | A1 |
20060101082 | Agrawal et al. | May 2006 | A1 |
20060130046 | O'Neill | Jun 2006 | A1 |
20060179083 | Kulkarni et al. | Aug 2006 | A1 |
20060206547 | Kulkarni et al. | Sep 2006 | A1 |
20060248162 | Kawasaki | Nov 2006 | A1 |
20060264206 | Itaba et al. | Nov 2006 | A1 |
20070022155 | Owens et al. | Jan 2007 | A1 |
20070027937 | McGrattan et al. | Feb 2007 | A1 |
20070075965 | Huppi et al. | Apr 2007 | A1 |
20070100913 | Sumner et al. | May 2007 | A1 |
20070118570 | Wang | May 2007 | A1 |
20070124331 | Griffin | May 2007 | A1 |
20070203955 | Pomerantz | Aug 2007 | A1 |
20070271317 | Carmel | Nov 2007 | A1 |
20070271505 | Dandekar et al. | Nov 2007 | A1 |
20080010286 | Zhang et al. | Jan 2008 | A1 |
20080033950 | Lemay et al. | Feb 2008 | A1 |
20080154989 | Arman | Jun 2008 | A1 |
20080163743 | Freedman | Jul 2008 | A1 |
20080168072 | Freedman | Jul 2008 | A1 |
20080168106 | Freedman | Jul 2008 | A1 |
20080168126 | Freedman | Jul 2008 | A1 |
20080168184 | Freedman | Jul 2008 | A1 |
20080168291 | Freedman | Jul 2008 | A1 |
20080168292 | Freedman | Jul 2008 | A1 |
20080229142 | Anand et al. | Sep 2008 | A1 |
20080250085 | Gray et al. | Oct 2008 | A1 |
20080307102 | Galloway | Dec 2008 | A1 |
20080318550 | De Atley | Dec 2008 | A1 |
Number | Date | Country |
---|---|---|
WO 03073292 | Sep 2003 | WO |
WO 03088613 | Oct 2003 | WO |
WO 2008085869 | Jul 2008 | WO |
WO 2009023040 | Feb 2009 | WO |
Number | Date | Country | |
---|---|---|---|
20090006640 A1 | Jan 2009 | US |