A computer (the computer) accesses a server (the server) using the Internet via end-to-end
encryption, so that the encryption and the decryption are done at the computer and at the server
machine. From the following, identify all that can become Eve in the Alice-Bob-Eve framework.
✘The computer inCorrect
✔The internet service providers Correct
Eve could have compromised the ISP (this is outside of Alice/Bob who perform the
encryption/decryption)
✔The router to which the Laptop connects Correct
Eve could have compromised the router (this is outside of Alice/Bob who perform the
encryption/decryption)
✔Another computer that shares the network with the computer Correct
Eve could be in the form of a computer and could have compromised the network (this is outside of
Alice/Bob who perform the encryption/decryption)
✘The server incorrect
Attacker knowledge models (common assumptions)
These are standard levels of what the attacker may have access to:
1. Ciphertext-only (CO)
o Knows: Only intercepted ciphertexts (encrypted messages).
o Doesn't know: Plaintext, keys, internal algorithm state.
o Implication: Attacker tries frequency analysis, statistical attacks, brute force.
2. Known-plaintext (KP)
o Knows: Some pairs of plaintext and corresponding ciphertext.
o Doesn't know: The secret key (usually).
o Implication: Can help deduce key or reduce search space (useful against weak
ciphers).
3. Chosen-plaintext (CP)
o Knows/controls: Can request encryption of plaintexts of their choosing (e.g., oracle).
o Doesn't know: Secret key.
o Implication: Powerful; can reveal structure, recover keys for some schemes (block-
cipher modes, padding oracles).
4. Chosen-ciphertext (CC)
o Knows/controls: Can submit ciphertexts and obtain their decryptions (or error
messages).
o Doesn't know: Secret key.
o Implication: Can break systems via padding-oracle and adaptive attacks unless
scheme is CCA-secure.
5. Adaptive chosen- (adaptive CP/CC)*
o Attacker picks inputs based on previous outputs — most powerful realistic attacker
model.
6. Insider / key-exposure
o Knows: Some secret material (partial key, credentials).
o Doesn't know: Remaining secret bits (maybe).
o Implication: Even partial exposure can be catastrophic; forward secrecy helps limit
damage.
7. Side-channel / physical
o Knows: Timing, power, electromagnetic emissions, error messages, etc.
o Doesn't know: The secret directly, but can infer it.
o Implication: Crypto must defend beyond math — constant-time code, masking,
shielding.
8. Computational-power / resource
o Knows: May be bounded (classical attacker) or large (nation-state, quantum?).
o Doesn't know: Typically the secret key, but enough computational power can brute-
force.
o Implication: Key sizes and algorithm choice must match expected attacker resources
(post-quantum considerations).
Kerckhoffs’s Principle (Short and Crucial)
Statement:
A cryptosystem should remain secure even if everything about the system is known to the attacker —
except the secret key.
🧠 Meaning:
The security of a cryptographic system must depend only on the secrecy of the key, not on
the secrecy of the algorithm or design.
In other words, even if an attacker knows the encryption method, they cannot decrypt
messages without the key.