Authentication - Acceptable Verifier-Compromise Resistance, v1.0

Verifiers are compromise resistant when they do not store anything that when stolen nullifies the value of the authenticator.

Assessment Steps (2)

1
Public Keys (PublicKeys)
Does the authentication verifier store public keys with approved cryptographic algorithms and of appropriate strength?
Artifact
A1
Provide evidence (e.g. policies, operational details, processes) that the verifier stores and uses public keys appropriately.
2
Hashes (Hashes)
Does the authentication verifier use approved cryptographic hashes of sufficient strength? Low complexity secrets (e.g. weak passwords) cannot meet this requirement regardless of hashing algorithm strength as they are still vulnerable to exhaustive search attacks
Artifact
A1
Provide evidence (e.g. policies, operational details, processes) that the authentication verifier stores all secrets using sufficiently strong hashing.

Conformance Criteria (2)

C1
To be considered verifier compromise resistant, public keys stored by the verifier SHALL be associated with the use of approved cryptographic algorithms and SHALL provide at least the minimum security strength specified in the latest revision of SP 800-131A (112 bits as of the date of this publication).
Citation
NIST SP 800-63B
Section 5.2.7, Paragraph 3
C2
Other verifier compromise resistant secrets SHALL use approved hash algorithms and the underlying secrets SHALL have at least the minimum security strength specified in the latest revision of SP 800-131A (112 bits as of the date of this publication). Secrets (e.g., memorized secrets) having lower complexity SHALL NOT be considered verifier compromise resistant when hashed because of the potential to defeat the hashing process through dictionary lookup or exhaustive search.
Citation
NIST SP 800-63B
Section 5.2.7, Paragraph 4