Home > Alice and Bob

In cryptography and computer security, there are a number of widely-used names for the participants in discussions and presentations about various protocols. The names are conventional, somewhat self-suggestive, sometimes humorous, and are, more or less, metasyntactic variables. They are shorthand only and have no other significance.

1 List of characters

• Alice and Bob . Generally Alice wants to send a message to Bob. Schneier suggests that these names were drawn from the 1969 movie, Bob & Carol & Ted & Alice [1].
  • Carol, as a third participant in communications. Thereafter, we often have Dave, a fourth participant, and so on alphabetically.
• Eve, an eavesdropper, is a passive attacker. While she can listen in on messages between Alice and Bob, she cannot modify them.
• Isaac, an Internet Service Provider (ISP).
• Ivan, an issuer (as in financial cryptography).
• Justin, from the justice system; specifically a lawyer.
• Mallory, (sometimes Mallet), is an active attacker; unlike Eve, Mallory can modify messages, substitute his own messages, replay old messages, and so on. The problem of securing a system against Mallory is much greater than against Eve.
• Matilda, a merchant (as in ecommerce or financial cryptography).
• Pat, see Peggy.
• Peggy, a prover, and Victor ($), a verifier, often must interact in some way to show that the intended transaction has actually taken place. They are often found in zero knowledge proofs. Another name pair sometimes used is Pat and Vanna (after the host and letter-turner on the Wheel of Fortune televison show).
• Plod, a police officer (or, as the case may be, a customs officer, or a member of the intelligence services).
• Oscar, an opponent, is usually taken as equivalent to Mallory.
• Trudy, an intruder, is more dangerous than Eve because she can modify messages in transit. Bob and Alice should ideally be able to detect any such modification and either ignore the changed message, or retrieve the correct message despite the intrusion. If they can't, Trudy can cause much mischief.
• Trent, a trusted arbitrator, is some kind of neutral third party, whose exact role varies with the protocol under discussion.
• Vanna, see Peggy.
• Victor, see Peggy.
• Walter, a warden, may be needed to guard Alice and Bob in some respect, depending on the protocol being discussed.

Although interactive proof systems is not (quite) a cryptographic protocol, it is sufficiently closely related to mention its literature's 'cast of characters':

• Arthur and Merlin: In IPSs, the prover has unbounded computational ability and is hence associated with Merlin, the powerful wizard. He claims the truth of a statement, and ArthurKing Arthur is an important figure in the mythology of Britain. He is the central character in Arthurian legends (known as the Matter of Britain), although there is disagreement about whether Arthur, or a model for him, ever actually existed and in the ea, the wise king, questions him to verify the claim. These two characters also give the name for two complexity classIn computational complexity theory, a complexity class is a set of problems of related complexity. A typical complexity class has a definition of the form: :the set of problems that can be solved by machine M using O(f n ) of resource R n is the size of tes, namely MAMA or ma may stand for: ma a two-letter English word meaning Mother Ma transliteration of Chinese family name ,, etc. Ma (mythology) Magister Artium or Master of Arts M. see Master's degree Massachusetts (U. state) Mega-annum millions of years milli amper and AM.