a. OTP (i.e., a One-Time Password)
b. PvtKey{challenge}
c. Hash (PrivateKey, challenge)
d. SecretKey{challenge}
c. Hash (PrivateKey, challenge)
c. It is “self-protected” already via the CA’s digital signature.
b. prove possession of a shared (symmetric) secret or a private key.
a. Humans generally cannot remember “strong” secrets: computers can.
d. Two different user certificates have a common signing CA somewhere in their signing chain.
a. hash(challenge, SecretKey)
a. Session keys are never re-used.
c. increasing her vulnerability to a having that password stolen from her computer.
b. Asymmetric Key encryption/decryption
b. a CA certificate that has been “signed” by a CA from a different PKI hierarchy/domain.
b. knowledge (or possession) of a secret is proven without revealing the secret in transit.
d. It allows two remote entities to confidentially create a shared (symmetric) key.
c. It goes from a n(n-1)/2 problem to a simpler n problem.
c. It prevents an attacker from being able to do a direct comparison of the password file against
an already hashed dictionary.
b. MD (SecretKey , MD (SecretKey, Msg))
c. Attacker creates two different messages that suit his purpose that hash to the same value.
b. CA1 , PubKeyCA1 PvtKeyCA2{hash (CA1 , PubKeyCA1)}
d. only the root CA’s public key.
c. UserPvt{R} (and—optionally—the user’s digital certificate)
b. could be replayed to the same recipient or a different recipient.
Msg#D: Attacker __I’m Alice, R4_______ Server
The complete ticket is __KBK{KAB}__ ? The session key is __KAB_____ ?
d. Because the person being authenticated may be maliciously duped into “signing” something of an attacker’s choosing.