g of protocols in computer networks= Jein th

Let's start by defining an Internet Protocol (IP) address. What use do mnemonic addresses serve? Is the number of domains that a 32-bit representation can store finite? Is there a limit to how many machines a domain may hold?

Needham and Schroeder suggest the following variant of their protocol: 1. Alice → Bob : Alice 2. Bob→ Alice: {Alice rand3}kBob 3. Alice → Cathy : {Alice Bob rand₁|{Alice rand3}kBob} 4. Cathy → Alice: {Alice Bob rand₁|ksession|{Alice rand3|ksession}KBob}KAlice 5. Alice → Bob: {Alice rand3|ksession}kBob 6. Bob→ Alice: {rand2}ksession 7. Alice → Bob: {rand2-1}ksession Show that this protocol solves the problem of replay as a result of stolen session keys. Hint: Consider two cases, one in which the attacker does not send an initial message to Bob and one in which the attacker does.

Find the odd man out. JNS, JL, JAL, BL a) JNS b) BL c) JAL d) JL