The present invention relates to computer systems, and more particularly to locking of computer components for enhanced data security.
Storage devices 150 (i.e. 150.1, 150.2, etc.), such as hard disk drives (HDD) solid state drives (SDD), and possibly other types, provide additional storage for programs and data, including a non-volatile storage for OS 130 and OS drivers 134. The OS and its drivers are loaded from devices 150 into memory 120 when the system 102 is powered-up or reset.
Storage 150 can be larger and/or less expensive than memory 120.
For security reasons, some or all of devices 150 may be encrypted; more precisely, the data stored on these devices are encrypted. If a device 150 is a self-encrypting drive (SED), the encryption is performed by the device itself. Any data written to the drive 150 are encrypted by the drive before being written onto the drive's storage medium 150M. When the drive receives a read request, the drive reads the data out of its storage medium 150M, and decrypts the data before providing it to the requesting device, e.g. processor(s) 110 or memory 120.
SEDs are described, for example, in U.S. Pat. No. 10,069,625 B2, issued on Sep. 4, 2018 to Chen, incorporated herein by reference.
Each self-encrypting drive 150 stores a corresponding encryption/decryption key (“Data Encryption Key” or DEK) 164 used for the drive's encryption/decryption operations. Some SEDs allow encrypting the DEK itself, using a separate key called Key Encryption Key or KEK. The encrypted DEK is shown at 168, using a common notation “Enc(KEK,DEK)”. The SED 150 stores the DEK only in encrypted form 168 when the drive is powered down. Therefore, when the SED is powered up, the DEK is decrypted to “unlock” the drive. But the corresponding KEK is not stored on the drive for security reasons. When the drive is powered up, the KEK is provided to the drive by another component of computer system 102, and specifically by service processor 170 (iDRAC) described below.
In
In the example of
iDRAC 170 includes a computer processor or processors (not shown), a memory (not shown), and perhaps other components. iDRAC allows an external computer (not shown) to access the computer system 102 over network 180 for management purposes even when the processors 110 are down or the OS 130 is corrupt both in memory 120 and in drives 150. LKM 170L includes memory storage 174 for the KEKs as noted above. The KEKs 174 (i.e. the KEKs in storage 174) can be generated internally or received over network 180, e.g. from Enterprise Key Management Service (EKMS) 182. iDRAC 170, and other components of computer system 102, are connected to network 180 through a Network Interface Device (NID) 186.
Also shown in
For each drive 150 in list 140A, if the drive is locked, iDRAC 170 sends an unlock command to HBA 190 via the bus 194. Specifically, at step 250, the iDRAC gets the first locked drive 150 from the BIOS list 140A. At step 260, the iDRAC unlocks the drive, i.e. sends an unlock command to HBA 190 and waits for the HBA to respond.
At step 270, the iDRAC determines if all the locked drives on list 140A have been unlocked. If the answer is positive, the unlocking operation terminates. If the answer is negative, the iDRAC returns to step 250 to unlock the remaining locked drives.
This section summarizes some features of the invention. Other features may be described in the subsequent sections. The invention is defined by the appended claims, which are incorporated into this section by reference.
The inventors have observed that the unlocking operation—steps 250 and 260in
Therefore, some embodiments of the present invention allow intelligent unlocking of drives 150, giving priority to those drives 150 that are likely to be accessed earlier by processors 110 or by some other devices. Other drives can be unlocked while the system uses earlier unlocked drives. For example, in
In some embodiments, the unlocking sequence also takes into account the history of drive access. For example, suppose that in the previous boot process, drive 150.1 was accessed before drive 150.4. Then in the current boot process, drive 150.1 is unlocked before 150.4. The unlocking sequence may also take into account the frequency of past drive accesses both during and after the boot operations: the more frequently accessed drives can be unlocked earlier.
In some embodiments, at least some of the historical data are weighted, giving more weight to the more recent data.
The invention is not limited to iDRAC, servers, or other features or advantages described above, except as defined by the appended claims.
The embodiments described in this section illustrate but do not limit the invention. The invention is defined by the appended claims.
In particular, iDRAC 170 creates and maintains an unlocking priorities database 304, containing the unlocking priorities of self-encrypting drives 150.
Further, a non-volatile portion of memory 120 stores access log 310, which record the access history of drives 150. For each access of a drive 150, access log 310 records the drive ID, the time of access, and possibly other information including, for example, the type of access; read, write, etc. Access log 310 is created and maintained by processors 110 and/or iDRAC 170 and/or some other part of the system.
Priority database 304 may be constructed taking into account the access log 310.
At step 410, iDRAC 170 (possibly iSM 170S) gets pertinent drive access data from log 310. At step 420, iDRAC 170 builds the database 304.
At step 430, the iDRAC selects the first locked drive 150 to unlock based on priority database 304. Steps 260 is as in
In some embodiments, the priority database 304 can change between different iterations of step 430. For example, in some embodiments, if there is an access event on a locked drive 150, i.e. if some device attempts to access the locked drive, then the drive's priority is increased in database 304, so that the next iteration of step 430 will take this increased priority into account.
Priority:=Event>OS>OS driver>Access order>No. of hits (1)
In this chain, the most important factor is “Event”, i.e. that an access event is pending for the drive. The next most important factor, “OS”, means that the drive stores at least part of OS 130 (such as drive 150.2 in
“Access order” denotes prioritization based on the order in which the drives were accessed in the previous power-up. The access order is determined by iDRAC 170 from access log 310. In the example of
“No. of hits” denotes prioritization based on the total number of accesses (“hits”) of a drive 150. This information is obtained from log 310. The hits are counted since the beginning of time, i.e. during the entire time that the log 310 has been kept. In the example of
The drives are prioritized as follows. The highest priority is given to a drive 150 on which there is an access event pending. In
The next highest priority is given to the drives based on the “OS” factor: each drive that stores at least part of the OS receives priority 1000 in
The next highest priority is given based on the “OS driver” factor, to give priority 800 to the drives that store at least a portion of an OS driver.
The next highest priority is given based on the drives' access order 510, to give higher priorities to the drives that have a lower access order. Thus, the drives 150.4, 150.5, 150.1 receive respective priorities of 500, 400, 300 based on the access order. The remaining drives 150.2, 150.3 were prioritized on more important factors (“OS” and “OS driver”), so their priorities do not depend on the access order or other factors.
The next highest priority is given based on the number of hits (520 in
Also, in some embodiments, if multiple drives prioritized on any factors receive the same priority, e.g. multiple drives receive priority 1000 because the store OS portions, then such drives can be prioritized based on less important factors. For example, a drive that stores an OS portion and an OS driver may receive priority 1010, and the drive the stores an OS portion but not OS driver portion may receive priority 1000. Alternatively, both drives may receive priority 1000; at step 430, one of the drives is selected arbitrarily, possibly as at step 250 in
At step 430, the iDRAC selects the unlocked drive having the highest priority. If multiple unlocked drives share the same, highest priority, the iDRAC selects one of such drives arbitrarily, e.g. as at step 250 in
In some embodiments, the iDRAC never builds the database 304, i.e. step 420 is omitted. At step 430, the iDRAC selects a drive to unlock based on chain (1), selecting the drive based on the most important factor (“Event”), and if this does not result in selection, then applying less and less important factors in their order in chain (1). Thus, the iDRAC first determines if any of the locked drives has an event pending. If so, this drive is selected. If there are multiple “event pending” drives, the iDRAC selects one “event pending” drive arbitrarily, or selects one of the “event pending” drives based on the less important factors in chain (1). For example, if a unique one of the “event pending” drives stores an OS portion, then this drive is selected. If none of the “event pending” drives store any OS portion, or multiple “event pending” drives store OS portions, then the “OS driver” factor is used, and so on down the chain (1).
If none of the locked drives has an event pending, then the iDRAC uses the “OS” factor to select the drive at step 430. If this factor results in selection of multiple drives because multiple locked drives contain OS portions, then the next factor, “OS driver” is used to select one of the multiple drives, and so on.
If no drive is selected at this stage because none of the locked drives has an event pending or contains an OS portion, then the “OS driver” factor is used. The process proceeds to apply less and less important factors down the chain (1), until all the factors are exhausted. If no drive is selected based on chain (1), then one of the locked drives is selected arbitrarily, possibly as in
The factor importance can be different than in chain (1). For example, in some embodiments, the “Event” factor is less important than the “OS” factor.
In some embodiments, multiple factors are combined to obtain a priority. For example, the “OS” factor may be associated with some score, e.g. 1000; the “OS driver” factor may be associated with a score 800. If a drive 150 stores both the OS and an OS driver, the drive receives a combined priority of 1000+800=1800. Other scores may be based on the Access Order factor, No. of Hits factor, etc.; the drive's priority is obtained by adding these scores or combining the scores in some other way. The scores may be weighted based on their importance or recency; for example, the No. of Hits can be weighted to give greater weight to the more recent hits. Also, “Access Order” can be weighted depending on how recent the previous power-up was. Also, “Access Order” may provide a score based on multiple previous power-ups. More recent power-ups may be provided a higher score.
The invention is not limited to the embodiments described above. Some or drives 150 may be never locked, and they are not part of the method of
The invention is not limited to the system architecture of
The invention includes methods described above, and devices (e.g. dRACs) and/or computer systems configured (e.g. programmed) to execute such methods. The invention also includes computer readable media comprising computer instructions executable by such devices (e.g. their processors) to configure the devices to execute such methods.
Other embodiments and variations are within the scope of the invention, as defined by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
8156247 | McMillen | Apr 2012 | B2 |
8856553 | Lyakhovitskiy | Oct 2014 | B2 |
8938626 | Jaber et al. | Jan 2015 | B2 |
9141447 | Sigalov | Sep 2015 | B2 |
9921978 | Chan | Mar 2018 | B1 |
10069625 | Chen | Sep 2018 | B2 |
10382201 | Allo | Aug 2019 | B1 |
10460110 | Allo | Oct 2019 | B1 |
20030188183 | Lee | Oct 2003 | A1 |
20070192828 | Messina | Aug 2007 | A1 |
20090119785 | Challener | May 2009 | A1 |
20140130188 | Baryudin | May 2014 | A1 |
20140310532 | Ali | Oct 2014 | A1 |
20140344617 | Resch | Nov 2014 | A1 |
20170337140 | Ragupathi | Nov 2017 | A1 |
20190109711 | Gladwin | Apr 2019 | A1 |
20190207748 | Courtney | Jul 2019 | A1 |
20190243784 | Hann | Aug 2019 | A1 |
20200044868 | Vakulenko | Feb 2020 | A1 |
Number | Date | Country |
---|---|---|
20170101748 | Sep 2017 | KR |
Entry |
---|
Machine translation of Korean patent application KR 20170101748 A, Oh S. Kyo et al. (Year: 2017). |
Machine translation of Japanese patent application JP 2012252536 A. Kensuke et al. (Year: 2012). |
Number | Date | Country | |
---|---|---|---|
20200218670 A1 | Jul 2020 | US |