Key management and key policies for data encryption in a storage appliance
One example method includes continuously performing key related operations. Each data set in a storage system is encrypted with a different key. New keys are repeatedly introduced and new data is encrypted only with the newest or latest key. Data being rekeyed is re-encrypted with the latest key. By repeatedly introducing new keys and rekeying data sets associated with older keys, the overall key age of the system can be kept low and the data is less susceptible to being compromised.
1. A method comprising:
determining that resources are available for performing key related operations in a storage system and are not used by other workloads;
using the available resources:
evaluating keys associated with a storage system to identify an oldest key;
identifying data stored in the storage system that is encrypted with the oldest key;
generating a newest key during a key introduction period, wherein the newest key is the most recently generated key and the key introduction period is a time period that triggers the generation of the newest key and is independent of other key related operations; and
rekeying the identified data only with the newest key;
encrypting new data added to the storage system only with the newest key, wherein a length of the key introduction period is configured to manage an amount of data associated with each of the keys and to keep an overall age of the keys below a threshold age.
2. The method of claim 1 , wherein rekeying the identified data with a newest key includes:
decrypting the identified data with the oldest key;
encrypting the decrypted data with the newest key; and
writing the newly encrypted data to storage.
3. The method of claim 1 , further comprising asynchronously introducing the new key into the storage system, wherein the newest key is the latest key used to encrypt new data and used to rekey data and a status of the previous latest key is changed to current, wherein no further data is encrypted with the previous latest key.
4. The method of claim 2 , further comprising deleting the oldest key once all data encrypted with the oldest key has been rekeyed.
5. The method of claim 1 , further comprising determining a maximum age for each of the keys and if a specific key reaches the maximum age, rekeying data associated with specific key, wherein rekeying data may be given a priority with respect to write operations in the storage system.
6. The method of claim 5 , further comprising allocating resources to rekey the data associated with the specific key.
7. The method of claim 1 , further comprising prioritizing rekeying operations when multiple data sets are rekeyed.
8. The method of claim 1 , further comprising crypto-erasing a subset of data encrypted with a specific key by rekeying all data encrypted with the specific key except the subset of data with the latest key and deleting the specific key.
9. The method of claim 1 , wherein the data includes a plurality of data sets, further comprising mapping each of the data sets to a different key.
10. A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:
determining that resources are available in a storage system for performing key related operations and are not used by other workloads;
using the available resources:
evaluating keys associated with a storage system to identify an oldest key;
identifying data stored in the storage system that is encrypted with the oldest key;
generating a newest key during a key introduction period, wherein the newest key is the most recently generated key and the key introduction period is a time period that triggers the generation of the newest key and is independent of other key related operations; and
rekeying the identified data only with the newest key;
encrypting new data added to the storage system only with the newest key, wherein a length of the key introduction period is configured to manage an amount of data associated with each of the keys and to keep an overall age of the keys below a threshold age.
11. The non-transitory storage medium of claim 10 , wherein rekeying the identified data with a newest key includes:
decrypting the identified data with the oldest key;
encrypting the decrypted data with the newest key; and
writing the newly encrypted data to storage.
12. The non-transitory storage medium of claim 10 , further comprising repeatedly introducing the new key into the storage system, wherein the newest key is the latest key used to encrypt new data and used to rekey data and a status of the previous latest key is changed to current, wherein no further data is encrypted with the previous latest key.
13. The non-transitory storage medium of claim 11 , further comprising deleting the oldest key once all data encrypted with the oldest key has been rekeyed.
14. The non-transitory storage medium of claim 10 , further comprising determining a maximum age for each of the keys and if a specific key reaches the maximum age, rekeying data associated with specific key.
15. The non-transitory storage medium of claim 14 , further comprising allocating resources to rekey the data associated with the specific key and prioritizing rekeying operations when multiple data sets are rekeyed.
16. The non-transitory storage medium of claim 10 , further comprising crypto-erasing a subset of data encrypted with a specific key by rekeying all data encrypted with the specific key except the subset of data with the latest key and deleting the specific key.
17. The non-transitory storage medium of claim 10 , wherein the data includes a plurality of data sets, further comprising mapping each of the data sets to a different key.
18. The non-transitory storage medium of claim 17 , further comprising mapping using extents, inline metadata, external metadata, or N-way associative mapping.