E-Authentication Flashcards
- Which of these is not a method of POPOS- (Proof of possession of secret) based authentication?
a. OTP (i.e., a One-Time Password)
b. PvtKey{challenge}
c. Hash (PrivateKey, challenge)
d. SecretKey{challenge}
c. Hash (PrivateKey, challenge)
- Why is it not necessary to “protect” a digital certificate that is sent over the wire?
a. Modification of anything in the certificate would not help the attacker.
b. The key it carries is encrypted to protect its confidentiality.
c. It is “self-protected” already via the CA’s digital signature.
d. The integrity of the key in the certificate is not important because it is a public key.
c. It is “self-protected” already via the CA’s digital signature.
- At the core of all remote digital “e”-authentication methods, is the need to…
a. ensure that the attacker could never brute force attack the authentication secrets.
b. prove possession of a shared (symmetric) secret or a private key.
c. employ a trusted third party to manage all authenticating message exchanges.
d. generate session keys dynamically, and not keep them stored on hard drives.
b. prove possession of a shared (symmetric) secret or a private key.
- Which of these is a reason that a distinction is made between authenticating humans and
authenticating computers?
a. Humans generally cannot remember “strong” secrets: computers can.
b. Computers generally cannot do complex cryptographic operations: humans can.
c. No distinction is made.
d. both a and b
a. Humans generally cannot remember “strong” secrets: computers can.
- Which of these best defines the notion of a common trust anchor in PKI?
a. If A uses B’s certificate (e.g., B sent a digitally-signed email to A), then A and B must have
the same signing CA in order for A to accept B’s certificate.
b. It means that two CAs have issued cross-certificates for each other.
c. It is synonymous with (i.e., means the same as) a root certificate.
d. Two different user certificates have a common signing CA somewhere in their signing chain.
d. Two different user certificates have a common signing CA somewhere in their signing chain.
- Which of these represents a MAC (Message Authentication Code) of the challenge?
a. hash(challenge, SecretKey)
b. hash(challenge, PublicKey)
c. hash(challenge, PrivateKey)
d. both a and c
a. hash(challenge, SecretKey)
- Which of the following best describes PFS (Perfect Forward Secrecy)?
a. Session keys are never re-used.
b. Authentication keys (e.g., passwords) are not stored anywhere.
c. Session keys cannot be derived from stored (long term) authentication keys.
d. Session keys receive the same storage protection that authentication keys do.
a. Session keys are never re-used.
- The online user who puts a check in the Web server option box that offers: “log me in automatically”,
is effectively…
a. indicating that she is willing to let her password be sent in the clear.
b. saying that she wants to be prompted for both username and password during every logon.
c. increasing her vulnerability to a having that password stolen from her computer.
d. causing the Web server to now store her password.
c. increasing her vulnerability to a having that password stolen from her computer.
- Which is the most “expensive” in terms of the CPU-processing required to perform them?
a. Hash functions
b. Asymmetric Key encryption/decryption
c. Symmetric Key encryption/decryption
d. There is little difference between any of these
b. Asymmetric Key encryption/decryption
- A “cross certificate” is best described as…
a. the root certificate that is common to two different certificate owners.
b. a CA certificate that has been “signed” by a CA from a different PKI hierarchy/domain.
c. the common trust anchor CA certificate in any two certificate owner’s ancestral chain.
d. a “self-signed” root certificate that serves as the common trust anchor for two or more
different PKI hierarchies/domains.
b. a CA certificate that has been “signed” by a CA from a different PKI hierarchy/domain.
- In the context of cryptography, “strong authentication” across a network means that…
a. the authentication credentials (e.g. PW) are safe from brute force attack.
b. knowledge (or possession) of a secret is proven without revealing the secret in transit.
c. biometric information is used as proof of identity.
d. the authentication credentials used must be asymmetric.
b. knowledge (or possession) of a secret is proven without revealing the secret in transit.
- Which of these best describes the use and utility of the Diffie-Hellman protocol?
a. It solves the key distribution problem by allowing two remote entities to create a shared key.
b. It allows to remote entities to create a secure (CIA) communications channel between them.
c. It solves the key distribution problem by employing assymetric key-building techniques.
d. It allows two remote entities to confidentially create a shared (symmetric) key.
d. It allows two remote entities to confidentially create a shared (symmetric) key.
- When a KDC (Key Distribution Center) is used as a “trusted (key) intermediary” for symmetric key
based authentication, which is true regarding the problem-size for key generation and distribution?
a. It goes from a n(n-1)/2 problem to a simpler n/2 problem.
b. It goes from a n(n-1) problem to a simpler n/2 problem.
c. It goes from a n(n-1)/2 problem to a simpler n problem.
d. It goes from a n(n-1) problem to a simpler n problem.
c. It goes from a n(n-1)/2 problem to a simpler n problem.
- What is the purpose of adding “salt” values to every users’ password in the hashed password file?
a. It effectively prevents any brute-force attack on the password file.
b. It provides a stronger secret value with which to encrypt the passwords.
c. It prevents an attacker from being able to do a direct comparison of the password file against
an already hashed dictionary.
d. The salt is used as an encryption key for the user’s chosen password, thus permitting the
computer to strengthen the human’s possibly weak password.
c. It prevents an attacker from being able to do a direct comparison of the password file against
an already hashed dictionary.
- Hash attack #2 had the problem that the key was put in the front of the MAC. How does HMAC fix
this? (Recall that “MD” means Message Digest… same thing as a hash)
a. MD (Msg , SecretKey)
b. MD (SecretKey , MD (SecretKey, Msg))
c. MD (SecretKey, Msg, SecretKey)
d. MD (Msg , SecretKey , Recipient_Name)
b. MD (SecretKey , MD (SecretKey, Msg))