31.07.2013 Views

Part 1: General - Computer Security Resource Center - National ...

Part 1: General - Computer Security Resource Center - National ...

Part 1: General - Computer Security Resource Center - National ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

March, 2007<br />

symmetric key or the public key of a key pair, although the private key associated with the public<br />

key is also revoked.<br />

Key revocation may be accomplished using a notification indicating that the continued use of the<br />

keying material is no longer recommended. The notification could be provided by actively<br />

sending the notification to all entities that might be using the revoked keying material, or by<br />

allowing the entities to request the status of the keying material (i.e., a “push” or a “pull” of the<br />

status information). The notification should include a complete identification of the keying<br />

material, the date and time of revocation and the reason for revocation, when appropriate (e.g.,<br />

key compromised). Based on the revocation information provided, other entities could then make<br />

a determination of how they would treat information protected by the revoked keying material.<br />

For example, if a signature verification public key is revoked because an entity left an<br />

organization, it may be appropriate to honor all signatures created prior to the revocation date. If<br />

a signing private key is compromised resulting in the revocation of the associated public key, an<br />

assessment needs to be made as to whether or not information signed prior to the revocation<br />

would be considered as valid.<br />

As another example, a symmetric key that is used to generate MACs may be revoked so that it is<br />

not used to generate MACs on new information. However, the key may be retained so that<br />

archived documents can be verified.<br />

The details for key revocation should reflect the lifecycle for each particular key. If a key is used<br />

in a pair-wise situation (e.g., two entities communicating in a secure session), the entity revoking<br />

the key shall inform the other entity. If the key has been registered with an infrastructure, the<br />

entity revoking the key cannot always directly inform the other entities that may rely upon that<br />

key. Instead, the entity revoking the key shall inform the infrastructure that the key shall be<br />

revoked (e.g., using a certificate revocation request). The infrastructure shall respond by deregistering<br />

the key material (see 8.3.3).<br />

8.4 Destroyed Phase<br />

The keying material is no longer available. All records of its existence may have been deleted.<br />

However, some organizations may require the retention of certain key attributes for audit<br />

purposes. For example, if a copy of an ostensibly destroyed key is found in an uncontrolled<br />

environment or later determined to have been compromised, records of the identifier of the key<br />

and its type, and cryptoperiod may be helpful in determining what information was protected<br />

under the key and how best to recover from the compromise.<br />

In addition, by keeping a record of the attributes of both destroyed and destroyed compromised<br />

keys, one will be able to track which keys transitioned through a normal lifecycle and which<br />

ones were compromised at some time during their lifecycle. Thus, protected information that is<br />

linked to key names that went through the normal lifecycle may still be considered secure,<br />

provided that the security strength of the algorithm remains sufficient. However, any protected<br />

information that is linked to a key name that has been compromised may itself be compromised.<br />

9 Accountability, Audit, and Survivability<br />

Systems which process valuable information require controls in order to protect that information<br />

from unauthorized disclosure and modification. Cryptographic systems which contain keys and<br />

113

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!