Suppose we use symmetric keys for authentication and each of N users must be able to authenticate
Fantastic news! We've Found the answer you've been seeking!
Question:
Suppose we use symmetric keys for authentication and each of N users must be able to authenticate any of the other N — 1 users. Evidently, such a system requires one symmetric key for each pair of users, or on the order of N2 keys. On the other hand, if we use public keys, only N key pairs are required, but we must then deal with PKI issues.
a. Kerberos authentication uses symmetric keys, yet only N keys are required for N users. How is this accomplished?
b. In Kerberos, no PKI is required. But, in security, there is no free lunch, so what's the tradeoff?
Related Book For
Foundations of Lodging Management
ISBN: 978-0132560894
2nd edition
Authors: David K. Hayes, Jack D. Ninemeier, Allisha A. Miller.
Posted Date: