skip to content

Which control class actually stops NT hash and Kerberos ticket reuse?

level: seniorimportance: nice to knowfreq 36%

answer

  1. name what the technique cannot substitute
  2. static, long-lived, replayable secret-equivalent
  3. verifier should hold nothing usable
  4. fresh signature over a fresh challenge
  5. shorten lifetime, shrink scope, then replace

basics

~20 s

Only changing what the verifier accepts. Move to proof that cannot be replayed - a fresh signature over a challenge, checked against a public key, as in FIDO2/WebAuthn - then shorten and scope whatever static material remains.

solid answer

~50 s

Reuse depends on one thing the technique cannot substitute: a **static, long-lived, replayable value** that both the verifier holds and the client must supply. Take that away and the technique has nothing to carry. The control class that does it is asymmetric proof — the verifier stores only a public key and each authentication is a fresh signature over a challenge, which is what FIDO2/WebAuthn provides for people and short-lived certificates provide for services. What the verifier keeps is then useless if stolen, and what the client keeps can be hardware-bound and non-exportable. Where that migration is not finished, the two partial controls that matter are **lifetime** (short tickets, frequent rotation of long-term keys) and **scope** (per-host identities and authentication restrictions, so one stolen derivative reaches one service rather than sixty hosts). Password length, complexity and lockout address guessing, and no guessing is happening.

go deeper

for a junior

Know that making passwords longer does not help against reuse of what the password derives into, because no guessing is taking place.

for a middle

Explain why a verifier holding only a public key changes the picture: the stored side is no longer a credential and each authentication needs a fresh signature.

for a senior

Rank the available controls and defend the ranking — scope, then lifetime, then replacing the accepted proof — and state precisely what each one buys and what it costs operationally.

for a principal

Own the framing that only one of the three removes the technique while the others tax it, and be ready to justify running the cheap yield-reducing controls now against funding the migration that ends it.

## Start from what the technique cannot do without The useful habit for any attack question is to name the one input the technique cannot substitute, then ask which control class removes it. For credential reuse the input is a **static secret-equivalent accepted by the verifier**. Three properties have to hold together: 1. The value is the same on every use (static). 2. It stays valid over a long period (long-lived). 3. Presenting it is sufficient — nothing binds the presentation to this session, this client or this relying party (replayable). Break any one of those and reuse degrades. Break the first properly and it disappears. ## The control class that removes it **Asymmetric, challenge-bound proof.** The verifier stores a public key; the client holds a private key and produces a **fresh signature over a fresh challenge** on every authentication. Two consequences follow immediately: - What the verifier stores is not a credential. Stealing the whole store yields public keys, so the entire class of "the store is the login" vanishes. - What the client holds can be made non-exportable — generated in and never leaving a hardware key store — so there is no derivative to lift in the first place. For human authentication this is FIDO2/WebAuthn, which additionally binds the assertion to the relying party's origin, so the proof is not merely unreplayable but also not usable against a different service. For machine and service identity the same shape appears as **short-lived certificates** issued to a host or workload, where the private key is host-bound and the credential expires in hours rather than persisting as a keytab. Note what this is not: it is not "stronger hashing" and not "a better password policy". It is a change to *what counts as proof*. ## The two partial controls, and what each buys Most estates cannot make that change everywhere at once, so it is worth being precise about the fallbacks. **Lifetime.** Shorten ticket lifetimes so issued proof expires sooner; rotate long-term keys often enough that a stolen keytab has a short useful life; let managed identities rotate their own passwords on a machine schedule rather than a human one. This does not stop reuse; it caps the duration of each instance of it. It also has a cost: shorter lifetimes mean more issuance traffic and more operational fragility around clock skew and unattended jobs. **Scope.** This is the underrated one. Reuse hurts in proportion to how many verifiers accept the same object. A single service identity whose keytab sits on sixty hosts means one compromised host yields sixty. Per-host identities, service-specific accounts, and restrictions on which systems an account may authenticate to convert a fleet-wide compromise into a single-host one. Nothing about the technique changes; its yield collapses. ## Controls that feel relevant and are not Being able to say why these miss is usually the discriminating part of the answer: - **Password length and complexity.** They price guessing. Nobody is guessing. A 40-character random password produces a derivative that is accepted exactly as readily as a weak one's. - **Account lockout.** It counts failed attempts. Reuse produces successful authentications on the first try. - **A stronger storage function.** It raises the cost of recovering plaintext, which is the step reuse skips. - **Multi-factor at the interactive front door.** It sits in front of the path that collects typed text. The derivative path does not traverse it, so the identity remains reachable behind the factor. MFA raises the cost of obtaining a first credential; it does not change what the protocol accepts afterwards. - **Rotating after an incident.** Necessary, but it closes acquisition rather than possession, and anything already issued lives out its own clock. ## Choosing, when you cannot do everything If you are the architect for a domain-joined Linux fleet reached through a shared jump host, the ranking is usually: 1. **Scope first**, because it is cheap and it changes the yield of every future compromise, not just this technique. Per-host identity beats one shared identity everywhere. 2. **Lifetime second**, because it is a configuration change with a known operational tail. 3. **Change the accepted proof** as the programme, not the sprint — it touches every service that authenticates, and it is the only one of the three that removes the technique rather than taxing it. The answer an interviewer is listening for is that ordering plus the reason behind it: the first two make reuse less profitable, and only the third makes it impossible.

  • Why doesn't multi-factor authentication on that account help here?
    Because the factor guards the path that collects typed text. The reuse path never reaches it — the protocol accepts the key or ticket and grants access on that basis. Multi-factor raises the cost of obtaining a first credential and leaves untouched what the verifier accepts once a derivative is in hand.
  • If you cannot migrate sixty hosts off shared keytabs this year, what is the highest-value partial step?
    Scope. Give each host its own identity and restrict which services and hosts each may authenticate to, so a stolen derivative authenticates as one host rather than as a fleet-wide identity. Then shorten ticket lifetimes so what is taken expires sooner. Both are configuration, not a programme.
  • What makes FIDO2/WebAuthn different from just using a certificate?
    Both replace a shared secret with an asymmetric proof, which is the main win. WebAuthn adds origin binding, so an assertion produced for one relying party is not usable against another, and it expects the private key to be generated in and never leave a hardware key store. A certificate's private key is only as bound as its storage.

Rotating and lengthening the password is arguing about which key to hide under the mat. Asymmetric proof removes the mat: the lock now asks for something new every time, and the copy the building keeps opens nothing.

saying these in an interview costs you the question

  • Recommends longer or more complex passwords as the fix
  • Says multi-factor authentication blocks derivative reuse
  • Proposes account lockout against an attack with no failed attempts
  • Treats a stronger storage function as removing the technique
  • Ignores scope, leaving one identity accepted by the whole fleet

context